./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 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/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_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI --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-5e519f3 [2022-11-03 03:47:25,439 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:47:25,441 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:47:25,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:47:25,477 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:47:25,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:47:25,480 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:47:25,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:47:25,483 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:47:25,484 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:47:25,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:47:25,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:47:25,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:47:25,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:47:25,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:47:25,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:47:25,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:47:25,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:47:25,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:47:25,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:47:25,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:47:25,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:47:25,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:47:25,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:47:25,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:47:25,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:47:25,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:47:25,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:47:25,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:47:25,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:47:25,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:47:25,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:47:25,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:47:25,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:47:25,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:47:25,525 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:47:25,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:47:25,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:47:25,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:47:25,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:47:25,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:47:25,534 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 03:47:25,586 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:47:25,586 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:47:25,587 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:47:25,588 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:47:25,589 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:47:25,589 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:47:25,589 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:47:25,590 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:47:25,590 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:47:25,590 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:47:25,592 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:47:25,592 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:47:25,592 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:47:25,592 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:47:25,593 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:47:25,593 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:47:25,593 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:47:25,594 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:47:25,594 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:47:25,595 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:47:25,595 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:47:25,595 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:47:25,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:47:25,597 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:47:25,598 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:47:25,598 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:47:25,598 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:47:25,599 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:47:25,599 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:47:25,599 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:47:25,599 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:47:25,600 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:47:25,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:47:25,600 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:47:25,601 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:47:25,601 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:47:25,601 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:47:25,602 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:47:25,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:47:25,602 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:47:25,602 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:47:25,603 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_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/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_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI 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-03 03:47:25,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:47:26,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:47:26,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:47:26,018 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:47:26,019 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:47:26,021 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2022-11-03 03:47:26,120 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/data/20c1ac0c5/d32ccd6e4cbc45f499ad1c5bef6b4bc6/FLAG28c46eb2f [2022-11-03 03:47:26,781 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:47:26,782 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2022-11-03 03:47:26,796 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/data/20c1ac0c5/d32ccd6e4cbc45f499ad1c5bef6b4bc6/FLAG28c46eb2f [2022-11-03 03:47:27,038 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/data/20c1ac0c5/d32ccd6e4cbc45f499ad1c5bef6b4bc6 [2022-11-03 03:47:27,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:47:27,046 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:47:27,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:47:27,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:47:27,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:47:27,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:47:27" (1/1) ... [2022-11-03 03:47:27,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76d6daab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:27, skipping insertion in model container [2022-11-03 03:47:27,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:47:27" (1/1) ... [2022-11-03 03:47:27,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:47:27,120 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:47:27,510 WARN L230 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_c415cffe-455a-4713-a7b0-e40635d517e3/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c[14682,14695] [2022-11-03 03:47:27,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:47:27,532 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:47:27,640 WARN L230 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_c415cffe-455a-4713-a7b0-e40635d517e3/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c[14682,14695] [2022-11-03 03:47:27,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:47:27,669 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:47:27,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:27 WrapperNode [2022-11-03 03:47:27,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:47:27,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:47:27,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:47:27,671 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:47:27,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:27" (1/1) ... [2022-11-03 03:47:27,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:27" (1/1) ... [2022-11-03 03:47:27,728 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 535 [2022-11-03 03:47:27,729 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:47:27,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:47:27,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:47:27,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:47:27,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:27" (1/1) ... [2022-11-03 03:47:27,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:27" (1/1) ... [2022-11-03 03:47:27,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:27" (1/1) ... [2022-11-03 03:47:27,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:27" (1/1) ... [2022-11-03 03:47:27,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:27" (1/1) ... [2022-11-03 03:47:27,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:27" (1/1) ... [2022-11-03 03:47:27,764 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:27" (1/1) ... [2022-11-03 03:47:27,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:27" (1/1) ... [2022-11-03 03:47:27,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:47:27,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:47:27,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:47:27,772 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:47:27,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:27" (1/1) ... [2022-11-03 03:47:27,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:47:27,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:47:27,807 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:47:27,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:47:27,848 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2022-11-03 03:47:27,849 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2022-11-03 03:47:27,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:47:27,849 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2022-11-03 03:47:27,849 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2022-11-03 03:47:27,849 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-11-03 03:47:27,850 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-11-03 03:47:27,850 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2022-11-03 03:47:27,850 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2022-11-03 03:47:27,850 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-03 03:47:27,850 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-03 03:47:27,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:47:27,851 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2022-11-03 03:47:27,851 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2022-11-03 03:47:27,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:47:27,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:47:27,851 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2022-11-03 03:47:27,852 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2022-11-03 03:47:27,985 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:47:27,988 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:47:28,814 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:47:29,078 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:47:29,079 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-03 03:47:29,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:47:29 BoogieIcfgContainer [2022-11-03 03:47:29,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:47:29,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:47:29,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:47:29,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:47:29,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:47:27" (1/3) ... [2022-11-03 03:47:29,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ded29a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:47:29, skipping insertion in model container [2022-11-03 03:47:29,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:27" (2/3) ... [2022-11-03 03:47:29,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ded29a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:47:29, skipping insertion in model container [2022-11-03 03:47:29,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:47:29" (3/3) ... [2022-11-03 03:47:29,115 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2022-11-03 03:47:29,139 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:47:29,139 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 03:47:29,250 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:47:29,260 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;@727ab98e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:47:29,261 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 03:47:29,271 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-03 03:47:29,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 03:47:29,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:47:29,282 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-03 03:47:29,283 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:47:29,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:47:29,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1402390635, now seen corresponding path program 1 times [2022-11-03 03:47:29,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:47:29,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000890031] [2022-11-03 03:47:29,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:47:29,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:47:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:47:29,959 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-03 03:47:29,959 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:47:29,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000890031] [2022-11-03 03:47:29,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000890031] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:47:29,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:47:29,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:47:29,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949238384] [2022-11-03 03:47:29,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:47:29,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:47:29,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:47:30,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:47:30,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:47:30,016 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-03 03:47:30,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:47:30,229 INFO L93 Difference]: Finished difference Result 298 states and 487 transitions. [2022-11-03 03:47:30,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:47:30,232 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-03 03:47:30,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:47:30,241 INFO L225 Difference]: With dead ends: 298 [2022-11-03 03:47:30,241 INFO L226 Difference]: Without dead ends: 152 [2022-11-03 03:47:30,246 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-03 03:47:30,249 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 5 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:47:30,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 623 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:47:30,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-03 03:47:30,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-11-03 03:47:30,324 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-03 03:47:30,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2022-11-03 03:47:30,329 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 19 [2022-11-03 03:47:30,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:47:30,330 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2022-11-03 03:47:30,330 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-03 03:47:30,330 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2022-11-03 03:47:30,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 03:47:30,331 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:47:30,332 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-03 03:47:30,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:47:30,332 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:47:30,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:47:30,333 INFO L85 PathProgramCache]: Analyzing trace with hash 698242933, now seen corresponding path program 1 times [2022-11-03 03:47:30,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:47:30,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854853145] [2022-11-03 03:47:30,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:47:30,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:47:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:47:30,575 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-03 03:47:30,575 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:47:30,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854853145] [2022-11-03 03:47:30,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854853145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:47:30,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:47:30,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:47:30,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290046097] [2022-11-03 03:47:30,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:47:30,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:47:30,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:47:30,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:47:30,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:47:30,582 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-03 03:47:31,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:47:31,023 INFO L93 Difference]: Finished difference Result 432 states and 672 transitions. [2022-11-03 03:47:31,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:47:31,024 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-03 03:47:31,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:47:31,027 INFO L225 Difference]: With dead ends: 432 [2022-11-03 03:47:31,028 INFO L226 Difference]: Without dead ends: 283 [2022-11-03 03:47:31,030 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-03 03:47:31,031 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 566 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:47:31,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 593 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:47:31,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-11-03 03:47:31,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 186. [2022-11-03 03:47:31,067 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-03 03:47:31,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 281 transitions. [2022-11-03 03:47:31,070 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 281 transitions. Word has length 30 [2022-11-03 03:47:31,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:47:31,070 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 281 transitions. [2022-11-03 03:47:31,071 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-03 03:47:31,071 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 281 transitions. [2022-11-03 03:47:31,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 03:47:31,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:47:31,073 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-03 03:47:31,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 03:47:31,073 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:47:31,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:47:31,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1421239568, now seen corresponding path program 1 times [2022-11-03 03:47:31,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:47:31,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399951108] [2022-11-03 03:47:31,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:47:31,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:47:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:47:31,372 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-03 03:47:31,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:47:31,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399951108] [2022-11-03 03:47:31,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399951108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:47:31,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:47:31,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:47:31,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180330431] [2022-11-03 03:47:31,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:47:31,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:47:31,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:47:31,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:47:31,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:47:31,378 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-03 03:47:31,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:47:31,887 INFO L93 Difference]: Finished difference Result 432 states and 670 transitions. [2022-11-03 03:47:31,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:47:31,888 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-03 03:47:31,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:47:31,893 INFO L225 Difference]: With dead ends: 432 [2022-11-03 03:47:31,893 INFO L226 Difference]: Without dead ends: 283 [2022-11-03 03:47:31,896 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-03 03:47:31,906 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 562 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:47:31,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 596 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:47:31,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-11-03 03:47:31,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 186. [2022-11-03 03:47:31,944 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-03 03:47:31,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 280 transitions. [2022-11-03 03:47:31,946 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 280 transitions. Word has length 31 [2022-11-03 03:47:31,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:47:31,947 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 280 transitions. [2022-11-03 03:47:31,948 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-03 03:47:31,948 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 280 transitions. [2022-11-03 03:47:31,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 03:47:31,949 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:47:31,950 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-03 03:47:31,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 03:47:31,950 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:47:31,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:47:31,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1401044311, now seen corresponding path program 1 times [2022-11-03 03:47:31,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:47:31,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207123497] [2022-11-03 03:47:31,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:47:31,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:47:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:47:32,269 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-03 03:47:32,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:47:32,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207123497] [2022-11-03 03:47:32,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207123497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:47:32,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:47:32,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:47:32,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681127259] [2022-11-03 03:47:32,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:47:32,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:47:32,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:47:32,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:47:32,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:47:32,273 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-03 03:47:32,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:47:32,368 INFO L93 Difference]: Finished difference Result 340 states and 514 transitions. [2022-11-03 03:47:32,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:47:32,369 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-03 03:47:32,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:47:32,370 INFO L225 Difference]: With dead ends: 340 [2022-11-03 03:47:32,371 INFO L226 Difference]: Without dead ends: 191 [2022-11-03 03:47:32,371 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-03 03:47:32,372 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 6 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:47:32,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 635 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:47:32,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-03 03:47:32,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2022-11-03 03:47:32,395 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-03 03:47:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 284 transitions. [2022-11-03 03:47:32,397 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 284 transitions. Word has length 33 [2022-11-03 03:47:32,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:47:32,398 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 284 transitions. [2022-11-03 03:47:32,398 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-03 03:47:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 284 transitions. [2022-11-03 03:47:32,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-03 03:47:32,399 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:47:32,400 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-03 03:47:32,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 03:47:32,400 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:47:32,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:47:32,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1975676803, now seen corresponding path program 1 times [2022-11-03 03:47:32,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:47:32,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796163774] [2022-11-03 03:47:32,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:47:32,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:47:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:47:32,596 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-03 03:47:32,596 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:47:32,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796163774] [2022-11-03 03:47:32,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796163774] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:47:32,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:47:32,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:47:32,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61540535] [2022-11-03 03:47:32,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:47:32,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:47:32,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:47:32,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:47:32,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:47:32,600 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-03 03:47:32,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:47:32,714 INFO L93 Difference]: Finished difference Result 350 states and 525 transitions. [2022-11-03 03:47:32,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:47:32,715 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-03 03:47:32,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:47:32,717 INFO L225 Difference]: With dead ends: 350 [2022-11-03 03:47:32,717 INFO L226 Difference]: Without dead ends: 196 [2022-11-03 03:47:32,718 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-03 03:47:32,719 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 6 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:47:32,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 621 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:47:32,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-11-03 03:47:32,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-11-03 03:47:32,743 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-03 03:47:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 288 transitions. [2022-11-03 03:47:32,745 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 288 transitions. Word has length 41 [2022-11-03 03:47:32,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:47:32,746 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 288 transitions. [2022-11-03 03:47:32,746 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-03 03:47:32,747 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 288 transitions. [2022-11-03 03:47:32,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-03 03:47:32,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:47:32,749 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-03 03:47:32,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 03:47:32,750 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:47:32,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:47:32,750 INFO L85 PathProgramCache]: Analyzing trace with hash -819289017, now seen corresponding path program 1 times [2022-11-03 03:47:32,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:47:32,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744404033] [2022-11-03 03:47:32,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:47:32,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:47:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:47:32,995 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-03 03:47:32,995 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:47:32,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744404033] [2022-11-03 03:47:32,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744404033] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:47:32,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:47:32,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:47:32,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958475493] [2022-11-03 03:47:32,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:47:32,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:47:32,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:47:32,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:47:33,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:47:33,001 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-03 03:47:33,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:47:33,123 INFO L93 Difference]: Finished difference Result 359 states and 529 transitions. [2022-11-03 03:47:33,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:47:33,124 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-03 03:47:33,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:47:33,128 INFO L225 Difference]: With dead ends: 359 [2022-11-03 03:47:33,129 INFO L226 Difference]: Without dead ends: 200 [2022-11-03 03:47:33,130 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-03 03:47:33,132 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 5 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:47:33,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 630 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:47:33,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-11-03 03:47:33,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2022-11-03 03:47:33,163 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-03 03:47:33,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 291 transitions. [2022-11-03 03:47:33,165 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 291 transitions. Word has length 49 [2022-11-03 03:47:33,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:47:33,166 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 291 transitions. [2022-11-03 03:47:33,166 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-03 03:47:33,166 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 291 transitions. [2022-11-03 03:47:33,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-03 03:47:33,176 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:47:33,177 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-03 03:47:33,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 03:47:33,177 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:47:33,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:47:33,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1577170286, now seen corresponding path program 1 times [2022-11-03 03:47:33,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:47:33,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705030413] [2022-11-03 03:47:33,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:47:33,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:47:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:47:33,456 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-03 03:47:33,456 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:47:33,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705030413] [2022-11-03 03:47:33,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705030413] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:47:33,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:47:33,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:47:33,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023754923] [2022-11-03 03:47:33,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:47:33,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:47:33,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:47:33,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:47:33,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:47:33,459 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-03 03:47:33,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:47:33,567 INFO L93 Difference]: Finished difference Result 368 states and 539 transitions. [2022-11-03 03:47:33,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:47:33,568 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-03 03:47:33,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:47:33,574 INFO L225 Difference]: With dead ends: 368 [2022-11-03 03:47:33,574 INFO L226 Difference]: Without dead ends: 205 [2022-11-03 03:47:33,575 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-03 03:47:33,579 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 6 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:47:33,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 621 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:47:33,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-11-03 03:47:33,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-11-03 03:47:33,608 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-03 03:47:33,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 295 transitions. [2022-11-03 03:47:33,611 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 295 transitions. Word has length 49 [2022-11-03 03:47:33,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:47:33,612 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 295 transitions. [2022-11-03 03:47:33,612 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-03 03:47:33,612 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 295 transitions. [2022-11-03 03:47:33,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-03 03:47:33,617 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:47:33,618 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-03 03:47:33,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 03:47:33,618 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:47:33,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:47:33,619 INFO L85 PathProgramCache]: Analyzing trace with hash 46065614, now seen corresponding path program 1 times [2022-11-03 03:47:33,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:47:33,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927968499] [2022-11-03 03:47:33,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:47:33,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:47:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:47:33,986 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-03 03:47:33,986 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:47:33,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927968499] [2022-11-03 03:47:33,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927968499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:47:33,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:47:33,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:47:33,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121709702] [2022-11-03 03:47:33,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:47:33,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:47:33,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:47:33,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:47:33,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:47:33,992 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-03 03:47:34,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:47:34,089 INFO L93 Difference]: Finished difference Result 379 states and 546 transitions. [2022-11-03 03:47:34,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:47:34,090 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-03 03:47:34,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:47:34,096 INFO L225 Difference]: With dead ends: 379 [2022-11-03 03:47:34,096 INFO L226 Difference]: Without dead ends: 211 [2022-11-03 03:47:34,097 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-03 03:47:34,098 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 7 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:47:34,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 632 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:47:34,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-11-03 03:47:34,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2022-11-03 03:47:34,130 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-03 03:47:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 300 transitions. [2022-11-03 03:47:34,132 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 300 transitions. Word has length 57 [2022-11-03 03:47:34,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:47:34,134 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 300 transitions. [2022-11-03 03:47:34,135 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-03 03:47:34,135 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 300 transitions. [2022-11-03 03:47:34,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-03 03:47:34,137 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:47:34,137 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-03 03:47:34,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 03:47:34,138 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:47:34,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:47:34,138 INFO L85 PathProgramCache]: Analyzing trace with hash 202306747, now seen corresponding path program 1 times [2022-11-03 03:47:34,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:47:34,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487675745] [2022-11-03 03:47:34,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:47:34,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:47:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:47:34,706 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-03 03:47:34,706 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:47:34,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487675745] [2022-11-03 03:47:34,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487675745] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:47:34,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096247263] [2022-11-03 03:47:34,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:47:34,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:47:34,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:47:34,712 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:47:34,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 03:47:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:47:34,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 03:47:34,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:47:35,171 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-03 03:47:35,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:47:35,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096247263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:47:35,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:47:35,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2022-11-03 03:47:35,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224278813] [2022-11-03 03:47:35,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:47:35,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 03:47:35,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:47:35,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 03:47:35,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-11-03 03:47:35,175 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-03 03:47:35,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:47:35,646 INFO L93 Difference]: Finished difference Result 598 states and 836 transitions. [2022-11-03 03:47:35,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:47:35,647 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-03 03:47:35,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:47:35,650 INFO L225 Difference]: With dead ends: 598 [2022-11-03 03:47:35,650 INFO L226 Difference]: Without dead ends: 398 [2022-11-03 03:47:35,652 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-03 03:47:35,652 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 222 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:47:35,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1143 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:47:35,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-11-03 03:47:35,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 395. [2022-11-03 03:47:35,694 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-03 03:47:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 555 transitions. [2022-11-03 03:47:35,698 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 555 transitions. Word has length 60 [2022-11-03 03:47:35,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:47:35,698 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 555 transitions. [2022-11-03 03:47:35,699 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-03 03:47:35,699 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 555 transitions. [2022-11-03 03:47:35,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-03 03:47:35,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:47:35,701 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-03 03:47:35,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 03:47:35,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:47:35,926 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:47:35,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:47:35,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1935039856, now seen corresponding path program 1 times [2022-11-03 03:47:35,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:47:35,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898437384] [2022-11-03 03:47:35,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:47:35,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:47:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:47:36,527 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-03 03:47:36,528 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:47:36,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898437384] [2022-11-03 03:47:36,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898437384] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:47:36,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993271657] [2022-11-03 03:47:36,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:47:36,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:47:36,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:47:36,530 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:47:36,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 03:47:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:47:36,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-03 03:47:36,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:47:37,196 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-03 03:47:37,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:47:37,444 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-03 03:47:37,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993271657] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:47:37,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1722264688] [2022-11-03 03:47:37,477 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2022-11-03 03:47:37,478 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:47:37,483 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:47:37,491 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:47:37,492 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:47:42,108 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 111 for LOIs [2022-11-03 03:47:42,356 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 108 for LOIs [2022-11-03 03:47:42,379 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 104 for LOIs [2022-11-03 03:47:42,469 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:48:02,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1722264688] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:48:02,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:48:02,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [9, 9, 9] total 37 [2022-11-03 03:48:02,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016502397] [2022-11-03 03:48:02,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:48:02,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 03:48:02,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:48:02,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 03:48:02,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1200, Unknown=0, NotChecked=0, Total=1332 [2022-11-03 03:48:02,896 INFO L87 Difference]: Start difference. First operand 395 states and 555 transitions. Second operand has 26 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 18 states have internal predecessors, (43), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-03 03:48:13,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:48:13,698 INFO L93 Difference]: Finished difference Result 819 states and 1158 transitions. [2022-11-03 03:48:13,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-03 03:48:13,699 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 18 states have internal predecessors, (43), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 62 [2022-11-03 03:48:13,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:48:13,705 INFO L225 Difference]: With dead ends: 819 [2022-11-03 03:48:13,705 INFO L226 Difference]: Without dead ends: 464 [2022-11-03 03:48:13,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 154 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=155, Invalid=1405, Unknown=0, NotChecked=0, Total=1560 [2022-11-03 03:48:13,709 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 134 mSDsluCounter, 3234 mSDsCounter, 0 mSdLazyCounter, 2095 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 3496 SdHoareTripleChecker+Invalid, 2148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:48:13,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 3496 Invalid, 2148 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [53 Valid, 2095 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-11-03 03:48:13,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-11-03 03:48:13,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 441. [2022-11-03 03:48:13,798 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-03 03:48:13,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 618 transitions. [2022-11-03 03:48:13,802 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 618 transitions. Word has length 62 [2022-11-03 03:48:13,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:48:13,802 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 618 transitions. [2022-11-03 03:48:13,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 18 states have internal predecessors, (43), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-03 03:48:13,803 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 618 transitions. [2022-11-03 03:48:13,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-03 03:48:13,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:48:13,805 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-03 03:48:13,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-03 03:48:14,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:48:14,017 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:48:14,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:48:14,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1493661489, now seen corresponding path program 1 times [2022-11-03 03:48:14,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:48:14,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991568059] [2022-11-03 03:48:14,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:48:14,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:48:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:48:14,548 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-03 03:48:14,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:48:14,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991568059] [2022-11-03 03:48:14,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991568059] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:48:14,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256444293] [2022-11-03 03:48:14,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:48:14,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:48:14,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:48:14,550 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:48:14,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 03:48:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:48:14,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-03 03:48:14,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:48:15,065 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-03 03:48:15,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:48:15,231 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-03 03:48:15,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256444293] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:48:15,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2037561448] [2022-11-03 03:48:15,238 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2022-11-03 03:48:15,238 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:48:15,239 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:48:15,240 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:48:15,240 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:48:22,633 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 153 for LOIs [2022-11-03 03:48:23,211 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 108 for LOIs [2022-11-03 03:48:23,229 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 104 for LOIs [2022-11-03 03:48:23,294 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:48:48,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2037561448] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:48:48,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:48:48,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [9, 9, 9] total 37 [2022-11-03 03:48:48,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481470250] [2022-11-03 03:48:48,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:48:48,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 03:48:48,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:48:48,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 03:48:48,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1194, Unknown=0, NotChecked=0, Total=1332 [2022-11-03 03:48:48,774 INFO L87 Difference]: Start difference. First operand 441 states and 618 transitions. Second operand has 26 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 18 states have internal predecessors, (43), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-03 03:48:55,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:48:55,065 INFO L93 Difference]: Finished difference Result 888 states and 1254 transitions. [2022-11-03 03:48:55,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-03 03:48:55,066 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 18 states have internal predecessors, (43), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 62 [2022-11-03 03:48:55,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:48:55,068 INFO L225 Difference]: With dead ends: 888 [2022-11-03 03:48:55,068 INFO L226 Difference]: Without dead ends: 522 [2022-11-03 03:48:55,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 154 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=147, Invalid=1259, Unknown=0, NotChecked=0, Total=1406 [2022-11-03 03:48:55,071 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 98 mSDsluCounter, 2702 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 2963 SdHoareTripleChecker+Invalid, 1889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 439 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:48:55,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 2963 Invalid, 1889 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [12 Valid, 1438 Invalid, 0 Unknown, 439 Unchecked, 4.7s Time] [2022-11-03 03:48:55,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-11-03 03:48:55,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 499. [2022-11-03 03:48:55,206 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-03 03:48:55,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 693 transitions. [2022-11-03 03:48:55,209 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 693 transitions. Word has length 62 [2022-11-03 03:48:55,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:48:55,210 INFO L495 AbstractCegarLoop]: Abstraction has 499 states and 693 transitions. [2022-11-03 03:48:55,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 18 states have internal predecessors, (43), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-03 03:48:55,210 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 693 transitions. [2022-11-03 03:48:55,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-03 03:48:55,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:48:55,212 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-03 03:48:55,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 03:48:55,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 03:48:55,441 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:48:55,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:48:55,441 INFO L85 PathProgramCache]: Analyzing trace with hash -97829756, now seen corresponding path program 1 times [2022-11-03 03:48:55,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:48:55,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605630215] [2022-11-03 03:48:55,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:48:55,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:48:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:48:55,970 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-03 03:48:55,970 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:48:55,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605630215] [2022-11-03 03:48:55,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605630215] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:48:55,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921843644] [2022-11-03 03:48:55,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:48:55,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:48:55,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:48:55,973 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:48:55,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 03:48:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:48:56,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-03 03:48:56,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:48:56,533 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-03 03:48:56,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:48:56,749 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-03 03:48:56,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921843644] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:48:56,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1794805490] [2022-11-03 03:48:56,753 INFO L159 IcfgInterpreter]: Started Sifa with 59 locations of interest [2022-11-03 03:48:56,753 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:48:56,754 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:48:56,754 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:48:56,754 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:49:22,403 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 185 for LOIs [2022-11-03 03:49:25,869 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 108 for LOIs [2022-11-03 03:49:25,880 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 103 for LOIs [2022-11-03 03:49:25,923 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:49:48,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1794805490] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:49:48,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:49:48,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [9, 9, 9] total 39 [2022-11-03 03:49:48,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101346132] [2022-11-03 03:49:48,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:49:48,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-03 03:49:48,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:48,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-03 03:49:48,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1344, Unknown=0, NotChecked=0, Total=1482 [2022-11-03 03:49:48,832 INFO L87 Difference]: Start difference. First operand 499 states and 693 transitions. Second operand has 28 states, 24 states have (on average 1.875) internal successors, (45), 20 states have internal predecessors, (45), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-03 03:50:04,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:04,230 INFO L93 Difference]: Finished difference Result 923 states and 1299 transitions. [2022-11-03 03:50:04,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-03 03:50:04,231 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 1.875) internal successors, (45), 20 states have internal predecessors, (45), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 64 [2022-11-03 03:50:04,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:04,235 INFO L225 Difference]: With dead ends: 923 [2022-11-03 03:50:04,235 INFO L226 Difference]: Without dead ends: 568 [2022-11-03 03:50:04,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 158 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 30.7s TimeCoverageRelationStatistics Valid=179, Invalid=1801, Unknown=0, NotChecked=0, Total=1980 [2022-11-03 03:50:04,238 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 211 mSDsluCounter, 3761 mSDsCounter, 0 mSdLazyCounter, 2465 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 4064 SdHoareTripleChecker+Invalid, 2543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 2465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:04,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 4064 Invalid, 2543 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [78 Valid, 2465 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2022-11-03 03:50:04,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2022-11-03 03:50:04,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 528. [2022-11-03 03:50:04,395 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-03 03:50:04,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 732 transitions. [2022-11-03 03:50:04,398 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 732 transitions. Word has length 64 [2022-11-03 03:50:04,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:04,398 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 732 transitions. [2022-11-03 03:50:04,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 1.875) internal successors, (45), 20 states have internal predecessors, (45), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-03 03:50:04,399 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 732 transitions. [2022-11-03 03:50:04,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-03 03:50:04,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:04,401 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-03 03:50:04,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 03:50:04,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 03:50:04,617 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:50:04,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:04,617 INFO L85 PathProgramCache]: Analyzing trace with hash 372001254, now seen corresponding path program 1 times [2022-11-03 03:50:04,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:04,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925254463] [2022-11-03 03:50:04,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:04,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:04,835 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-03 03:50:04,836 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:04,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925254463] [2022-11-03 03:50:04,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925254463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:50:04,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:50:04,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:50:04,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689290446] [2022-11-03 03:50:04,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:50:04,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:50:04,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:04,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:50:04,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:50:04,840 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-03 03:50:05,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:05,097 INFO L93 Difference]: Finished difference Result 948 states and 1343 transitions. [2022-11-03 03:50:05,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:50:05,098 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-03 03:50:05,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:05,105 INFO L225 Difference]: With dead ends: 948 [2022-11-03 03:50:05,105 INFO L226 Difference]: Without dead ends: 536 [2022-11-03 03:50:05,107 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-03 03:50:05,110 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 5 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:05,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 630 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:50:05,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2022-11-03 03:50:05,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2022-11-03 03:50:05,246 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-03 03:50:05,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 738 transitions. [2022-11-03 03:50:05,249 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 738 transitions. Word has length 66 [2022-11-03 03:50:05,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:05,250 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 738 transitions. [2022-11-03 03:50:05,250 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-03 03:50:05,250 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 738 transitions. [2022-11-03 03:50:05,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-03 03:50:05,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:05,252 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-03 03:50:05,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 03:50:05,253 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:50:05,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:05,254 INFO L85 PathProgramCache]: Analyzing trace with hash 742316448, now seen corresponding path program 1 times [2022-11-03 03:50:05,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:05,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117634754] [2022-11-03 03:50:05,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:05,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:05,716 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-03 03:50:05,716 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:05,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117634754] [2022-11-03 03:50:05,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117634754] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:50:05,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552040114] [2022-11-03 03:50:05,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:05,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:05,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:50:05,719 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:50:05,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 03:50:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:05,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-03 03:50:05,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:50:06,227 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-03 03:50:06,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:50:06,401 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-03 03:50:06,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552040114] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:50:06,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1867780374] [2022-11-03 03:50:06,405 INFO L159 IcfgInterpreter]: Started Sifa with 60 locations of interest [2022-11-03 03:50:06,405 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:50:06,406 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:50:06,406 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:50:06,406 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:50:09,956 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 73 for LOIs [2022-11-03 03:50:09,990 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 108 for LOIs [2022-11-03 03:50:10,007 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 115 for LOIs [2022-11-03 03:50:10,081 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 111 for LOIs [2022-11-03 03:50:10,114 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 108 for LOIs [2022-11-03 03:50:10,155 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 104 for LOIs [2022-11-03 03:50:10,196 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:50:50,051 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '16671#(and (<= ~active_side_History_0~0 0) (<= 0 (+ ~manual_selection_History_0~0 128)) (<= ~s1p~0 0) (<= ~cs2~0 0) (<= 0 |#NULL.base|) (<= 0 (+ ~s1s1_new~0 1)) (<= 0 (+ 2 ~active_side_History_1~0)) (<= 0 (+ ~s2s2_new~0 1)) (<= ~s2s1~0 0) (<= ~s2s2~0 0) (<= 0 (+ ~s2s1_new~0 1)) (<= (+ ~s1p_new~0 1) 0) (<= 0 ~s1s1~0) (<= 0 ~cs2~0) (<= ~manual_selection_History_0~0 127) (= ~manual_selection_History_1~0 0) (<= 0 (+ ~s2p_new~0 1)) (= |assert_#in~arg| 0) (<= ~s1s2~0 0) (<= 0 ~s2p~0) (<= ~s2p~0 0) (<= 0 ~cs1~0) (<= 0 ~s1p~0) (<= 0 (+ ~s1s2_new~0 1)) (<= |#NULL.offset| 0) (<= 1 ~side2_written~0) (<= 0 ~active_side_History_0~0) (= assert_~arg |assert_#in~arg|) (<= (+ ~cs2_new~0 1) 0) (<= ~side2_written~0 1) (<= (+ ~s1s2_new~0 1) 0) (not (= (mod ~side1Failed_History_1~0 256) 0)) (<= 0 (+ ~s1p_new~0 1)) (<= (+ 2 ~active_side_History_2~0) 0) (<= (+ ~s2s1_new~0 1) 0) (<= 0 ~manual_selection_History_2~0) (= (mod ~side2Failed_History_1~0 256) 0) (<= ~cs1~0 0) (<= 0 ~s2s2~0) (<= (+ ~nomsg~0 1) 0) (<= |#NULL.base| 0) (<= 0 (+ ~cs1_new~0 1)) (<= (+ 2 ~active_side_History_1~0) 0) (<= (+ ~cs1_new~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= 0 (+ 2 ~active_side_History_2~0)) (<= ~manual_selection_History_2~0 0) (<= 0 (+ ~side1_written~0 1)) (<= 0 ~s1s2~0) (<= ~s1s1~0 0) (<= 0 ~s2s1~0) (<= 0 |#NULL.offset|) (<= 0 (+ ~cs2_new~0 1)) (<= (+ ~side1_written~0 1) 0) (<= 0 |#StackHeapBarrier|) (<= (+ ~s2p_new~0 1) 0) (<= (+ ~s2s2_new~0 1) 0) (<= (+ ~s1s1_new~0 1) 0))' at error location [2022-11-03 03:50:50,051 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:50:50,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:50:50,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-11-03 03:50:50,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288443550] [2022-11-03 03:50:50,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:50:50,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 03:50:50,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:50,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 03:50:50,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=2812, Unknown=0, NotChecked=0, Total=3080 [2022-11-03 03:50:50,055 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-03 03:50:51,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:51,095 INFO L93 Difference]: Finished difference Result 1290 states and 1808 transitions. [2022-11-03 03:50:51,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 03:50:51,096 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-03 03:50:51,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:51,102 INFO L225 Difference]: With dead ends: 1290 [2022-11-03 03:50:51,102 INFO L226 Difference]: Without dead ends: 882 [2022-11-03 03:50:51,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 154 SyntacticMatches, 10 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 40.2s TimeCoverageRelationStatistics Valid=292, Invalid=3368, Unknown=0, NotChecked=0, Total=3660 [2022-11-03 03:50:51,106 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 305 mSDsluCounter, 2365 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:51,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 2592 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:50:51,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2022-11-03 03:50:51,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 558. [2022-11-03 03:50:51,329 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-03 03:50:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 739 transitions. [2022-11-03 03:50:51,336 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 739 transitions. Word has length 70 [2022-11-03 03:50:51,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:51,337 INFO L495 AbstractCegarLoop]: Abstraction has 558 states and 739 transitions. [2022-11-03 03:50:51,337 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-03 03:50:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 739 transitions. [2022-11-03 03:50:51,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-03 03:50:51,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:51,342 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-03 03:50:51,393 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 03:50:51,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:51,564 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:50:51,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:51,565 INFO L85 PathProgramCache]: Analyzing trace with hash -992035311, now seen corresponding path program 1 times [2022-11-03 03:50:51,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:51,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663381935] [2022-11-03 03:50:51,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:51,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:51,964 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-03 03:50:51,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:51,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663381935] [2022-11-03 03:50:51,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663381935] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:50:51,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:50:51,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 03:50:51,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729050666] [2022-11-03 03:50:51,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:50:51,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 03:50:51,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:51,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 03:50:51,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:50:51,968 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-03 03:50:53,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:53,202 INFO L93 Difference]: Finished difference Result 1229 states and 1709 transitions. [2022-11-03 03:50:53,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:50:53,203 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-03 03:50:53,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:53,209 INFO L225 Difference]: With dead ends: 1229 [2022-11-03 03:50:53,209 INFO L226 Difference]: Without dead ends: 918 [2022-11-03 03:50:53,211 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-03 03:50:53,211 INFO L413 NwaCegarLoop]: 407 mSDtfsCounter, 679 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:53,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1861 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 03:50:53,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2022-11-03 03:50:53,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 692. [2022-11-03 03:50:53,441 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-03 03:50:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 915 transitions. [2022-11-03 03:50:53,446 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 915 transitions. Word has length 71 [2022-11-03 03:50:53,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:53,447 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 915 transitions. [2022-11-03 03:50:53,447 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-03 03:50:53,447 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 915 transitions. [2022-11-03 03:50:53,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-03 03:50:53,448 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:53,449 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-03 03:50:53,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 03:50:53,449 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:50:53,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:53,450 INFO L85 PathProgramCache]: Analyzing trace with hash 2033385991, now seen corresponding path program 1 times [2022-11-03 03:50:53,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:53,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308972685] [2022-11-03 03:50:53,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:53,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:53,842 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-03 03:50:53,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:53,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308972685] [2022-11-03 03:50:53,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308972685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:50:53,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:50:53,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 03:50:53,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890253749] [2022-11-03 03:50:53,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:50:53,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 03:50:53,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:53,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 03:50:53,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:50:53,846 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-03 03:50:55,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:55,250 INFO L93 Difference]: Finished difference Result 1582 states and 2191 transitions. [2022-11-03 03:50:55,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:50:55,251 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-03 03:50:55,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:55,259 INFO L225 Difference]: With dead ends: 1582 [2022-11-03 03:50:55,260 INFO L226 Difference]: Without dead ends: 1241 [2022-11-03 03:50:55,262 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-03 03:50:55,262 INFO L413 NwaCegarLoop]: 505 mSDtfsCounter, 730 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 2026 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:55,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 2026 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-03 03:50:55,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2022-11-03 03:50:55,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 950. [2022-11-03 03:50:55,654 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-03 03:50:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1258 transitions. [2022-11-03 03:50:55,660 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1258 transitions. Word has length 73 [2022-11-03 03:50:55,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:55,661 INFO L495 AbstractCegarLoop]: Abstraction has 950 states and 1258 transitions. [2022-11-03 03:50:55,661 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-03 03:50:55,662 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1258 transitions. [2022-11-03 03:50:55,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-03 03:50:55,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:55,663 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-03 03:50:55,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-03 03:50:55,664 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:50:55,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:55,664 INFO L85 PathProgramCache]: Analyzing trace with hash 972839730, now seen corresponding path program 1 times [2022-11-03 03:50:55,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:55,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119708743] [2022-11-03 03:50:55,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:55,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:50:55,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 03:50:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:50:55,836 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 03:50:55,836 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 03:50:55,838 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 03:50:55,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-03 03:50:55,845 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-03 03:50:55,852 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 03:50:56,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 03:50:56 BoogieIcfgContainer [2022-11-03 03:50:56,045 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 03:50:56,046 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 03:50:56,046 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 03:50:56,046 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 03:50:56,047 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:47:29" (3/4) ... [2022-11-03 03:50:56,049 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-03 03:50:56,242 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 03:50:56,243 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 03:50:56,244 INFO L158 Benchmark]: Toolchain (without parser) took 209197.00ms. Allocated memory was 98.6MB in the beginning and 545.3MB in the end (delta: 446.7MB). Free memory was 60.2MB in the beginning and 425.7MB in the end (delta: -365.5MB). Peak memory consumption was 83.1MB. Max. memory is 16.1GB. [2022-11-03 03:50:56,244 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 98.6MB. Free memory is still 77.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:50:56,246 INFO L158 Benchmark]: CACSL2BoogieTranslator took 617.34ms. Allocated memory is still 98.6MB. Free memory was 60.0MB in the beginning and 66.2MB in the end (delta: -6.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 03:50:56,246 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.61ms. Allocated memory is still 98.6MB. Free memory was 66.2MB in the beginning and 62.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 03:50:56,247 INFO L158 Benchmark]: Boogie Preprocessor took 41.59ms. Allocated memory is still 98.6MB. Free memory was 62.9MB in the beginning and 60.1MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 03:50:56,247 INFO L158 Benchmark]: RCFGBuilder took 1310.91ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 59.9MB in the beginning and 41.1MB in the end (delta: 18.8MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. [2022-11-03 03:50:56,248 INFO L158 Benchmark]: TraceAbstraction took 206939.71ms. Allocated memory was 119.5MB in the beginning and 545.3MB in the end (delta: 425.7MB). Free memory was 91.2MB in the beginning and 440.6MB in the end (delta: -349.3MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. [2022-11-03 03:50:56,248 INFO L158 Benchmark]: Witness Printer took 196.98ms. Allocated memory is still 545.3MB. Free memory was 440.6MB in the beginning and 425.7MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-03 03:50:56,254 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.33ms. Allocated memory is still 98.6MB. Free memory is still 77.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 617.34ms. Allocated memory is still 98.6MB. Free memory was 60.0MB in the beginning and 66.2MB in the end (delta: -6.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.61ms. Allocated memory is still 98.6MB. Free memory was 66.2MB in the beginning and 62.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.59ms. Allocated memory is still 98.6MB. Free memory was 62.9MB in the beginning and 60.1MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1310.91ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 59.9MB in the beginning and 41.1MB in the end (delta: 18.8MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. * TraceAbstraction took 206939.71ms. Allocated memory was 119.5MB in the beginning and 545.3MB in the end (delta: 425.7MB). Free memory was 91.2MB in the beginning and 440.6MB in the end (delta: -349.3MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. * Witness Printer took 196.98ms. Allocated memory is still 545.3MB. Free memory was 440.6MB in the beginning and 425.7MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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 [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) [L564] RET assume_abort_if_not(i2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L582] COND TRUE 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] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_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] EXPR next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] EXPR next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] EXPR next_state != nomsg && s1p_new == nomsg ? next_state : s1p_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] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=-2, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L408] COND TRUE (int )side1 == (int )nomsg [L409] COND FALSE !((int )side2 == 0) [L412] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; [L447] COND TRUE ! side1Failed [L448] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND TRUE ! tmp___0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L458] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=-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] [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 [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L460] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND TRUE ! tmp___2 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L462] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L462] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L462] tmp___3 = read_side2_failed_history((unsigned char)1) [L463] COND TRUE ! tmp___3 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L464] CALL, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L464] RET, EXPR read_side2_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L464] tmp___4 = read_side2_failed_history((unsigned char)0) [L465] COND TRUE ! tmp___4 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L466] COND FALSE !(! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L471] COND FALSE !(! (! ((int )side1_written == 0))) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L476] COND TRUE ! (! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L477] COND TRUE ! ((int )side2_written == 0) [L478] return (0); VAL [\result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L616] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L618] reach_error() VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 149 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 206.6s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 38.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3617 SdHoareTripleChecker+Valid, 22.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3547 mSDsluCounter, 23726 SdHoareTripleChecker+Invalid, 20.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 439 IncrementalHoareTripleChecker+Unchecked, 19973 mSDsCounter, 654 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8468 IncrementalHoareTripleChecker+Invalid, 9561 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 654 mSolverCounterUnsat, 4271 mSDtfsCounter, 8468 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 989 GetRequests, 720 SyntacticMatches, 22 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2219 ImplicationChecksByTransitivity, 123.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=950occurred in iteration=16, InterpolantAutomatonStates: 160, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 1124 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 1230 NumberOfCodeBlocks, 1230 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1388 ConstructedInterpolants, 0 QuantifiedInterpolants, 4767 SizeOfPredicates, 68 NumberOfNonLiveVariables, 2018 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: 42.2s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 12, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 104, DAG_INTERPRETER_EARLY_EXITS: 3, TOOLS_POST_APPLICATIONS: 101, TOOLS_POST_TIME: 18.1s, TOOLS_POST_CALL_APPLICATIONS: 36, TOOLS_POST_CALL_TIME: 11.6s, TOOLS_POST_RETURN_APPLICATIONS: 24, TOOLS_POST_RETURN_TIME: 9.5s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 161, TOOLS_QUANTIFIERELIM_TIME: 39.1s, TOOLS_QUANTIFIERELIM_MAX_TIME: 4.8s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 265, FLUID_YES_ANSWERS: 6, DOMAIN_JOIN_APPLICATIONS: 33, DOMAIN_JOIN_TIME: 2.0s, DOMAIN_ALPHA_APPLICATIONS: 6, DOMAIN_ALPHA_TIME: 0.2s, 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.6s, 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-03 03:50:56,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c415cffe-455a-4713-a7b0-e40635d517e3/bin/utaipan-7li7fVZpFI/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