./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.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_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/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_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/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_8f6fda34-b626-4347-874e-cda53e3863f3/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 906036225f588312d23f50dd6f109319810cf1ead43ce885e134bcc5a0be0190 --- 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:30:10,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 15:30:10,612 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 15:30:10,642 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 15:30:10,642 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 15:30:10,646 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 15:30:10,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 15:30:10,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 15:30:10,657 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 15:30:10,663 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 15:30:10,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 15:30:10,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 15:30:10,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 15:30:10,670 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 15:30:10,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 15:30:10,674 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 15:30:10,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 15:30:10,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 15:30:10,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 15:30:10,685 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 15:30:10,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 15:30:10,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 15:30:10,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 15:30:10,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 15:30:10,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 15:30:10,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 15:30:10,703 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 15:30:10,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 15:30:10,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 15:30:10,707 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 15:30:10,708 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 15:30:10,708 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 15:30:10,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 15:30:10,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 15:30:10,713 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 15:30:10,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 15:30:10,714 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 15:30:10,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 15:30:10,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 15:30:10,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 15:30:10,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 15:30:10,718 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 15:30:10,762 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 15:30:10,762 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 15:30:10,763 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 15:30:10,763 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 15:30:10,765 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 15:30:10,765 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 15:30:10,766 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 15:30:10,766 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 15:30:10,766 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 15:30:10,767 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 15:30:10,768 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 15:30:10,768 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 15:30:10,769 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 15:30:10,769 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 15:30:10,769 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 15:30:10,770 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 15:30:10,770 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 15:30:10,770 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 15:30:10,771 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 15:30:10,772 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 15:30:10,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 15:30:10,772 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 15:30:10,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 15:30:10,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 15:30:10,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 15:30:10,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 15:30:10,774 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 15:30:10,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 15:30:10,775 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 15:30:10,775 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 15:30:10,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 15:30:10,776 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 15:30:10,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:30:10,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 15:30:10,777 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 15:30:10,777 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 15:30:10,778 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 15:30:10,778 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 15:30:10,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 15:30:10,779 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 15:30:10,779 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 15:30:10,779 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_8f6fda34-b626-4347-874e-cda53e3863f3/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_8f6fda34-b626-4347-874e-cda53e3863f3/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 -> 906036225f588312d23f50dd6f109319810cf1ead43ce885e134bcc5a0be0190 [2022-11-23 15:30:11,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 15:30:11,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 15:30:11,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 15:30:11,151 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 15:30:11,151 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 15:30:11,153 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2022-11-23 15:30:14,385 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 15:30:14,643 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 15:30:14,649 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2022-11-23 15:30:14,664 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/data/7b5b1b6ce/2056743aef694dcca2d320cc64b6ab73/FLAGf7ea3d207 [2022-11-23 15:30:14,681 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/data/7b5b1b6ce/2056743aef694dcca2d320cc64b6ab73 [2022-11-23 15:30:14,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 15:30:14,686 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 15:30:14,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 15:30:14,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 15:30:14,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 15:30:14,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:30:14" (1/1) ... [2022-11-23 15:30:14,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10acdf8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:14, skipping insertion in model container [2022-11-23 15:30:14,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:30:14" (1/1) ... [2022-11-23 15:30:14,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 15:30:14,770 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 15:30:15,016 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_8f6fda34-b626-4347-874e-cda53e3863f3/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c[14682,14695] [2022-11-23 15:30:15,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:30:15,036 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 15:30:15,108 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_8f6fda34-b626-4347-874e-cda53e3863f3/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c[14682,14695] [2022-11-23 15:30:15,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:30:15,128 INFO L208 MainTranslator]: Completed translation [2022-11-23 15:30:15,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:15 WrapperNode [2022-11-23 15:30:15,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 15:30:15,130 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 15:30:15,130 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 15:30:15,130 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 15:30:15,139 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:30:15" (1/1) ... [2022-11-23 15:30:15,152 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:30:15" (1/1) ... [2022-11-23 15:30:15,207 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 479 [2022-11-23 15:30:15,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 15:30:15,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 15:30:15,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 15:30:15,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 15:30:15,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:15" (1/1) ... [2022-11-23 15:30:15,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:15" (1/1) ... [2022-11-23 15:30:15,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:15" (1/1) ... [2022-11-23 15:30:15,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:15" (1/1) ... [2022-11-23 15:30:15,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:15" (1/1) ... [2022-11-23 15:30:15,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:15" (1/1) ... [2022-11-23 15:30:15,257 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:15" (1/1) ... [2022-11-23 15:30:15,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:15" (1/1) ... [2022-11-23 15:30:15,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 15:30:15,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 15:30:15,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 15:30:15,266 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 15:30:15,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:15" (1/1) ... [2022-11-23 15:30:15,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:30:15,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:30:15,302 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 15:30:15,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 15:30:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2022-11-23 15:30:15,381 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2022-11-23 15:30:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 15:30:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2022-11-23 15:30:15,382 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2022-11-23 15:30:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-11-23 15:30:15,382 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-11-23 15:30:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2022-11-23 15:30:15,383 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2022-11-23 15:30:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-23 15:30:15,383 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-23 15:30:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 15:30:15,384 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2022-11-23 15:30:15,384 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2022-11-23 15:30:15,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 15:30:15,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 15:30:15,385 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2022-11-23 15:30:15,385 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2022-11-23 15:30:15,499 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 15:30:15,502 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 15:30:16,345 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 15:30:16,510 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 15:30:16,510 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-23 15:30:16,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:30:16 BoogieIcfgContainer [2022-11-23 15:30:16,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 15:30:16,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 15:30:16,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 15:30:16,520 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 15:30:16,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:30:14" (1/3) ... [2022-11-23 15:30:16,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f1fb05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:30:16, skipping insertion in model container [2022-11-23 15:30:16,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:15" (2/3) ... [2022-11-23 15:30:16,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f1fb05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:30:16, skipping insertion in model container [2022-11-23 15:30:16,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:30:16" (3/3) ... [2022-11-23 15:30:16,524 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2022-11-23 15:30:16,547 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 15:30:16,548 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 15:30:16,641 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 15:30:16,648 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;@2047d9d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 15:30:16,648 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 15:30:16,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 109 states have (on average 1.5412844036697249) internal successors, (168), 111 states have internal predecessors, (168), 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:30:16,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-23 15:30:16,662 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:30:16,663 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:30:16,663 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:30:16,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:30:16,668 INFO L85 PathProgramCache]: Analyzing trace with hash -587422489, now seen corresponding path program 1 times [2022-11-23 15:30:16,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:30:16,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452101816] [2022-11-23 15:30:16,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:30:16,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:30:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:30:17,289 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:30:17,290 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:30:17,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452101816] [2022-11-23 15:30:17,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452101816] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:30:17,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:30:17,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:30:17,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421200300] [2022-11-23 15:30:17,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:30:17,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:30:17,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:30:17,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:30:17,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:30:17,365 INFO L87 Difference]: Start difference. First operand has 149 states, 109 states have (on average 1.5412844036697249) internal successors, (168), 111 states have internal predecessors, (168), 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:30:17,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:30:17,604 INFO L93 Difference]: Finished difference Result 298 states and 487 transitions. [2022-11-23 15:30:17,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:30:17,608 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:30:17,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:30:17,623 INFO L225 Difference]: With dead ends: 298 [2022-11-23 15:30:17,623 INFO L226 Difference]: Without dead ends: 152 [2022-11-23 15:30:17,633 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:30:17,640 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 5 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:30:17,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 635 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:30:17,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-23 15:30:17,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-11-23 15:30:17,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 112 states have (on average 1.5089285714285714) internal successors, (169), 113 states have internal predecessors, (169), 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:30:17,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2022-11-23 15:30:17,703 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 19 [2022-11-23 15:30:17,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:30:17,704 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2022-11-23 15:30:17,704 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:30:17,704 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2022-11-23 15:30:17,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-23 15:30:17,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:30:17,706 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:30:17,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 15:30:17,707 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:30:17,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:30:17,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2123470677, now seen corresponding path program 1 times [2022-11-23 15:30:17,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:30:17,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647305849] [2022-11-23 15:30:17,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:30:17,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:30:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:30:17,864 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:30:17,864 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:30:17,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647305849] [2022-11-23 15:30:17,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647305849] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:30:17,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:30:17,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:30:17,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238144899] [2022-11-23 15:30:17,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:30:17,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:30:17,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:30:17,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:30:17,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:30:17,868 INFO L87 Difference]: Start difference. First operand 152 states and 231 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:30:18,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:30:18,359 INFO L93 Difference]: Finished difference Result 432 states and 672 transitions. [2022-11-23 15:30:18,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 15:30:18,360 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:30:18,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:30:18,367 INFO L225 Difference]: With dead ends: 432 [2022-11-23 15:30:18,368 INFO L226 Difference]: Without dead ends: 283 [2022-11-23 15:30:18,374 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:30:18,378 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 570 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 593 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.4s IncrementalHoareTripleChecker+Time [2022-11-23 15:30:18,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 593 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 15:30:18,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-11-23 15:30:18,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 186. [2022-11-23 15:30:18,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 141 states have (on average 1.5106382978723405) internal successors, (213), 141 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:30:18,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 281 transitions. [2022-11-23 15:30:18,445 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 281 transitions. Word has length 30 [2022-11-23 15:30:18,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:30:18,445 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 281 transitions. [2022-11-23 15:30:18,445 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:30:18,446 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 281 transitions. [2022-11-23 15:30:18,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 15:30:18,448 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:30:18,448 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:30:18,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 15:30:18,449 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:30:18,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:30:18,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1933284694, now seen corresponding path program 1 times [2022-11-23 15:30:18,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:30:18,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926577858] [2022-11-23 15:30:18,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:30:18,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:30:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:30:18,672 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:30:18,672 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:30:18,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926577858] [2022-11-23 15:30:18,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926577858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:30:18,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:30:18,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:30:18,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426426879] [2022-11-23 15:30:18,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:30:18,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:30:18,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:30:18,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:30:18,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:30:18,679 INFO L87 Difference]: Start difference. First operand 186 states and 281 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:30:19,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:30:19,054 INFO L93 Difference]: Finished difference Result 432 states and 670 transitions. [2022-11-23 15:30:19,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 15:30:19,055 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:30:19,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:30:19,059 INFO L225 Difference]: With dead ends: 432 [2022-11-23 15:30:19,059 INFO L226 Difference]: Without dead ends: 283 [2022-11-23 15:30:19,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:30:19,069 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 566 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 596 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:30:19,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 596 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 15:30:19,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-11-23 15:30:19,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 186. [2022-11-23 15:30:19,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 141 states have (on average 1.50354609929078) internal successors, (212), 141 states have internal predecessors, (212), 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:30:19,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 280 transitions. [2022-11-23 15:30:19,122 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 280 transitions. Word has length 31 [2022-11-23 15:30:19,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:30:19,123 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 280 transitions. [2022-11-23 15:30:19,123 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:30:19,123 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 280 transitions. [2022-11-23 15:30:19,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-23 15:30:19,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:30:19,128 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:30:19,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 15:30:19,129 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:30:19,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:30:19,130 INFO L85 PathProgramCache]: Analyzing trace with hash -412159435, now seen corresponding path program 1 times [2022-11-23 15:30:19,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:30:19,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363824737] [2022-11-23 15:30:19,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:30:19,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:30:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:30:19,408 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:30:19,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:30:19,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363824737] [2022-11-23 15:30:19,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363824737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:30:19,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:30:19,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:30:19,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516748540] [2022-11-23 15:30:19,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:30:19,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:30:19,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:30:19,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:30:19,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:30:19,413 INFO L87 Difference]: Start difference. First operand 186 states and 280 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:30:19,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:30:19,490 INFO L93 Difference]: Finished difference Result 340 states and 514 transitions. [2022-11-23 15:30:19,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:30:19,491 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:30:19,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:30:19,495 INFO L225 Difference]: With dead ends: 340 [2022-11-23 15:30:19,496 INFO L226 Difference]: Without dead ends: 191 [2022-11-23 15:30:19,496 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:30:19,506 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 6 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 647 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:30:19,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 647 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:30:19,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-23 15:30:19,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2022-11-23 15:30:19,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 145 states have (on average 1.4896551724137932) internal successors, (216), 145 states have internal predecessors, (216), 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:30:19,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 284 transitions. [2022-11-23 15:30:19,536 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 284 transitions. Word has length 33 [2022-11-23 15:30:19,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:30:19,537 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 284 transitions. [2022-11-23 15:30:19,538 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:30:19,538 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 284 transitions. [2022-11-23 15:30:19,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-23 15:30:19,545 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:30:19,545 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:30:19,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 15:30:19,546 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:30:19,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:30:19,547 INFO L85 PathProgramCache]: Analyzing trace with hash 409718619, now seen corresponding path program 1 times [2022-11-23 15:30:19,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:30:19,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91724555] [2022-11-23 15:30:19,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:30:19,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:30:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:30:19,873 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:30:19,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:30:19,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91724555] [2022-11-23 15:30:19,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91724555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:30:19,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:30:19,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:30:19,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256346698] [2022-11-23 15:30:19,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:30:19,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:30:19,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:30:19,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:30:19,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:30:19,884 INFO L87 Difference]: Start difference. First operand 191 states and 284 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:30:19,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:30:19,988 INFO L93 Difference]: Finished difference Result 350 states and 525 transitions. [2022-11-23 15:30:19,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:30:19,989 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:30:19,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:30:19,993 INFO L225 Difference]: With dead ends: 350 [2022-11-23 15:30:19,993 INFO L226 Difference]: Without dead ends: 196 [2022-11-23 15:30:19,994 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:30:19,995 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 6 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 633 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:30:19,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 633 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:30:19,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-11-23 15:30:20,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-11-23 15:30:20,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 149 states have (on average 1.476510067114094) internal successors, (220), 149 states have internal predecessors, (220), 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:30:20,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 288 transitions. [2022-11-23 15:30:20,030 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 288 transitions. Word has length 41 [2022-11-23 15:30:20,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:30:20,034 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 288 transitions. [2022-11-23 15:30:20,035 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:30:20,035 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 288 transitions. [2022-11-23 15:30:20,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-23 15:30:20,037 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:30:20,038 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:30:20,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 15:30:20,039 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:30:20,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:30:20,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1785752869, now seen corresponding path program 1 times [2022-11-23 15:30:20,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:30:20,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762729837] [2022-11-23 15:30:20,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:30:20,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:30:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:30:20,299 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:30:20,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:30:20,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762729837] [2022-11-23 15:30:20,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762729837] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:30:20,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:30:20,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:30:20,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971425345] [2022-11-23 15:30:20,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:30:20,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:30:20,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:30:20,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:30:20,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:30:20,304 INFO L87 Difference]: Start difference. First operand 196 states and 288 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:30:20,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:30:20,391 INFO L93 Difference]: Finished difference Result 359 states and 529 transitions. [2022-11-23 15:30:20,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:30:20,391 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:30:20,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:30:20,395 INFO L225 Difference]: With dead ends: 359 [2022-11-23 15:30:20,396 INFO L226 Difference]: Without dead ends: 200 [2022-11-23 15:30:20,397 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:30:20,398 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 5 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 642 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:30:20,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 642 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:30:20,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-11-23 15:30:20,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2022-11-23 15:30:20,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 152 states have internal predecessors, (223), 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:30:20,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 291 transitions. [2022-11-23 15:30:20,427 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 291 transitions. Word has length 49 [2022-11-23 15:30:20,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:30:20,428 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 291 transitions. [2022-11-23 15:30:20,428 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:30:20,428 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 291 transitions. [2022-11-23 15:30:20,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-23 15:30:20,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:30:20,430 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:30:20,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 15:30:20,430 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:30:20,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:30:20,431 INFO L85 PathProgramCache]: Analyzing trace with hash -112755124, now seen corresponding path program 1 times [2022-11-23 15:30:20,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:30:20,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179957995] [2022-11-23 15:30:20,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:30:20,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:30:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:30:20,650 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:30:20,650 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:30:20,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179957995] [2022-11-23 15:30:20,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179957995] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:30:20,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:30:20,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:30:20,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558871803] [2022-11-23 15:30:20,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:30:20,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:30:20,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:30:20,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:30:20,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:30:20,653 INFO L87 Difference]: Start difference. First operand 200 states and 291 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:30:20,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:30:20,732 INFO L93 Difference]: Finished difference Result 368 states and 539 transitions. [2022-11-23 15:30:20,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:30:20,732 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:30:20,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:30:20,734 INFO L225 Difference]: With dead ends: 368 [2022-11-23 15:30:20,734 INFO L226 Difference]: Without dead ends: 205 [2022-11-23 15:30:20,735 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:30:20,736 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 6 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:30:20,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 633 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:30:20,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-11-23 15:30:20,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-11-23 15:30:20,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 156 states have (on average 1.455128205128205) internal successors, (227), 156 states have internal predecessors, (227), 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:30:20,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 295 transitions. [2022-11-23 15:30:20,754 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 295 transitions. Word has length 49 [2022-11-23 15:30:20,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:30:20,755 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 295 transitions. [2022-11-23 15:30:20,755 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:30:20,755 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 295 transitions. [2022-11-23 15:30:20,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-23 15:30:20,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:30:20,757 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:30:20,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 15:30:20,757 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:30:20,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:30:20,758 INFO L85 PathProgramCache]: Analyzing trace with hash 336667308, now seen corresponding path program 1 times [2022-11-23 15:30:20,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:30:20,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478033041] [2022-11-23 15:30:20,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:30:20,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:30:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:30:20,960 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:30:20,961 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:30:20,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478033041] [2022-11-23 15:30:20,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478033041] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:30:20,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:30:20,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:30:20,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709275953] [2022-11-23 15:30:20,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:30:20,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:30:20,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:30:20,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:30:20,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:30:20,964 INFO L87 Difference]: Start difference. First operand 205 states and 295 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:30:21,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:30:21,040 INFO L93 Difference]: Finished difference Result 379 states and 546 transitions. [2022-11-23 15:30:21,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:30:21,041 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:30:21,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:30:21,043 INFO L225 Difference]: With dead ends: 379 [2022-11-23 15:30:21,043 INFO L226 Difference]: Without dead ends: 211 [2022-11-23 15:30:21,044 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:30:21,044 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 7 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 644 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:30:21,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 644 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:30:21,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-11-23 15:30:21,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2022-11-23 15:30:21,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 161 states have (on average 1.4409937888198758) internal successors, (232), 161 states have internal predecessors, (232), 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:30:21,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 300 transitions. [2022-11-23 15:30:21,066 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 300 transitions. Word has length 57 [2022-11-23 15:30:21,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:30:21,067 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 300 transitions. [2022-11-23 15:30:21,067 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:30:21,067 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 300 transitions. [2022-11-23 15:30:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-23 15:30:21,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:30:21,069 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:30:21,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 15:30:21,069 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:30:21,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:30:21,070 INFO L85 PathProgramCache]: Analyzing trace with hash 318354813, now seen corresponding path program 1 times [2022-11-23 15:30:21,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:30:21,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044823882] [2022-11-23 15:30:21,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:30:21,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:30:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:30:21,579 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:30:21,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:30:21,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044823882] [2022-11-23 15:30:21,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044823882] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:30:21,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708513813] [2022-11-23 15:30:21,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:30:21,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:30:21,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:30:21,586 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:30:21,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 15:30:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:30:21,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-23 15:30:21,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:30:22,025 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:30:22,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:30:22,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708513813] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:30:22,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:30:22,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2022-11-23 15:30:22,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436802603] [2022-11-23 15:30:22,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:30:22,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 15:30:22,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:30:22,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 15:30:22,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-11-23 15:30:22,028 INFO L87 Difference]: Start difference. First operand 211 states and 300 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:30:22,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:30:22,398 INFO L93 Difference]: Finished difference Result 598 states and 836 transitions. [2022-11-23 15:30:22,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 15:30:22,399 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:30:22,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:30:22,402 INFO L225 Difference]: With dead ends: 598 [2022-11-23 15:30:22,402 INFO L226 Difference]: Without dead ends: 398 [2022-11-23 15:30:22,403 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:30:22,404 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 222 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:30:22,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1160 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:30:22,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-11-23 15:30:22,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 395. [2022-11-23 15:30:22,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 299 states have (on average 1.4214046822742474) internal successors, (425), 300 states have internal predecessors, (425), 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:30:22,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 555 transitions. [2022-11-23 15:30:22,449 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 555 transitions. Word has length 60 [2022-11-23 15:30:22,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:30:22,450 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 555 transitions. [2022-11-23 15:30:22,450 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:30:22,450 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 555 transitions. [2022-11-23 15:30:22,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-23 15:30:22,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:30:22,452 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:30:22,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 15:30:22,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:30:22,665 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:30:22,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:30:22,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1150745224, now seen corresponding path program 1 times [2022-11-23 15:30:22,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:30:22,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916534015] [2022-11-23 15:30:22,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:30:22,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:30:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:30:23,185 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:30:23,185 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:30:23,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916534015] [2022-11-23 15:30:23,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916534015] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:30:23,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461120334] [2022-11-23 15:30:23,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:30:23,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:30:23,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:30:23,188 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:30:23,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 15:30:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:30:23,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-23 15:30:23,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:30:23,868 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:30:23,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:30:24,096 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:30:24,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461120334] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:30:24,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [168382363] [2022-11-23 15:30:24,124 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2022-11-23 15:30:24,124 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:30:24,133 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:30:24,139 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:30:24,139 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:30:28,946 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 123 for LOIs [2022-11-23 15:30:28,989 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 146 for LOIs [2022-11-23 15:30:29,021 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 148 for LOIs [2022-11-23 15:30:29,114 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:30:48,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [168382363] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:30:48,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:30:48,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [9, 9, 9] total 36 [2022-11-23 15:30:48,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651401783] [2022-11-23 15:30:48,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:30:48,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-23 15:30:48,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:30:48,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 15:30:48,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1133, Unknown=0, NotChecked=0, Total=1260 [2022-11-23 15:30:48,480 INFO L87 Difference]: Start difference. First operand 395 states and 555 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:30:56,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:30:56,170 INFO L93 Difference]: Finished difference Result 819 states and 1158 transitions. [2022-11-23 15:30:56,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 15:30:56,172 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:30:56,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:30:56,177 INFO L225 Difference]: With dead ends: 819 [2022-11-23 15:30:56,177 INFO L226 Difference]: Without dead ends: 464 [2022-11-23 15:30:56,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 152 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=136, Invalid=1196, Unknown=0, NotChecked=0, Total=1332 [2022-11-23 15:30:56,180 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 138 mSDsluCounter, 2869 mSDsCounter, 0 mSdLazyCounter, 1885 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 3150 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:30:56,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 3150 Invalid, 1913 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 1885 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-11-23 15:30:56,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-11-23 15:30:56,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 441. [2022-11-23 15:30:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 330 states have (on average 1.4) internal successors, (462), 331 states have internal predecessors, (462), 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:30:56,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 618 transitions. [2022-11-23 15:30:56,272 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 618 transitions. Word has length 62 [2022-11-23 15:30:56,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:30:56,273 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 618 transitions. [2022-11-23 15:30:56,273 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:30:56,273 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 618 transitions. [2022-11-23 15:30:56,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-23 15:30:56,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:30:56,275 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:30:56,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 15:30:56,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:30:56,483 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:30:56,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:30:56,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1800492968, now seen corresponding path program 1 times [2022-11-23 15:30:56,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:30:56,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362430933] [2022-11-23 15:30:56,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:30:56,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:30:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:30:56,981 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:30:56,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:30:56,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362430933] [2022-11-23 15:30:56,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362430933] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:30:56,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841845833] [2022-11-23 15:30:56,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:30:56,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:30:56,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:30:56,984 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:30:56,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 15:30:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:30:57,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-23 15:30:57,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:30:57,513 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:30:57,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:30:57,716 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:30:57,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841845833] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:30:57,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [210979383] [2022-11-23 15:30:57,720 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2022-11-23 15:30:57,720 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:30:57,721 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:30:57,721 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:30:57,721 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:31:01,425 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 123 for LOIs [2022-11-23 15:31:01,469 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 145 for LOIs [2022-11-23 15:31:01,500 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 148 for LOIs [2022-11-23 15:31:01,586 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:31:21,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [210979383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:31:21,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:31:21,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [9, 9, 9] total 36 [2022-11-23 15:31:21,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882710130] [2022-11-23 15:31:21,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:31:21,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-23 15:31:21,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:31:21,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 15:31:21,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2022-11-23 15:31:21,643 INFO L87 Difference]: Start difference. First operand 441 states and 618 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:31:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:31:29,290 INFO L93 Difference]: Finished difference Result 888 states and 1254 transitions. [2022-11-23 15:31:29,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 15:31:29,291 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:31:29,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:31:29,294 INFO L225 Difference]: With dead ends: 888 [2022-11-23 15:31:29,295 INFO L226 Difference]: Without dead ends: 522 [2022-11-23 15:31:29,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 152 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=178, Invalid=1154, Unknown=0, NotChecked=0, Total=1332 [2022-11-23 15:31:29,298 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 104 mSDsluCounter, 3029 mSDsCounter, 0 mSdLazyCounter, 2060 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 3319 SdHoareTripleChecker+Invalid, 2077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:31:29,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 3319 Invalid, 2077 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [17 Valid, 2060 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-11-23 15:31:29,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-11-23 15:31:29,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 499. [2022-11-23 15:31:29,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 371 states have (on average 1.371967654986523) internal successors, (509), 372 states have internal predecessors, (509), 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:31:29,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 693 transitions. [2022-11-23 15:31:29,432 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 693 transitions. Word has length 62 [2022-11-23 15:31:29,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:31:29,433 INFO L495 AbstractCegarLoop]: Abstraction has 499 states and 693 transitions. [2022-11-23 15:31:29,433 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:31:29,433 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 693 transitions. [2022-11-23 15:31:29,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-23 15:31:29,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:31:29,435 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:31:29,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-23 15:31:29,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:31:29,642 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:31:29,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:31:29,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1548964461, now seen corresponding path program 1 times [2022-11-23 15:31:29,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:31:29,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221939543] [2022-11-23 15:31:29,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:31:29,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:31:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:31:30,119 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:31:30,119 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:31:30,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221939543] [2022-11-23 15:31:30,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221939543] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:31:30,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194182773] [2022-11-23 15:31:30,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:31:30,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:31:30,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:31:30,122 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:31:30,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 15:31:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:31:30,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-23 15:31:30,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:31:30,633 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:31:30,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:31:30,828 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:31:30,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194182773] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:31:30,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [290789460] [2022-11-23 15:31:30,832 INFO L159 IcfgInterpreter]: Started Sifa with 59 locations of interest [2022-11-23 15:31:30,832 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:31:30,833 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:31:30,833 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:31:30,833 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:31:34,448 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 125 for LOIs [2022-11-23 15:31:34,493 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 146 for LOIs [2022-11-23 15:31:34,521 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 140 for LOIs [2022-11-23 15:31:34,592 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:31:56,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [290789460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:31:56,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:31:56,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [9, 9, 9] total 38 [2022-11-23 15:31:56,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599245461] [2022-11-23 15:31:56,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:31:56,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-23 15:31:56,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:31:56,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-23 15:31:56,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1230, Unknown=0, NotChecked=0, Total=1406 [2022-11-23 15:31:56,835 INFO L87 Difference]: Start difference. First operand 499 states and 693 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:32:07,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:32:07,786 INFO L93 Difference]: Finished difference Result 923 states and 1299 transitions. [2022-11-23 15:32:07,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-23 15:32:07,787 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:32:07,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:32:07,791 INFO L225 Difference]: With dead ends: 923 [2022-11-23 15:32:07,792 INFO L226 Difference]: Without dead ends: 568 [2022-11-23 15:32:07,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 156 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=185, Invalid=1297, Unknown=0, NotChecked=0, Total=1482 [2022-11-23 15:32:07,797 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 149 mSDsluCounter, 4627 mSDsCounter, 0 mSdLazyCounter, 3029 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 4947 SdHoareTripleChecker+Invalid, 3062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-11-23 15:32:07,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 4947 Invalid, 3062 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 3029 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2022-11-23 15:32:07,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2022-11-23 15:32:07,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 528. [2022-11-23 15:32:07,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 390 states have (on average 1.358974358974359) internal successors, (530), 391 states have internal predecessors, (530), 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:32:07,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 732 transitions. [2022-11-23 15:32:07,941 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 732 transitions. Word has length 64 [2022-11-23 15:32:07,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:32:07,942 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 732 transitions. [2022-11-23 15:32:07,942 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:32:07,942 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 732 transitions. [2022-11-23 15:32:07,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-23 15:32:07,944 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:32:07,944 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:32:07,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 15:32:08,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-23 15:32:08,152 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:32:08,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:32:08,152 INFO L85 PathProgramCache]: Analyzing trace with hash -906390962, now seen corresponding path program 1 times [2022-11-23 15:32:08,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:32:08,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091287792] [2022-11-23 15:32:08,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:32:08,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:32:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:32:08,321 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:32:08,321 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:32:08,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091287792] [2022-11-23 15:32:08,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091287792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:32:08,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:32:08,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:32:08,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846680741] [2022-11-23 15:32:08,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:32:08,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:32:08,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:32:08,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:32:08,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:32:08,325 INFO L87 Difference]: Start difference. First operand 528 states and 732 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:32:08,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:32:08,549 INFO L93 Difference]: Finished difference Result 948 states and 1343 transitions. [2022-11-23 15:32:08,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:32:08,550 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:32:08,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:32:08,556 INFO L225 Difference]: With dead ends: 948 [2022-11-23 15:32:08,556 INFO L226 Difference]: Without dead ends: 536 [2022-11-23 15:32:08,558 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:32:08,560 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 5 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 642 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:32:08,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 642 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:32:08,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2022-11-23 15:32:08,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2022-11-23 15:32:08,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 396 states have (on average 1.3535353535353536) internal successors, (536), 397 states have internal predecessors, (536), 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:32:08,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 738 transitions. [2022-11-23 15:32:08,753 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 738 transitions. Word has length 66 [2022-11-23 15:32:08,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:32:08,754 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 738 transitions. [2022-11-23 15:32:08,754 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:32:08,754 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 738 transitions. [2022-11-23 15:32:08,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-23 15:32:08,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:32:08,757 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:32:08,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 15:32:08,757 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:32:08,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:32:08,758 INFO L85 PathProgramCache]: Analyzing trace with hash -79097432, now seen corresponding path program 1 times [2022-11-23 15:32:08,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:32:08,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568918367] [2022-11-23 15:32:08,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:32:08,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:32:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:32:09,220 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:32:09,220 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:32:09,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568918367] [2022-11-23 15:32:09,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568918367] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:32:09,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777040778] [2022-11-23 15:32:09,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:32:09,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:32:09,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:32:09,223 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:32:09,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 15:32:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:32:09,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-23 15:32:09,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:32:09,702 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:32:09,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:32:09,893 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:32:09,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777040778] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:32:09,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [847749611] [2022-11-23 15:32:09,898 INFO L159 IcfgInterpreter]: Started Sifa with 60 locations of interest [2022-11-23 15:32:09,898 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:32:09,899 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:32:09,899 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:32:09,899 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:32:14,646 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 231 for LOIs [2022-11-23 15:32:14,900 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 146 for LOIs [2022-11-23 15:32:14,928 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 192 for LOIs [2022-11-23 15:32:15,082 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 154 for LOIs [2022-11-23 15:32:15,127 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 151 for LOIs [2022-11-23 15:32:15,184 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 148 for LOIs [2022-11-23 15:32:15,244 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:33:07,177 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '16654#(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:33:07,177 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 15:33:07,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:33:07,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-11-23 15:33:07,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878190597] [2022-11-23 15:33:07,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:33:07,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 15:33:07,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:33:07,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 15:33:07,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2707, Unknown=0, NotChecked=0, Total=2970 [2022-11-23 15:33:07,180 INFO L87 Difference]: Start difference. First operand 536 states and 738 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:33:07,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:33:07,984 INFO L93 Difference]: Finished difference Result 1290 states and 1808 transitions. [2022-11-23 15:33:07,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 15:33:07,985 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:33:07,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:33:07,991 INFO L225 Difference]: With dead ends: 1290 [2022-11-23 15:33:07,991 INFO L226 Difference]: Without dead ends: 882 [2022-11-23 15:33:07,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 153 SyntacticMatches, 12 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 52.2s TimeCoverageRelationStatistics Valid=287, Invalid=3253, Unknown=0, NotChecked=0, Total=3540 [2022-11-23 15:33:07,994 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 307 mSDsluCounter, 2308 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 2652 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 15:33:07,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 2652 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 15:33:07,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2022-11-23 15:33:08,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 558. [2022-11-23 15:33:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 411 states have (on average 1.316301703163017) internal successors, (541), 414 states have internal predecessors, (541), 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:33:08,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 739 transitions. [2022-11-23 15:33:08,195 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 739 transitions. Word has length 70 [2022-11-23 15:33:08,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:33:08,196 INFO L495 AbstractCegarLoop]: Abstraction has 558 states and 739 transitions. [2022-11-23 15:33:08,196 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:33:08,196 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 739 transitions. [2022-11-23 15:33:08,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-23 15:33:08,198 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:33:08,198 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:33:08,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 15:33:08,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-23 15:33:08,410 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:33:08,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:33:08,411 INFO L85 PathProgramCache]: Analyzing trace with hash -402698391, now seen corresponding path program 1 times [2022-11-23 15:33:08,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:33:08,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757643532] [2022-11-23 15:33:08,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:33:08,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:33:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:33:08,748 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:33:08,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:33:08,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757643532] [2022-11-23 15:33:08,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757643532] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:33:08,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:33:08,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 15:33:08,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961024934] [2022-11-23 15:33:08,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:33:08,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 15:33:08,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:33:08,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 15:33:08,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:33:08,751 INFO L87 Difference]: Start difference. First operand 558 states and 739 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:33:09,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:33:09,723 INFO L93 Difference]: Finished difference Result 1229 states and 1709 transitions. [2022-11-23 15:33:09,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 15:33:09,724 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:33:09,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:33:09,729 INFO L225 Difference]: With dead ends: 1229 [2022-11-23 15:33:09,729 INFO L226 Difference]: Without dead ends: 918 [2022-11-23 15:33:09,732 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:33:09,733 INFO L413 NwaCegarLoop]: 413 mSDtfsCounter, 690 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1650 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 15:33:09,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1650 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 15:33:09,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2022-11-23 15:33:09,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 692. [2022-11-23 15:33:09,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 508 states have (on average 1.3169291338582678) internal successors, (669), 511 states have internal predecessors, (669), 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:33:09,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 915 transitions. [2022-11-23 15:33:09,956 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 915 transitions. Word has length 71 [2022-11-23 15:33:09,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:33:09,956 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 915 transitions. [2022-11-23 15:33:09,957 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:33:09,957 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 915 transitions. [2022-11-23 15:33:09,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-23 15:33:09,958 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:33:09,958 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:33:09,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 15:33:09,959 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:33:09,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:33:09,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1273014078, now seen corresponding path program 1 times [2022-11-23 15:33:09,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:33:09,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689505618] [2022-11-23 15:33:09,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:33:09,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:33:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:33:10,215 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:33:10,216 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:33:10,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689505618] [2022-11-23 15:33:10,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689505618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:33:10,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:33:10,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 15:33:10,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969014372] [2022-11-23 15:33:10,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:33:10,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 15:33:10,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:33:10,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 15:33:10,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:33:10,219 INFO L87 Difference]: Start difference. First operand 692 states and 915 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:33:11,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:33:11,302 INFO L93 Difference]: Finished difference Result 1582 states and 2191 transitions. [2022-11-23 15:33:11,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 15:33:11,303 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:33:11,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:33:11,309 INFO L225 Difference]: With dead ends: 1582 [2022-11-23 15:33:11,309 INFO L226 Difference]: Without dead ends: 1241 [2022-11-23 15:33:11,311 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:33:11,311 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 735 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 2073 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 15:33:11,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 2073 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 15:33:11,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2022-11-23 15:33:11,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 950. [2022-11-23 15:33:11,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 695 states have (on average 1.3237410071942446) internal successors, (920), 700 states have internal predecessors, (920), 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:33:11,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1258 transitions. [2022-11-23 15:33:11,602 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1258 transitions. Word has length 73 [2022-11-23 15:33:11,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:33:11,603 INFO L495 AbstractCegarLoop]: Abstraction has 950 states and 1258 transitions. [2022-11-23 15:33:11,603 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:33:11,603 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1258 transitions. [2022-11-23 15:33:11,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-23 15:33:11,604 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:33:11,605 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:33:11,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-23 15:33:11,605 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:33:11,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:33:11,606 INFO L85 PathProgramCache]: Analyzing trace with hash -800153821, now seen corresponding path program 1 times [2022-11-23 15:33:11,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:33:11,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357684641] [2022-11-23 15:33:11,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:33:11,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:33:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:33:11,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 15:33:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:33:11,736 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 15:33:11,736 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 15:33:11,737 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-23 15:33:11,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-23 15:33:11,743 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:33:11,747 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 15:33:11,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:33:11 BoogieIcfgContainer [2022-11-23 15:33:11,848 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 15:33:11,848 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 15:33:11,848 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 15:33:11,849 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 15:33:11,849 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:30:16" (3/4) ... [2022-11-23 15:33:11,851 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 15:33:11,956 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 15:33:11,956 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 15:33:11,956 INFO L158 Benchmark]: Toolchain (without parser) took 177270.71ms. Allocated memory was 186.6MB in the beginning and 520.1MB in the end (delta: 333.4MB). Free memory was 140.3MB in the beginning and 401.5MB in the end (delta: -261.2MB). Peak memory consumption was 75.4MB. Max. memory is 16.1GB. [2022-11-23 15:33:11,957 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 151.0MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:33:11,957 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.01ms. Allocated memory is still 186.6MB. Free memory was 139.6MB in the beginning and 122.1MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-23 15:33:11,957 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.00ms. Allocated memory is still 186.6MB. Free memory was 122.1MB in the beginning and 119.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:33:11,958 INFO L158 Benchmark]: Boogie Preprocessor took 56.87ms. Allocated memory is still 186.6MB. Free memory was 119.4MB in the beginning and 116.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 15:33:11,958 INFO L158 Benchmark]: RCFGBuilder took 1248.25ms. Allocated memory is still 186.6MB. Free memory was 116.5MB in the beginning and 122.6MB in the end (delta: -6.1MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2022-11-23 15:33:11,958 INFO L158 Benchmark]: TraceAbstraction took 175331.64ms. Allocated memory was 186.6MB in the beginning and 520.1MB in the end (delta: 333.4MB). Free memory was 121.5MB in the beginning and 416.1MB in the end (delta: -294.7MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2022-11-23 15:33:11,959 INFO L158 Benchmark]: Witness Printer took 107.76ms. Allocated memory is still 520.1MB. Free memory was 416.1MB in the beginning and 401.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-23 15:33:11,960 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 151.0MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.01ms. Allocated memory is still 186.6MB. Free memory was 139.6MB in the beginning and 122.1MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.00ms. Allocated memory is still 186.6MB. Free memory was 122.1MB in the beginning and 119.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.87ms. Allocated memory is still 186.6MB. Free memory was 119.4MB in the beginning and 116.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1248.25ms. Allocated memory is still 186.6MB. Free memory was 116.5MB in the beginning and 122.6MB in the end (delta: -6.1MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. * TraceAbstraction took 175331.64ms. Allocated memory was 186.6MB in the beginning and 520.1MB in the end (delta: 333.4MB). Free memory was 121.5MB in the beginning and 416.1MB in the end (delta: -294.7MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. * Witness Printer took 107.76ms. Allocated memory is still 520.1MB. Free memory was 416.1MB in the beginning and 401.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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: 618]: 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 1 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val [L257] RET write_manual_selection_history(manual_selection) [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val [L276] RET write_side1_failed_history(side1Failed) [L277] COND FALSE !(\read(side1Failed)) [L284] side1 = s1s1_old [L285] s1s1_old = nomsg [L286] side2 = s2s1_old [L287] s2s1_old = nomsg [L288] manual_selection = cs1_old [L289] cs1_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L290] COND TRUE (int )side1 == (int )side2 [L291] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, 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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, 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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=-2, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L408] COND TRUE (int )side1 == (int )nomsg [L409] COND FALSE !((int )side2 == 0) [L412] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; [L447] COND TRUE ! side1Failed [L448] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND TRUE ! tmp___0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L458] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=-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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L460] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND TRUE ! tmp___2 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L462] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, unknown-#in~index-unknown=1] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L462] tmp___3 = read_side2_failed_history((unsigned char)1) [L463] COND TRUE ! tmp___3 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L464] CALL, EXPR read_side2_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L464] tmp___4 = read_side2_failed_history((unsigned char)0) [L465] COND TRUE ! tmp___4 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L466] COND FALSE !(! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L471] COND FALSE !(! (! ((int )side1_written == 0))) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L476] COND TRUE ! (! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L477] COND TRUE ! ((int )side2_written == 0) [L478] return (0); VAL [\result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, unknown-#in~arg-unknown=0] [L616] 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, unknown-#in~arg-unknown=0] [L618] 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, unknown-#in~arg-unknown=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 149 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 175.1s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 31.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3630 SdHoareTripleChecker+Valid, 24.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3521 mSDsluCounter, 24616 SdHoareTripleChecker+Invalid, 22.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20273 mSDsCounter, 571 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9090 IncrementalHoareTripleChecker+Invalid, 9661 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 571 mSolverCounterUnsat, 4343 mSDtfsCounter, 9090 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, 118.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=950occurred 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.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 1124 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 1230 NumberOfCodeBlocks, 1230 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1388 ConstructedInterpolants, 0 QuantifiedInterpolants, 4767 SizeOfPredicates, 68 NumberOfNonLiveVariables, 1993 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: 12.6s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 12, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 104, DAG_INTERPRETER_EARLY_EXITS: 3, TOOLS_POST_APPLICATIONS: 101, TOOLS_POST_TIME: 3.2s, TOOLS_POST_CALL_APPLICATIONS: 36, TOOLS_POST_CALL_TIME: 4.3s, TOOLS_POST_RETURN_APPLICATIONS: 24, TOOLS_POST_RETURN_TIME: 2.1s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 161, TOOLS_QUANTIFIERELIM_TIME: 9.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.4s, 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.4s, 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:33:11,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f6fda34-b626-4347-874e-cda53e3863f3/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