./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7 --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 a30aa210ed4a7c8ee647a70aef136aef282e5eccb07388ecda6495e33bc30b6d --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 20:37:41,965 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 20:37:41,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 20:37:42,023 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 20:37:42,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 20:37:42,029 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 20:37:42,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 20:37:42,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 20:37:42,035 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 20:37:42,036 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 20:37:42,037 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 20:37:42,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 20:37:42,043 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 20:37:42,051 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 20:37:42,053 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 20:37:42,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 20:37:42,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 20:37:42,063 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 20:37:42,065 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 20:37:42,070 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 20:37:42,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 20:37:42,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 20:37:42,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 20:37:42,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 20:37:42,084 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 20:37:42,087 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 20:37:42,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 20:37:42,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 20:37:42,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 20:37:42,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 20:37:42,094 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 20:37:42,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 20:37:42,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 20:37:42,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 20:37:42,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 20:37:42,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 20:37:42,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 20:37:42,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 20:37:42,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 20:37:42,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 20:37:42,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 20:37:42,104 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 20:37:42,152 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 20:37:42,153 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 20:37:42,153 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 20:37:42,154 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 20:37:42,155 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 20:37:42,155 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 20:37:42,155 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 20:37:42,155 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 20:37:42,156 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 20:37:42,156 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 20:37:42,157 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 20:37:42,157 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 20:37:42,157 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 20:37:42,158 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 20:37:42,158 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 20:37:42,158 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 20:37:42,158 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 20:37:42,159 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 20:37:42,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 20:37:42,160 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 20:37:42,160 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 20:37:42,160 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 20:37:42,160 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 20:37:42,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 20:37:42,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 20:37:42,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 20:37:42,163 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 20:37:42,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 20:37:42,163 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 20:37:42,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 20:37:42,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 20:37:42,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 20:37:42,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 20:37:42,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 20:37:42,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 20:37:42,165 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 20:37:42,165 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 20:37:42,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 20:37:42,166 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 20:37:42,166 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 20:37:42,166 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 20:37:42,166 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/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_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7 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 -> a30aa210ed4a7c8ee647a70aef136aef282e5eccb07388ecda6495e33bc30b6d [2021-11-25 20:37:42,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 20:37:42,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 20:37:42,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 20:37:42,497 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 20:37:42,498 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 20:37:42,500 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2021-11-25 20:37:42,561 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/data/32cb38779/741cab7a6982420a9a285b2371213a60/FLAG7b7ab0712 [2021-11-25 20:37:43,092 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 20:37:43,093 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2021-11-25 20:37:43,109 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/data/32cb38779/741cab7a6982420a9a285b2371213a60/FLAG7b7ab0712 [2021-11-25 20:37:43,397 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/data/32cb38779/741cab7a6982420a9a285b2371213a60 [2021-11-25 20:37:43,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 20:37:43,401 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 20:37:43,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 20:37:43,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 20:37:43,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 20:37:43,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:37:43" (1/1) ... [2021-11-25 20:37:43,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f166566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:37:43, skipping insertion in model container [2021-11-25 20:37:43,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:37:43" (1/1) ... [2021-11-25 20:37:43,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 20:37:43,455 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 20:37:43,706 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_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c[14540,14553] [2021-11-25 20:37:43,709 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:37:43,726 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 20:37:43,783 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_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c[14540,14553] [2021-11-25 20:37:43,784 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:37:43,800 INFO L208 MainTranslator]: Completed translation [2021-11-25 20:37:43,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:37:43 WrapperNode [2021-11-25 20:37:43,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 20:37:43,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 20:37:43,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 20:37:43,802 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 20:37:43,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:37:43" (1/1) ... [2021-11-25 20:37:43,821 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:37:43" (1/1) ... [2021-11-25 20:37:43,864 INFO L137 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 533 [2021-11-25 20:37:43,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 20:37:43,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 20:37:43,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 20:37:43,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 20:37:43,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:37:43" (1/1) ... [2021-11-25 20:37:43,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:37:43" (1/1) ... [2021-11-25 20:37:43,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:37:43" (1/1) ... [2021-11-25 20:37:43,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:37:43" (1/1) ... [2021-11-25 20:37:43,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:37:43" (1/1) ... [2021-11-25 20:37:43,910 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:37:43" (1/1) ... [2021-11-25 20:37:43,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:37:43" (1/1) ... [2021-11-25 20:37:43,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 20:37:43,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 20:37:43,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 20:37:43,919 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 20:37:43,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:37:43" (1/1) ... [2021-11-25 20:37:43,946 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 20:37:43,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:37:43,975 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 20:37:44,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 20:37:44,025 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2021-11-25 20:37:44,025 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2021-11-25 20:37:44,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 20:37:44,025 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2021-11-25 20:37:44,025 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2021-11-25 20:37:44,026 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2021-11-25 20:37:44,026 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2021-11-25 20:37:44,026 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2021-11-25 20:37:44,026 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2021-11-25 20:37:44,026 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-25 20:37:44,026 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-25 20:37:44,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 20:37:44,027 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2021-11-25 20:37:44,027 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2021-11-25 20:37:44,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 20:37:44,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 20:37:44,027 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2021-11-25 20:37:44,028 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2021-11-25 20:37:44,139 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 20:37:44,141 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 20:37:44,784 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 20:37:45,029 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 20:37:45,029 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-25 20:37:45,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:37:45 BoogieIcfgContainer [2021-11-25 20:37:45,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 20:37:45,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 20:37:45,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 20:37:45,061 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 20:37:45,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:37:43" (1/3) ... [2021-11-25 20:37:45,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fde5801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:37:45, skipping insertion in model container [2021-11-25 20:37:45,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:37:43" (2/3) ... [2021-11-25 20:37:45,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fde5801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:37:45, skipping insertion in model container [2021-11-25 20:37:45,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:37:45" (3/3) ... [2021-11-25 20:37:45,064 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2021-11-25 20:37:45,070 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 20:37:45,070 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-25 20:37:45,161 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 20:37:45,176 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 20:37:45,177 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-25 20:37:45,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 104 states have (on average 1.5288461538461537) internal successors, (159), 105 states have internal predecessors, (159), 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) [2021-11-25 20:37:45,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 20:37:45,219 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:37:45,220 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:37:45,221 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:37:45,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:37:45,227 INFO L85 PathProgramCache]: Analyzing trace with hash -301559937, now seen corresponding path program 1 times [2021-11-25 20:37:45,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:37:45,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65478397] [2021-11-25 20:37:45,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:37:45,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:37:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:37:45,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:37:45,650 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:37:45,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65478397] [2021-11-25 20:37:45,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65478397] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:37:45,652 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:37:45,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:37:45,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63817916] [2021-11-25 20:37:45,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:37:45,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:37:45,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:37:45,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:37:45,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:37:45,701 INFO L87 Difference]: Start difference. First operand has 144 states, 104 states have (on average 1.5288461538461537) internal successors, (159), 105 states have internal predecessors, (159), 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) [2021-11-25 20:37:45,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:37:45,912 INFO L93 Difference]: Finished difference Result 289 states and 469 transitions. [2021-11-25 20:37:45,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:37:45,915 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 [2021-11-25 20:37:45,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:37:45,925 INFO L225 Difference]: With dead ends: 289 [2021-11-25 20:37:45,926 INFO L226 Difference]: Without dead ends: 147 [2021-11-25 20:37:45,931 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:37:45,935 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 5 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 599 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 [2021-11-25 20:37:45,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 599 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:37:45,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-11-25 20:37:46,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-11-25 20:37:46,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 107 states have (on average 1.4953271028037383) internal successors, (160), 107 states have internal predecessors, (160), 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) [2021-11-25 20:37:46,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 222 transitions. [2021-11-25 20:37:46,075 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 222 transitions. Word has length 19 [2021-11-25 20:37:46,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:37:46,076 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 222 transitions. [2021-11-25 20:37:46,077 INFO L471 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) [2021-11-25 20:37:46,077 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 222 transitions. [2021-11-25 20:37:46,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-25 20:37:46,080 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:37:46,081 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:37:46,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 20:37:46,082 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:37:46,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:37:46,087 INFO L85 PathProgramCache]: Analyzing trace with hash 292308684, now seen corresponding path program 1 times [2021-11-25 20:37:46,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:37:46,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435882858] [2021-11-25 20:37:46,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:37:46,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:37:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:37:46,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 20:37:46,311 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:37:46,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435882858] [2021-11-25 20:37:46,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435882858] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:37:46,312 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:37:46,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:37:46,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104486679] [2021-11-25 20:37:46,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:37:46,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:37:46,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:37:46,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:37:46,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:37:46,316 INFO L87 Difference]: Start difference. First operand 147 states and 222 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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) [2021-11-25 20:37:46,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:37:46,397 INFO L93 Difference]: Finished difference Result 296 states and 447 transitions. [2021-11-25 20:37:46,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:37:46,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 28 [2021-11-25 20:37:46,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:37:46,401 INFO L225 Difference]: With dead ends: 296 [2021-11-25 20:37:46,401 INFO L226 Difference]: Without dead ends: 152 [2021-11-25 20:37:46,403 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:37:46,404 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 6 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:37:46,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 611 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:37:46,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-11-25 20:37:46,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2021-11-25 20:37:46,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 111 states have (on average 1.4774774774774775) internal successors, (164), 111 states have internal predecessors, (164), 31 states have call successors, (31), 9 states have call predecessors, (31), 9 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2021-11-25 20:37:46,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 226 transitions. [2021-11-25 20:37:46,427 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 226 transitions. Word has length 28 [2021-11-25 20:37:46,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:37:46,428 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 226 transitions. [2021-11-25 20:37:46,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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) [2021-11-25 20:37:46,428 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 226 transitions. [2021-11-25 20:37:46,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 20:37:46,430 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:37:46,431 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:37:46,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 20:37:46,431 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:37:46,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:37:46,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1382943625, now seen corresponding path program 1 times [2021-11-25 20:37:46,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:37:46,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855661475] [2021-11-25 20:37:46,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:37:46,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:37:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:37:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 20:37:46,604 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:37:46,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855661475] [2021-11-25 20:37:46,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855661475] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:37:46,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:37:46,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:37:46,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362964357] [2021-11-25 20:37:46,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:37:46,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:37:46,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:37:46,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:37:46,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:37:46,608 INFO L87 Difference]: Start difference. First operand 152 states and 226 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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) [2021-11-25 20:37:46,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:37:46,720 INFO L93 Difference]: Finished difference Result 306 states and 458 transitions. [2021-11-25 20:37:46,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:37:46,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 36 [2021-11-25 20:37:46,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:37:46,727 INFO L225 Difference]: With dead ends: 306 [2021-11-25 20:37:46,727 INFO L226 Difference]: Without dead ends: 157 [2021-11-25 20:37:46,728 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:37:46,736 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 6 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:37:46,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 597 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:37:46,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-11-25 20:37:46,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-11-25 20:37:46,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 115 states have (on average 1.4608695652173913) internal successors, (168), 115 states have internal predecessors, (168), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2021-11-25 20:37:46,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 230 transitions. [2021-11-25 20:37:46,766 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 230 transitions. Word has length 36 [2021-11-25 20:37:46,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:37:46,767 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 230 transitions. [2021-11-25 20:37:46,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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) [2021-11-25 20:37:46,768 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 230 transitions. [2021-11-25 20:37:46,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-25 20:37:46,779 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:37:46,779 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:37:46,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-25 20:37:46,779 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:37:46,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:37:46,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1786441123, now seen corresponding path program 1 times [2021-11-25 20:37:46,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:37:46,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445969461] [2021-11-25 20:37:46,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:37:46,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:37:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:37:46,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 20:37:46,893 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:37:46,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445969461] [2021-11-25 20:37:46,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445969461] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:37:46,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:37:46,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:37:46,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461627577] [2021-11-25 20:37:46,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:37:46,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:37:46,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:37:46,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:37:46,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:37:46,896 INFO L87 Difference]: Start difference. First operand 157 states and 230 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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) [2021-11-25 20:37:46,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:37:46,981 INFO L93 Difference]: Finished difference Result 316 states and 466 transitions. [2021-11-25 20:37:46,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:37:46,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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 44 [2021-11-25 20:37:46,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:37:46,986 INFO L225 Difference]: With dead ends: 316 [2021-11-25 20:37:46,986 INFO L226 Difference]: Without dead ends: 162 [2021-11-25 20:37:46,987 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:37:46,997 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 6 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:37:46,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 597 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:37:47,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-11-25 20:37:47,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2021-11-25 20:37:47,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 119 states have (on average 1.4453781512605042) internal successors, (172), 119 states have internal predecessors, (172), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2021-11-25 20:37:47,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2021-11-25 20:37:47,027 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 44 [2021-11-25 20:37:47,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:37:47,028 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2021-11-25 20:37:47,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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) [2021-11-25 20:37:47,028 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2021-11-25 20:37:47,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-25 20:37:47,030 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:37:47,030 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:37:47,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 20:37:47,031 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:37:47,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:37:47,032 INFO L85 PathProgramCache]: Analyzing trace with hash -610018180, now seen corresponding path program 1 times [2021-11-25 20:37:47,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:37:47,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974032658] [2021-11-25 20:37:47,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:37:47,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:37:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:37:47,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 20:37:47,143 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:37:47,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974032658] [2021-11-25 20:37:47,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974032658] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:37:47,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:37:47,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:37:47,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808901532] [2021-11-25 20:37:47,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:37:47,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:37:47,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:37:47,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:37:47,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:37:47,148 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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) [2021-11-25 20:37:47,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:37:47,238 INFO L93 Difference]: Finished difference Result 325 states and 470 transitions. [2021-11-25 20:37:47,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:37:47,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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 44 [2021-11-25 20:37:47,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:37:47,244 INFO L225 Difference]: With dead ends: 325 [2021-11-25 20:37:47,250 INFO L226 Difference]: Without dead ends: 166 [2021-11-25 20:37:47,251 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:37:47,251 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 5 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:37:47,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 606 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:37:47,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-11-25 20:37:47,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2021-11-25 20:37:47,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 122 states have (on average 1.4344262295081966) internal successors, (175), 122 states have internal predecessors, (175), 31 states have call successors, (31), 12 states have call predecessors, (31), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2021-11-25 20:37:47,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 237 transitions. [2021-11-25 20:37:47,292 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 237 transitions. Word has length 44 [2021-11-25 20:37:47,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:37:47,293 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 237 transitions. [2021-11-25 20:37:47,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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) [2021-11-25 20:37:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 237 transitions. [2021-11-25 20:37:47,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-25 20:37:47,297 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:37:47,297 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:37:47,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-25 20:37:47,298 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:37:47,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:37:47,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1818633053, now seen corresponding path program 1 times [2021-11-25 20:37:47,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:37:47,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580390098] [2021-11-25 20:37:47,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:37:47,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:37:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:37:47,434 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-25 20:37:47,435 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:37:47,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580390098] [2021-11-25 20:37:47,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580390098] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:37:47,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:37:47,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:37:47,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347122623] [2021-11-25 20:37:47,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:37:47,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:37:47,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:37:47,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:37:47,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:37:47,438 INFO L87 Difference]: Start difference. First operand 166 states and 237 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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) [2021-11-25 20:37:47,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:37:47,507 INFO L93 Difference]: Finished difference Result 335 states and 479 transitions. [2021-11-25 20:37:47,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:37:47,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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 52 [2021-11-25 20:37:47,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:37:47,511 INFO L225 Difference]: With dead ends: 335 [2021-11-25 20:37:47,512 INFO L226 Difference]: Without dead ends: 172 [2021-11-25 20:37:47,512 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:37:47,514 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 7 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:37:47,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 608 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 20:37:47,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-11-25 20:37:47,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2021-11-25 20:37:47,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 127 states have (on average 1.4173228346456692) internal successors, (180), 127 states have internal predecessors, (180), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2021-11-25 20:37:47,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 242 transitions. [2021-11-25 20:37:47,531 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 242 transitions. Word has length 52 [2021-11-25 20:37:47,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:37:47,531 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 242 transitions. [2021-11-25 20:37:47,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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) [2021-11-25 20:37:47,532 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 242 transitions. [2021-11-25 20:37:47,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-25 20:37:47,536 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:37:47,536 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:37:47,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-25 20:37:47,537 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:37:47,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:37:47,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1171138832, now seen corresponding path program 1 times [2021-11-25 20:37:47,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:37:47,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958036686] [2021-11-25 20:37:47,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:37:47,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:37:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:37:47,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 20:37:47,820 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:37:47,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958036686] [2021-11-25 20:37:47,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958036686] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:37:47,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570587966] [2021-11-25 20:37:47,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:37:47,820 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:37:47,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:37:47,822 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:37:47,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 20:37:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:37:47,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 20:37:47,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:37:48,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:37:48,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 20:37:48,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570587966] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:37:48,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 20:37:48,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2021-11-25 20:37:48,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890347972] [2021-11-25 20:37:48,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:37:48,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 20:37:48,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:37:48,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 20:37:48,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-25 20:37:48,306 INFO L87 Difference]: Start difference. First operand 172 states and 242 transitions. Second operand has 8 states, 6 states have (on average 6.666666666666667) internal successors, (40), 8 states have internal predecessors, (40), 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) [2021-11-25 20:37:48,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:37:48,662 INFO L93 Difference]: Finished difference Result 510 states and 710 transitions. [2021-11-25 20:37:48,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 20:37:48,663 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 6.666666666666667) internal successors, (40), 8 states have internal predecessors, (40), 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 55 [2021-11-25 20:37:48,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:37:48,666 INFO L225 Difference]: With dead ends: 510 [2021-11-25 20:37:48,666 INFO L226 Difference]: Without dead ends: 331 [2021-11-25 20:37:48,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-11-25 20:37:48,668 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 201 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:37:48,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 1256 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 20:37:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-11-25 20:37:48,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2021-11-25 20:37:48,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 240 states have (on average 1.4083333333333334) internal successors, (338), 241 states have internal predecessors, (338), 60 states have call successors, (60), 26 states have call predecessors, (60), 26 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2021-11-25 20:37:48,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 458 transitions. [2021-11-25 20:37:48,687 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 458 transitions. Word has length 55 [2021-11-25 20:37:48,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:37:48,688 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 458 transitions. [2021-11-25 20:37:48,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 6.666666666666667) internal successors, (40), 8 states have internal predecessors, (40), 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) [2021-11-25 20:37:48,688 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 458 transitions. [2021-11-25 20:37:48,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-25 20:37:48,690 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:37:48,690 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:37:48,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-25 20:37:48,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:37:48,909 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:37:48,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:37:48,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1285468697, now seen corresponding path program 1 times [2021-11-25 20:37:48,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:37:48,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540319768] [2021-11-25 20:37:48,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:37:48,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:37:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:37:49,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 20:37:49,140 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:37:49,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540319768] [2021-11-25 20:37:49,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540319768] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:37:49,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101590908] [2021-11-25 20:37:49,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:37:49,141 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:37:49,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:37:49,157 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:37:49,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 20:37:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:37:49,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-25 20:37:49,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:37:49,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:37:49,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:37:50,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 20:37:50,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101590908] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:37:50,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1541605643] [2021-11-25 20:37:50,035 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2021-11-25 20:37:50,035 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 20:37:50,040 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 20:37:50,046 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 20:37:50,046 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 20:38:04,655 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 174 for LOIs [2021-11-25 20:38:06,189 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 12 for LOIs [2021-11-25 20:38:06,201 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 21 for LOIs [2021-11-25 20:38:06,209 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 30 for LOIs [2021-11-25 20:38:06,218 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 26 for LOIs [2021-11-25 20:38:06,228 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 15 for LOIs [2021-11-25 20:38:06,249 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 20:38:16,655 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5550#(and (= |assert_#in~arg| 0) (<= ~manual_selection_History_1~0 127) (<= ~active_side_History_1~0 127) (<= 0 ~active_side_History_0~0) (= assert_~arg |assert_#in~arg|) (not (= (mod ~side1Failed_History_1~0 256) 0)) (= (mod ~side2Failed_History_1~0 256) 0) (<= ~active_side_History_0~0 2) (not (= 2 ~active_side_History_0~0)) (not (= ~manual_selection_History_1~0 0)) (<= 0 (+ ~manual_selection_History_1~0 128)) (<= 0 (+ ~active_side_History_1~0 128)))' at error location [2021-11-25 20:38:16,655 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 20:38:16,655 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:38:16,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2021-11-25 20:38:16,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401335483] [2021-11-25 20:38:16,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:38:16,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 20:38:16,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:38:16,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 20:38:16,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=2625, Unknown=0, NotChecked=0, Total=2862 [2021-11-25 20:38:16,660 INFO L87 Difference]: Start difference. First operand 327 states and 458 transitions. Second operand has 13 states, 9 states have (on average 6.888888888888889) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 3 states have call predecessors, (15), 8 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2021-11-25 20:38:17,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:38:17,288 INFO L93 Difference]: Finished difference Result 1092 states and 1546 transitions. [2021-11-25 20:38:17,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-25 20:38:17,288 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 6.888888888888889) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 3 states have call predecessors, (15), 8 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 57 [2021-11-25 20:38:17,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:38:17,296 INFO L225 Difference]: With dead ends: 1092 [2021-11-25 20:38:17,296 INFO L226 Difference]: Without dead ends: 768 [2021-11-25 20:38:17,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 120 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=263, Invalid=3159, Unknown=0, NotChecked=0, Total=3422 [2021-11-25 20:38:17,300 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 262 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 2259 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:38:17,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 2259 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 20:38:17,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2021-11-25 20:38:17,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 494. [2021-11-25 20:38:17,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 365 states have (on average 1.4164383561643836) internal successors, (517), 368 states have internal predecessors, (517), 88 states have call successors, (88), 40 states have call predecessors, (88), 40 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2021-11-25 20:38:17,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 693 transitions. [2021-11-25 20:38:17,336 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 693 transitions. Word has length 57 [2021-11-25 20:38:17,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:38:17,337 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 693 transitions. [2021-11-25 20:38:17,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 6.888888888888889) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 3 states have call predecessors, (15), 8 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2021-11-25 20:38:17,337 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 693 transitions. [2021-11-25 20:38:17,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-25 20:38:17,338 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:38:17,338 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-25 20:38:17,374 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-25 20:38:17,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-11-25 20:38:17,557 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:38:17,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:38:17,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1982126259, now seen corresponding path program 1 times [2021-11-25 20:38:17,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:38:17,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052415501] [2021-11-25 20:38:17,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:17,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:38:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:17,678 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-25 20:38:17,678 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:38:17,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052415501] [2021-11-25 20:38:17,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052415501] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:38:17,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:38:17,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-25 20:38:17,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200647634] [2021-11-25 20:38:17,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:38:17,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 20:38:17,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:38:17,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 20:38:17,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:38:17,682 INFO L87 Difference]: Start difference. First operand 494 states and 693 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-25 20:38:17,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:38:17,841 INFO L93 Difference]: Finished difference Result 698 states and 1020 transitions. [2021-11-25 20:38:17,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 20:38:17,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2021-11-25 20:38:17,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:38:17,847 INFO L225 Difference]: With dead ends: 698 [2021-11-25 20:38:17,848 INFO L226 Difference]: Without dead ends: 696 [2021-11-25 20:38:17,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-25 20:38:17,849 INFO L933 BasicCegarLoop]: 366 mSDtfsCounter, 153 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:38:17,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 1634 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:38:17,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2021-11-25 20:38:17,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 498. [2021-11-25 20:38:17,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 367 states have (on average 1.4141689373297002) internal successors, (519), 371 states have internal predecessors, (519), 89 states have call successors, (89), 41 states have call predecessors, (89), 41 states have return successors, (89), 85 states have call predecessors, (89), 89 states have call successors, (89) [2021-11-25 20:38:17,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 697 transitions. [2021-11-25 20:38:17,881 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 697 transitions. Word has length 60 [2021-11-25 20:38:17,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:38:17,882 INFO L470 AbstractCegarLoop]: Abstraction has 498 states and 697 transitions. [2021-11-25 20:38:17,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-25 20:38:17,882 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 697 transitions. [2021-11-25 20:38:17,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-25 20:38:17,883 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:38:17,884 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:38:17,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-25 20:38:17,884 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:38:17,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:38:17,885 INFO L85 PathProgramCache]: Analyzing trace with hash -800403589, now seen corresponding path program 1 times [2021-11-25 20:38:17,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:38:17,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009889] [2021-11-25 20:38:17,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:17,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:38:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:17,943 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 20:38:17,943 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:38:17,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009889] [2021-11-25 20:38:17,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009889] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:38:17,943 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:38:17,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:38:17,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224045884] [2021-11-25 20:38:17,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:38:17,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:38:17,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:38:17,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:38:17,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:38:17,945 INFO L87 Difference]: Start difference. First operand 498 states and 697 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-25 20:38:18,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:38:18,021 INFO L93 Difference]: Finished difference Result 946 states and 1318 transitions. [2021-11-25 20:38:18,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:38:18,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2021-11-25 20:38:18,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:38:18,026 INFO L225 Difference]: With dead ends: 946 [2021-11-25 20:38:18,026 INFO L226 Difference]: Without dead ends: 510 [2021-11-25 20:38:18,028 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:38:18,028 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 5 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:38:18,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 606 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 20:38:18,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2021-11-25 20:38:18,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2021-11-25 20:38:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 376 states have (on average 1.4042553191489362) internal successors, (528), 380 states have internal predecessors, (528), 89 states have call successors, (89), 44 states have call predecessors, (89), 44 states have return successors, (89), 85 states have call predecessors, (89), 89 states have call successors, (89) [2021-11-25 20:38:18,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 706 transitions. [2021-11-25 20:38:18,055 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 706 transitions. Word has length 61 [2021-11-25 20:38:18,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:38:18,056 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 706 transitions. [2021-11-25 20:38:18,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-25 20:38:18,056 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 706 transitions. [2021-11-25 20:38:18,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-25 20:38:18,057 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:38:18,058 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:38:18,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-25 20:38:18,058 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:38:18,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:38:18,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1894630519, now seen corresponding path program 1 times [2021-11-25 20:38:18,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:38:18,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158940612] [2021-11-25 20:38:18,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:18,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:38:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:18,127 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-25 20:38:18,127 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:38:18,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158940612] [2021-11-25 20:38:18,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158940612] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:38:18,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:38:18,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:38:18,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338075208] [2021-11-25 20:38:18,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:38:18,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:38:18,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:38:18,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:38:18,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:38:18,130 INFO L87 Difference]: Start difference. First operand 510 states and 706 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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) [2021-11-25 20:38:18,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:38:18,196 INFO L93 Difference]: Finished difference Result 906 states and 1247 transitions. [2021-11-25 20:38:18,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:38:18,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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 63 [2021-11-25 20:38:18,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:38:18,201 INFO L225 Difference]: With dead ends: 906 [2021-11-25 20:38:18,201 INFO L226 Difference]: Without dead ends: 504 [2021-11-25 20:38:18,203 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:38:18,204 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 7 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:38:18,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 598 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 20:38:18,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2021-11-25 20:38:18,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2021-11-25 20:38:18,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 373 states have (on average 1.383378016085791) internal successors, (516), 377 states have internal predecessors, (516), 86 states have call successors, (86), 44 states have call predecessors, (86), 44 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2021-11-25 20:38:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 688 transitions. [2021-11-25 20:38:18,228 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 688 transitions. Word has length 63 [2021-11-25 20:38:18,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:38:18,229 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 688 transitions. [2021-11-25 20:38:18,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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) [2021-11-25 20:38:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 688 transitions. [2021-11-25 20:38:18,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-25 20:38:18,230 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:38:18,230 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:38:18,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-25 20:38:18,231 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:38:18,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:38:18,231 INFO L85 PathProgramCache]: Analyzing trace with hash 119524607, now seen corresponding path program 1 times [2021-11-25 20:38:18,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:38:18,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361408657] [2021-11-25 20:38:18,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:18,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:38:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:18,552 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-25 20:38:18,553 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:38:18,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361408657] [2021-11-25 20:38:18,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361408657] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:38:18,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453561205] [2021-11-25 20:38:18,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:18,553 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:38:18,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:38:18,555 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:38:18,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 20:38:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:18,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-25 20:38:18,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:38:19,084 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 20:38:19,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:38:19,359 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-25 20:38:19,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453561205] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:38:19,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1325565102] [2021-11-25 20:38:19,362 INFO L159 IcfgInterpreter]: Started Sifa with 55 locations of interest [2021-11-25 20:38:19,363 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 20:38:19,363 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 20:38:19,363 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 20:38:19,363 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 20:38:31,979 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 174 for LOIs [2021-11-25 20:38:33,480 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 12 for LOIs [2021-11-25 20:38:33,486 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 30 for LOIs [2021-11-25 20:38:33,500 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 31 for LOIs [2021-11-25 20:38:33,515 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 25 for LOIs [2021-11-25 20:38:33,529 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 15 for LOIs [2021-11-25 20:38:33,537 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 20:38:44,916 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13470#(and (= |assert_#in~arg| 0) (<= ~manual_selection_History_1~0 127) (<= ~active_side_History_1~0 127) (not (= ~active_side_History_0~0 1)) (<= 0 ~active_side_History_0~0) (= assert_~arg |assert_#in~arg|) (<= ~active_side_History_0~0 2) (not (= (mod ~side2Failed_History_1~0 256) 0)) (not (= ~manual_selection_History_1~0 0)) (<= 0 (+ ~manual_selection_History_1~0 128)) (<= 0 (+ ~active_side_History_1~0 128)) (= (mod ~side1Failed_History_1~0 256) 0))' at error location [2021-11-25 20:38:44,916 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 20:38:44,916 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:38:44,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 20 [2021-11-25 20:38:44,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943343772] [2021-11-25 20:38:44,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:38:44,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 20:38:44,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:38:44,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 20:38:44,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=3621, Unknown=0, NotChecked=0, Total=3906 [2021-11-25 20:38:44,920 INFO L87 Difference]: Start difference. First operand 504 states and 688 transitions. Second operand has 20 states, 15 states have (on average 5.333333333333333) internal successors, (80), 18 states have internal predecessors, (80), 6 states have call successors, (22), 3 states have call predecessors, (22), 9 states have return successors, (22), 7 states have call predecessors, (22), 6 states have call successors, (22) [2021-11-25 20:38:46,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:38:46,137 INFO L93 Difference]: Finished difference Result 1244 states and 1760 transitions. [2021-11-25 20:38:46,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-25 20:38:46,138 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 5.333333333333333) internal successors, (80), 18 states have internal predecessors, (80), 6 states have call successors, (22), 3 states have call predecessors, (22), 9 states have return successors, (22), 7 states have call predecessors, (22), 6 states have call successors, (22) Word has length 65 [2021-11-25 20:38:46,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:38:46,145 INFO L225 Difference]: With dead ends: 1244 [2021-11-25 20:38:46,145 INFO L226 Difference]: Without dead ends: 823 [2021-11-25 20:38:46,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 138 SyntacticMatches, 8 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1454 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=336, Invalid=4494, Unknown=0, NotChecked=0, Total=4830 [2021-11-25 20:38:46,149 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 571 mSDsluCounter, 3912 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 4071 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:38:46,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [606 Valid, 4071 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-25 20:38:46,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2021-11-25 20:38:46,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 509. [2021-11-25 20:38:46,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 377 states have (on average 1.3713527851458887) internal successors, (517), 381 states have internal predecessors, (517), 85 states have call successors, (85), 46 states have call predecessors, (85), 46 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2021-11-25 20:38:46,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 687 transitions. [2021-11-25 20:38:46,191 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 687 transitions. Word has length 65 [2021-11-25 20:38:46,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:38:46,192 INFO L470 AbstractCegarLoop]: Abstraction has 509 states and 687 transitions. [2021-11-25 20:38:46,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 5.333333333333333) internal successors, (80), 18 states have internal predecessors, (80), 6 states have call successors, (22), 3 states have call predecessors, (22), 9 states have return successors, (22), 7 states have call predecessors, (22), 6 states have call successors, (22) [2021-11-25 20:38:46,192 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 687 transitions. [2021-11-25 20:38:46,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-25 20:38:46,194 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:38:46,194 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:38:46,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-25 20:38:46,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-25 20:38:46,409 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:38:46,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:38:46,410 INFO L85 PathProgramCache]: Analyzing trace with hash 509607729, now seen corresponding path program 1 times [2021-11-25 20:38:46,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:38:46,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168468970] [2021-11-25 20:38:46,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:46,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:38:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-25 20:38:46,477 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:38:46,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168468970] [2021-11-25 20:38:46,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168468970] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:38:46,477 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:38:46,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:38:46,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620527474] [2021-11-25 20:38:46,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:38:46,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:38:46,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:38:46,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:38:46,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:38:46,482 INFO L87 Difference]: Start difference. First operand 509 states and 687 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-25 20:38:46,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:38:46,698 INFO L93 Difference]: Finished difference Result 1494 states and 2028 transitions. [2021-11-25 20:38:46,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 20:38:46,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 66 [2021-11-25 20:38:46,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:38:46,707 INFO L225 Difference]: With dead ends: 1494 [2021-11-25 20:38:46,707 INFO L226 Difference]: Without dead ends: 1051 [2021-11-25 20:38:46,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:38:46,710 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 326 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:38:46,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 734 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:38:46,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2021-11-25 20:38:46,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 930. [2021-11-25 20:38:46,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 685 states have (on average 1.3430656934306568) internal successors, (920), 693 states have internal predecessors, (920), 158 states have call successors, (158), 86 states have call predecessors, (158), 86 states have return successors, (158), 150 states have call predecessors, (158), 158 states have call successors, (158) [2021-11-25 20:38:46,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1236 transitions. [2021-11-25 20:38:46,778 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1236 transitions. Word has length 66 [2021-11-25 20:38:46,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:38:46,778 INFO L470 AbstractCegarLoop]: Abstraction has 930 states and 1236 transitions. [2021-11-25 20:38:46,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-25 20:38:46,779 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1236 transitions. [2021-11-25 20:38:46,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-25 20:38:46,780 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:38:46,780 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:38:46,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-25 20:38:46,781 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:38:46,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:38:46,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1467150895, now seen corresponding path program 1 times [2021-11-25 20:38:46,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:38:46,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191561237] [2021-11-25 20:38:46,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:46,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:38:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-25 20:38:46,926 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:38:46,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191561237] [2021-11-25 20:38:46,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191561237] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:38:46,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:38:46,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-25 20:38:46,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786818737] [2021-11-25 20:38:46,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:38:46,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 20:38:46,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:38:46,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 20:38:46,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-25 20:38:46,928 INFO L87 Difference]: Start difference. First operand 930 states and 1236 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 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) [2021-11-25 20:38:47,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:38:47,672 INFO L93 Difference]: Finished difference Result 2239 states and 3048 transitions. [2021-11-25 20:38:47,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 20:38:47,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 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 66 [2021-11-25 20:38:47,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:38:47,683 INFO L225 Difference]: With dead ends: 2239 [2021-11-25 20:38:47,684 INFO L226 Difference]: Without dead ends: 1413 [2021-11-25 20:38:47,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:38:47,687 INFO L933 BasicCegarLoop]: 506 mSDtfsCounter, 528 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 2181 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 20:38:47,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [534 Valid, 2181 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-25 20:38:47,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2021-11-25 20:38:47,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1005. [2021-11-25 20:38:47,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 737 states have (on average 1.327001356852103) internal successors, (978), 746 states have internal predecessors, (978), 169 states have call successors, (169), 98 states have call predecessors, (169), 98 states have return successors, (169), 160 states have call predecessors, (169), 169 states have call successors, (169) [2021-11-25 20:38:47,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1316 transitions. [2021-11-25 20:38:47,757 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1316 transitions. Word has length 66 [2021-11-25 20:38:47,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:38:47,757 INFO L470 AbstractCegarLoop]: Abstraction has 1005 states and 1316 transitions. [2021-11-25 20:38:47,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 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) [2021-11-25 20:38:47,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1316 transitions. [2021-11-25 20:38:47,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-25 20:38:47,760 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:38:47,760 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:38:47,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-25 20:38:47,761 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:38:47,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:38:47,761 INFO L85 PathProgramCache]: Analyzing trace with hash 808727846, now seen corresponding path program 1 times [2021-11-25 20:38:47,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:38:47,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886616762] [2021-11-25 20:38:47,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:47,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:38:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-25 20:38:47,911 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:38:47,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886616762] [2021-11-25 20:38:47,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886616762] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:38:47,911 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:38:47,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-25 20:38:47,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438439018] [2021-11-25 20:38:47,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:38:47,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 20:38:47,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:38:47,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 20:38:47,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-25 20:38:47,913 INFO L87 Difference]: Start difference. First operand 1005 states and 1316 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 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) [2021-11-25 20:38:48,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:38:48,679 INFO L93 Difference]: Finished difference Result 2834 states and 3842 transitions. [2021-11-25 20:38:48,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 20:38:48,679 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 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 68 [2021-11-25 20:38:48,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:38:48,693 INFO L225 Difference]: With dead ends: 2834 [2021-11-25 20:38:48,694 INFO L226 Difference]: Without dead ends: 2065 [2021-11-25 20:38:48,698 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:38:48,699 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 569 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 20:38:48,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [575 Valid, 1787 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-25 20:38:48,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2065 states. [2021-11-25 20:38:48,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2065 to 1399. [2021-11-25 20:38:48,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1399 states, 1016 states have (on average 1.312992125984252) internal successors, (1334), 1028 states have internal predecessors, (1334), 245 states have call successors, (245), 137 states have call predecessors, (245), 137 states have return successors, (245), 233 states have call predecessors, (245), 245 states have call successors, (245) [2021-11-25 20:38:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 1824 transitions. [2021-11-25 20:38:48,808 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 1824 transitions. Word has length 68 [2021-11-25 20:38:48,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:38:48,809 INFO L470 AbstractCegarLoop]: Abstraction has 1399 states and 1824 transitions. [2021-11-25 20:38:48,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 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) [2021-11-25 20:38:48,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1824 transitions. [2021-11-25 20:38:48,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-25 20:38:48,815 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:38:48,815 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:38:48,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-25 20:38:48,815 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:38:48,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:38:48,816 INFO L85 PathProgramCache]: Analyzing trace with hash 359313435, now seen corresponding path program 1 times [2021-11-25 20:38:48,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:38:48,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931436323] [2021-11-25 20:38:48,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:48,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:38:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:48,882 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-25 20:38:48,882 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:38:48,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931436323] [2021-11-25 20:38:48,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931436323] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:38:48,882 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:38:48,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:38:48,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237317055] [2021-11-25 20:38:48,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:38:48,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:38:48,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:38:48,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:38:48,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:38:48,885 INFO L87 Difference]: Start difference. First operand 1399 states and 1824 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-25 20:38:49,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:38:49,154 INFO L93 Difference]: Finished difference Result 3504 states and 4603 transitions. [2021-11-25 20:38:49,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 20:38:49,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 70 [2021-11-25 20:38:49,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:38:49,171 INFO L225 Difference]: With dead ends: 3504 [2021-11-25 20:38:49,171 INFO L226 Difference]: Without dead ends: 2468 [2021-11-25 20:38:49,175 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:38:49,175 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 352 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:38:49,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 916 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:38:49,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2468 states. [2021-11-25 20:38:49,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2468 to 2067. [2021-11-25 20:38:49,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2067 states, 1496 states have (on average 1.3014705882352942) internal successors, (1947), 1513 states have internal predecessors, (1947), 368 states have call successors, (368), 202 states have call predecessors, (368), 202 states have return successors, (368), 351 states have call predecessors, (368), 368 states have call successors, (368) [2021-11-25 20:38:49,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 2683 transitions. [2021-11-25 20:38:49,358 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 2683 transitions. Word has length 70 [2021-11-25 20:38:49,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:38:49,359 INFO L470 AbstractCegarLoop]: Abstraction has 2067 states and 2683 transitions. [2021-11-25 20:38:49,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-25 20:38:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 2683 transitions. [2021-11-25 20:38:49,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-25 20:38:49,362 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:38:49,362 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:38:49,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-25 20:38:49,362 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:38:49,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:38:49,363 INFO L85 PathProgramCache]: Analyzing trace with hash 338117835, now seen corresponding path program 1 times [2021-11-25 20:38:49,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:38:49,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319682452] [2021-11-25 20:38:49,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:49,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:38:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:49,419 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-25 20:38:49,420 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:38:49,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319682452] [2021-11-25 20:38:49,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319682452] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:38:49,421 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:38:49,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:38:49,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137269363] [2021-11-25 20:38:49,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:38:49,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:38:49,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:38:49,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:38:49,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:38:49,422 INFO L87 Difference]: Start difference. First operand 2067 states and 2683 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-25 20:38:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:38:49,715 INFO L93 Difference]: Finished difference Result 4572 states and 5977 transitions. [2021-11-25 20:38:49,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 20:38:49,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 70 [2021-11-25 20:38:49,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:38:49,737 INFO L225 Difference]: With dead ends: 4572 [2021-11-25 20:38:49,737 INFO L226 Difference]: Without dead ends: 3021 [2021-11-25 20:38:49,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:38:49,743 INFO L933 BasicCegarLoop]: 378 mSDtfsCounter, 328 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:38:49,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [328 Valid, 910 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:38:49,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2021-11-25 20:38:49,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 2771. [2021-11-25 20:38:49,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2771 states, 2003 states have (on average 1.2950574138791813) internal successors, (2594), 2026 states have internal predecessors, (2594), 497 states have call successors, (497), 270 states have call predecessors, (497), 270 states have return successors, (497), 474 states have call predecessors, (497), 497 states have call successors, (497) [2021-11-25 20:38:49,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2771 states to 2771 states and 3588 transitions. [2021-11-25 20:38:49,937 INFO L78 Accepts]: Start accepts. Automaton has 2771 states and 3588 transitions. Word has length 70 [2021-11-25 20:38:49,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:38:49,937 INFO L470 AbstractCegarLoop]: Abstraction has 2771 states and 3588 transitions. [2021-11-25 20:38:49,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-25 20:38:49,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2771 states and 3588 transitions. [2021-11-25 20:38:49,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-25 20:38:49,942 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:38:49,942 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-11-25 20:38:49,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-25 20:38:49,942 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:38:49,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:38:49,943 INFO L85 PathProgramCache]: Analyzing trace with hash 709972229, now seen corresponding path program 1 times [2021-11-25 20:38:49,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:38:49,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579646844] [2021-11-25 20:38:49,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:49,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:38:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:50,016 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-25 20:38:50,016 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:38:50,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579646844] [2021-11-25 20:38:50,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579646844] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:38:50,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:38:50,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:38:50,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9575194] [2021-11-25 20:38:50,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:38:50,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:38:50,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:38:50,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:38:50,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:38:50,019 INFO L87 Difference]: Start difference. First operand 2771 states and 3588 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2021-11-25 20:38:50,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:38:50,186 INFO L93 Difference]: Finished difference Result 4888 states and 6343 transitions. [2021-11-25 20:38:50,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:38:50,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2021-11-25 20:38:50,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:38:50,206 INFO L225 Difference]: With dead ends: 4888 [2021-11-25 20:38:50,206 INFO L226 Difference]: Without dead ends: 2731 [2021-11-25 20:38:50,212 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:38:50,213 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 7 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:38:50,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 580 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 20:38:50,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2731 states. [2021-11-25 20:38:50,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2731 to 2731. [2021-11-25 20:38:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2731 states, 1983 states have (on average 1.2677760968229954) internal successors, (2514), 2006 states have internal predecessors, (2514), 477 states have call successors, (477), 270 states have call predecessors, (477), 270 states have return successors, (477), 454 states have call predecessors, (477), 477 states have call successors, (477) [2021-11-25 20:38:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2731 states and 3468 transitions. [2021-11-25 20:38:50,407 INFO L78 Accepts]: Start accepts. Automaton has 2731 states and 3468 transitions. Word has length 72 [2021-11-25 20:38:50,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:38:50,407 INFO L470 AbstractCegarLoop]: Abstraction has 2731 states and 3468 transitions. [2021-11-25 20:38:50,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2021-11-25 20:38:50,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 3468 transitions. [2021-11-25 20:38:50,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-25 20:38:50,411 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:38:50,411 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:38:50,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-25 20:38:50,411 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:38:50,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:38:50,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1926303119, now seen corresponding path program 1 times [2021-11-25 20:38:50,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:38:50,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070205342] [2021-11-25 20:38:50,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:50,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:38:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-25 20:38:50,446 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:38:50,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070205342] [2021-11-25 20:38:50,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070205342] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:38:50,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:38:50,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:38:50,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422176221] [2021-11-25 20:38:50,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:38:50,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:38:50,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:38:50,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:38:50,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:38:50,449 INFO L87 Difference]: Start difference. First operand 2731 states and 3468 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-25 20:38:50,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:38:50,731 INFO L93 Difference]: Finished difference Result 5872 states and 7752 transitions. [2021-11-25 20:38:50,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:38:50,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2021-11-25 20:38:50,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:38:50,758 INFO L225 Difference]: With dead ends: 5872 [2021-11-25 20:38:50,758 INFO L226 Difference]: Without dead ends: 3602 [2021-11-25 20:38:50,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:38:50,766 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 102 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:38:50,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 510 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:38:50,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3602 states. [2021-11-25 20:38:50,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3602 to 2736. [2021-11-25 20:38:50,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2736 states, 1988 states have (on average 1.267102615694165) internal successors, (2519), 2011 states have internal predecessors, (2519), 477 states have call successors, (477), 270 states have call predecessors, (477), 270 states have return successors, (477), 454 states have call predecessors, (477), 477 states have call successors, (477) [2021-11-25 20:38:50,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 3473 transitions. [2021-11-25 20:38:50,990 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 3473 transitions. Word has length 71 [2021-11-25 20:38:50,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:38:50,991 INFO L470 AbstractCegarLoop]: Abstraction has 2736 states and 3473 transitions. [2021-11-25 20:38:50,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-25 20:38:50,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 3473 transitions. [2021-11-25 20:38:50,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-25 20:38:50,994 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:38:50,994 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:38:50,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-25 20:38:50,995 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:38:50,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:38:50,995 INFO L85 PathProgramCache]: Analyzing trace with hash 608719174, now seen corresponding path program 1 times [2021-11-25 20:38:50,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:38:50,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349439833] [2021-11-25 20:38:50,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:50,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:38:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:51,059 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-25 20:38:51,060 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:38:51,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349439833] [2021-11-25 20:38:51,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349439833] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:38:51,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:38:51,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:38:51,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096591395] [2021-11-25 20:38:51,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:38:51,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:38:51,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:38:51,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:38:51,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:38:51,063 INFO L87 Difference]: Start difference. First operand 2736 states and 3473 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-25 20:38:51,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:38:51,266 INFO L93 Difference]: Finished difference Result 5110 states and 6552 transitions. [2021-11-25 20:38:51,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 20:38:51,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2021-11-25 20:38:51,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:38:51,287 INFO L225 Difference]: With dead ends: 5110 [2021-11-25 20:38:51,287 INFO L226 Difference]: Without dead ends: 2503 [2021-11-25 20:38:51,294 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:38:51,295 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 178 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:38:51,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 615 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:38:51,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2021-11-25 20:38:51,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2263. [2021-11-25 20:38:51,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2263 states, 1644 states have (on average 1.2639902676399026) internal successors, (2078), 1663 states have internal predecessors, (2078), 390 states have call successors, (390), 228 states have call predecessors, (390), 228 states have return successors, (390), 371 states have call predecessors, (390), 390 states have call successors, (390) [2021-11-25 20:38:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 2858 transitions. [2021-11-25 20:38:51,498 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 2858 transitions. Word has length 72 [2021-11-25 20:38:51,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:38:51,500 INFO L470 AbstractCegarLoop]: Abstraction has 2263 states and 2858 transitions. [2021-11-25 20:38:51,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-25 20:38:51,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 2858 transitions. [2021-11-25 20:38:51,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-25 20:38:51,503 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:38:51,503 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:38:51,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-25 20:38:51,503 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:38:51,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:38:51,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1683138964, now seen corresponding path program 1 times [2021-11-25 20:38:51,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:38:51,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862517048] [2021-11-25 20:38:51,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:51,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:38:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-25 20:38:51,539 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:38:51,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862517048] [2021-11-25 20:38:51,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862517048] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:38:51,539 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:38:51,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:38:51,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676624374] [2021-11-25 20:38:51,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:38:51,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:38:51,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:38:51,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:38:51,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:38:51,541 INFO L87 Difference]: Start difference. First operand 2263 states and 2858 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-25 20:38:51,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:38:51,808 INFO L93 Difference]: Finished difference Result 4913 states and 6405 transitions. [2021-11-25 20:38:51,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:38:51,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2021-11-25 20:38:51,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:38:51,843 INFO L225 Difference]: With dead ends: 4913 [2021-11-25 20:38:51,844 INFO L226 Difference]: Without dead ends: 2838 [2021-11-25 20:38:51,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:38:51,852 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 102 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:38:51,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 485 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:38:51,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2021-11-25 20:38:52,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2269. [2021-11-25 20:38:52,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2269 states, 1650 states have (on average 1.263030303030303) internal successors, (2084), 1669 states have internal predecessors, (2084), 390 states have call successors, (390), 228 states have call predecessors, (390), 228 states have return successors, (390), 371 states have call predecessors, (390), 390 states have call successors, (390) [2021-11-25 20:38:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2269 states to 2269 states and 2864 transitions. [2021-11-25 20:38:52,027 INFO L78 Accepts]: Start accepts. Automaton has 2269 states and 2864 transitions. Word has length 73 [2021-11-25 20:38:52,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:38:52,028 INFO L470 AbstractCegarLoop]: Abstraction has 2269 states and 2864 transitions. [2021-11-25 20:38:52,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-25 20:38:52,028 INFO L276 IsEmpty]: Start isEmpty. Operand 2269 states and 2864 transitions. [2021-11-25 20:38:52,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-25 20:38:52,030 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:38:52,031 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:38:52,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-25 20:38:52,031 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:38:52,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:38:52,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1526261967, now seen corresponding path program 1 times [2021-11-25 20:38:52,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:38:52,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177208919] [2021-11-25 20:38:52,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:52,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:38:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-25 20:38:52,088 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:38:52,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177208919] [2021-11-25 20:38:52,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177208919] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:38:52,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:38:52,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:38:52,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498371815] [2021-11-25 20:38:52,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:38:52,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:38:52,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:38:52,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:38:52,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:38:52,092 INFO L87 Difference]: Start difference. First operand 2269 states and 2864 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-25 20:38:52,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:38:52,308 INFO L93 Difference]: Finished difference Result 4621 states and 5950 transitions. [2021-11-25 20:38:52,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 20:38:52,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2021-11-25 20:38:52,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:38:52,331 INFO L225 Difference]: With dead ends: 4621 [2021-11-25 20:38:52,331 INFO L226 Difference]: Without dead ends: 2489 [2021-11-25 20:38:52,340 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:38:52,341 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 130 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:38:52,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 618 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:38:52,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2021-11-25 20:38:52,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2076. [2021-11-25 20:38:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2076 states, 1503 states have (on average 1.2541583499667333) internal successors, (1885), 1518 states have internal predecessors, (1885), 361 states have call successors, (361), 211 states have call predecessors, (361), 211 states have return successors, (361), 346 states have call predecessors, (361), 361 states have call successors, (361) [2021-11-25 20:38:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 2076 states and 2607 transitions. [2021-11-25 20:38:52,489 INFO L78 Accepts]: Start accepts. Automaton has 2076 states and 2607 transitions. Word has length 73 [2021-11-25 20:38:52,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:38:52,490 INFO L470 AbstractCegarLoop]: Abstraction has 2076 states and 2607 transitions. [2021-11-25 20:38:52,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-25 20:38:52,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2607 transitions. [2021-11-25 20:38:52,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-25 20:38:52,493 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:38:52,493 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:38:52,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-25 20:38:52,494 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:38:52,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:38:52,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1576516663, now seen corresponding path program 1 times [2021-11-25 20:38:52,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:38:52,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131994038] [2021-11-25 20:38:52,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:52,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:38:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-11-25 20:38:52,572 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:38:52,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131994038] [2021-11-25 20:38:52,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131994038] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:38:52,572 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:38:52,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:38:52,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173182174] [2021-11-25 20:38:52,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:38:52,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:38:52,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:38:52,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:38:52,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:38:52,574 INFO L87 Difference]: Start difference. First operand 2076 states and 2607 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2021-11-25 20:38:52,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:38:52,729 INFO L93 Difference]: Finished difference Result 3853 states and 4864 transitions. [2021-11-25 20:38:52,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:38:52,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 88 [2021-11-25 20:38:52,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:38:52,738 INFO L225 Difference]: With dead ends: 3853 [2021-11-25 20:38:52,738 INFO L226 Difference]: Without dead ends: 2046 [2021-11-25 20:38:52,743 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:38:52,744 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 7 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:38:52,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 568 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 20:38:52,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2021-11-25 20:38:52,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1971. [2021-11-25 20:38:52,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1971 states, 1434 states have (on average 1.2224546722454672) internal successors, (1753), 1449 states have internal predecessors, (1753), 334 states have call successors, (334), 202 states have call predecessors, (334), 202 states have return successors, (334), 319 states have call predecessors, (334), 334 states have call successors, (334) [2021-11-25 20:38:52,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 2421 transitions. [2021-11-25 20:38:52,910 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 2421 transitions. Word has length 88 [2021-11-25 20:38:52,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:38:52,911 INFO L470 AbstractCegarLoop]: Abstraction has 1971 states and 2421 transitions. [2021-11-25 20:38:52,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2021-11-25 20:38:52,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2421 transitions. [2021-11-25 20:38:52,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-25 20:38:52,915 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:38:52,915 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:38:52,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-25 20:38:52,916 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:38:52,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:38:52,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1151776151, now seen corresponding path program 1 times [2021-11-25 20:38:52,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:38:52,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030387887] [2021-11-25 20:38:52,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:52,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:38:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:52,989 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-11-25 20:38:52,989 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:38:52,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030387887] [2021-11-25 20:38:52,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030387887] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:38:52,990 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:38:52,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:38:52,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653217525] [2021-11-25 20:38:52,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:38:52,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:38:52,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:38:52,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:38:52,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:38:52,992 INFO L87 Difference]: Start difference. First operand 1971 states and 2421 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2021-11-25 20:38:53,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:38:53,135 INFO L93 Difference]: Finished difference Result 3610 states and 4459 transitions. [2021-11-25 20:38:53,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:38:53,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2021-11-25 20:38:53,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:38:53,143 INFO L225 Difference]: With dead ends: 3610 [2021-11-25 20:38:53,143 INFO L226 Difference]: Without dead ends: 1935 [2021-11-25 20:38:53,147 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:38:53,149 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 6 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:38:53,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 559 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 20:38:53,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2021-11-25 20:38:53,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1841. [2021-11-25 20:38:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1338 states have (on average 1.194319880418535) internal successors, (1598), 1353 states have internal predecessors, (1598), 311 states have call successors, (311), 191 states have call predecessors, (311), 191 states have return successors, (311), 296 states have call predecessors, (311), 311 states have call successors, (311) [2021-11-25 20:38:53,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2220 transitions. [2021-11-25 20:38:53,276 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2220 transitions. Word has length 104 [2021-11-25 20:38:53,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:38:53,277 INFO L470 AbstractCegarLoop]: Abstraction has 1841 states and 2220 transitions. [2021-11-25 20:38:53,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2021-11-25 20:38:53,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2220 transitions. [2021-11-25 20:38:53,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-25 20:38:53,282 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:38:53,282 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:38:53,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-25 20:38:53,283 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:38:53,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:38:53,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1047170266, now seen corresponding path program 1 times [2021-11-25 20:38:53,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:38:53,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075333270] [2021-11-25 20:38:53,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:53,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:38:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:53,480 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-11-25 20:38:53,481 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:38:53,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075333270] [2021-11-25 20:38:53,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075333270] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:38:53,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454052157] [2021-11-25 20:38:53,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:53,481 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:38:53,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:38:53,485 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:38:53,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 20:38:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:53,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-25 20:38:53,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:38:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-11-25 20:38:53,907 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 20:38:53,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454052157] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:38:53,907 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 20:38:53,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 11 [2021-11-25 20:38:53,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41106570] [2021-11-25 20:38:53,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:38:53,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-25 20:38:53,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:38:53,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-25 20:38:53,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-25 20:38:53,910 INFO L87 Difference]: Start difference. First operand 1841 states and 2220 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2021-11-25 20:38:54,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:38:54,532 INFO L93 Difference]: Finished difference Result 4822 states and 5861 transitions. [2021-11-25 20:38:54,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 20:38:54,532 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 114 [2021-11-25 20:38:54,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:38:54,545 INFO L225 Difference]: With dead ends: 4822 [2021-11-25 20:38:54,546 INFO L226 Difference]: Without dead ends: 3133 [2021-11-25 20:38:54,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:38:54,552 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 256 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:38:54,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 1472 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 20:38:54,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2021-11-25 20:38:54,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 2068. [2021-11-25 20:38:54,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2068 states, 1504 states have (on average 1.1861702127659575) internal successors, (1784), 1523 states have internal predecessors, (1784), 343 states have call successors, (343), 220 states have call predecessors, (343), 220 states have return successors, (343), 324 states have call predecessors, (343), 343 states have call successors, (343) [2021-11-25 20:38:54,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 2470 transitions. [2021-11-25 20:38:54,769 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 2470 transitions. Word has length 114 [2021-11-25 20:38:54,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:38:54,771 INFO L470 AbstractCegarLoop]: Abstraction has 2068 states and 2470 transitions. [2021-11-25 20:38:54,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2021-11-25 20:38:54,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2470 transitions. [2021-11-25 20:38:54,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-11-25 20:38:54,776 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:38:54,777 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:38:54,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 20:38:54,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-25 20:38:54,993 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:38:54,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:38:54,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1073798582, now seen corresponding path program 1 times [2021-11-25 20:38:54,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:38:54,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098470009] [2021-11-25 20:38:54,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:54,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:38:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-11-25 20:38:55,557 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:38:55,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098470009] [2021-11-25 20:38:55,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098470009] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:38:55,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386521485] [2021-11-25 20:38:55,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:38:55,558 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:38:55,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:38:55,559 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:38:55,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 20:38:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:38:55,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-25 20:38:55,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:38:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-25 20:38:56,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:38:56,352 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2021-11-25 20:38:56,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386521485] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:38:56,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [199652483] [2021-11-25 20:38:56,369 INFO L159 IcfgInterpreter]: Started Sifa with 78 locations of interest [2021-11-25 20:38:56,369 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 20:38:56,370 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 20:38:56,370 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 20:38:56,370 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 20:39:08,636 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 162 for LOIs [2021-11-25 20:39:11,535 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 6 for LOIs [2021-11-25 20:39:11,537 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 22 for LOIs [2021-11-25 20:39:11,554 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 31 for LOIs [2021-11-25 20:39:11,565 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 22 for LOIs [2021-11-25 20:39:11,583 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 35 for LOIs [2021-11-25 20:39:11,613 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 20:39:28,276 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '120154#(and (= (mod ~side2Failed_History_1~0 256) (mod ~side2Failed_History_2~0 256)) (= |assert_#in~arg| 0) (<= ~manual_selection_History_1~0 127) (<= 0 ~active_side_History_0~0) (= assert_~arg |assert_#in~arg|) (= (mod ~side2Failed_History_1~0 256) 0) (= (mod ~side1Failed_History_2~0 256) (mod ~side1Failed_History_1~0 256)) (<= ~active_side_History_0~0 2) (= ~manual_selection_History_2~0 0) (not (= ~manual_selection_History_1~0 0)) (<= 0 (+ ~manual_selection_History_1~0 128)) (= (mod ~side1Failed_History_1~0 256) 0))' at error location [2021-11-25 20:39:28,276 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 20:39:28,276 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:39:28,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 27 [2021-11-25 20:39:28,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735245435] [2021-11-25 20:39:28,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:39:28,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-25 20:39:28,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:39:28,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-25 20:39:28,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=644, Invalid=7188, Unknown=0, NotChecked=0, Total=7832 [2021-11-25 20:39:28,281 INFO L87 Difference]: Start difference. First operand 2068 states and 2470 transitions. Second operand has 27 states, 21 states have (on average 5.761904761904762) internal successors, (121), 23 states have internal predecessors, (121), 8 states have call successors, (38), 3 states have call predecessors, (38), 10 states have return successors, (37), 10 states have call predecessors, (37), 8 states have call successors, (37) [2021-11-25 20:39:30,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:39:30,797 INFO L93 Difference]: Finished difference Result 5705 states and 7492 transitions. [2021-11-25 20:39:30,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 20:39:30,798 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 21 states have (on average 5.761904761904762) internal successors, (121), 23 states have internal predecessors, (121), 8 states have call successors, (38), 3 states have call predecessors, (38), 10 states have return successors, (37), 10 states have call predecessors, (37), 8 states have call successors, (37) Word has length 122 [2021-11-25 20:39:30,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:39:30,815 INFO L225 Difference]: With dead ends: 5705 [2021-11-25 20:39:30,815 INFO L226 Difference]: Without dead ends: 3772 [2021-11-25 20:39:30,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 285 SyntacticMatches, 10 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3119 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=710, Invalid=8992, Unknown=0, NotChecked=0, Total=9702 [2021-11-25 20:39:30,825 INFO L933 BasicCegarLoop]: 649 mSDtfsCounter, 732 mSDsluCounter, 9350 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 9523 SdHoareTripleChecker+Invalid, 2208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:39:30,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [782 Valid, 9523 Invalid, 2208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1889 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-25 20:39:30,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3772 states. [2021-11-25 20:39:31,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3772 to 2068. [2021-11-25 20:39:31,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2068 states, 1504 states have (on average 1.1841755319148937) internal successors, (1781), 1523 states have internal predecessors, (1781), 343 states have call successors, (343), 220 states have call predecessors, (343), 220 states have return successors, (343), 324 states have call predecessors, (343), 343 states have call successors, (343) [2021-11-25 20:39:31,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 2467 transitions. [2021-11-25 20:39:31,057 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 2467 transitions. Word has length 122 [2021-11-25 20:39:31,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:39:31,057 INFO L470 AbstractCegarLoop]: Abstraction has 2068 states and 2467 transitions. [2021-11-25 20:39:31,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 21 states have (on average 5.761904761904762) internal successors, (121), 23 states have internal predecessors, (121), 8 states have call successors, (38), 3 states have call predecessors, (38), 10 states have return successors, (37), 10 states have call predecessors, (37), 8 states have call successors, (37) [2021-11-25 20:39:31,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2467 transitions. [2021-11-25 20:39:31,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-25 20:39:31,062 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:39:31,062 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:39:31,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-25 20:39:31,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-25 20:39:31,281 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:39:31,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:39:31,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1276964122, now seen corresponding path program 1 times [2021-11-25 20:39:31,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:39:31,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776187824] [2021-11-25 20:39:31,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:39:31,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:39:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:31,493 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-11-25 20:39:31,493 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:39:31,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776187824] [2021-11-25 20:39:31,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776187824] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:39:31,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101612923] [2021-11-25 20:39:31,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:39:31,493 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:31,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:39:31,497 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:39:31,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-25 20:39:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:31,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-25 20:39:31,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:39:31,904 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-25 20:39:31,905 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 20:39:31,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101612923] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:39:31,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 20:39:31,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 11 [2021-11-25 20:39:31,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976508860] [2021-11-25 20:39:31,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:39:31,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-25 20:39:31,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:39:31,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-25 20:39:31,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-25 20:39:31,906 INFO L87 Difference]: Start difference. First operand 2068 states and 2467 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2021-11-25 20:39:32,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:39:32,805 INFO L93 Difference]: Finished difference Result 5933 states and 7425 transitions. [2021-11-25 20:39:32,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 20:39:32,806 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) Word has length 130 [2021-11-25 20:39:32,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:39:32,824 INFO L225 Difference]: With dead ends: 5933 [2021-11-25 20:39:32,824 INFO L226 Difference]: Without dead ends: 4000 [2021-11-25 20:39:32,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:39:32,831 INFO L933 BasicCegarLoop]: 396 mSDtfsCounter, 282 mSDsluCounter, 2333 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 2639 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 20:39:32,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 2639 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 20:39:32,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4000 states. [2021-11-25 20:39:33,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4000 to 2828. [2021-11-25 20:39:33,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2828 states, 2056 states have (on average 1.178988326848249) internal successors, (2424), 2083 states have internal predecessors, (2424), 471 states have call successors, (471), 300 states have call predecessors, (471), 300 states have return successors, (471), 444 states have call predecessors, (471), 471 states have call successors, (471) [2021-11-25 20:39:33,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 3366 transitions. [2021-11-25 20:39:33,094 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 3366 transitions. Word has length 130 [2021-11-25 20:39:33,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:39:33,095 INFO L470 AbstractCegarLoop]: Abstraction has 2828 states and 3366 transitions. [2021-11-25 20:39:33,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2021-11-25 20:39:33,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 3366 transitions. [2021-11-25 20:39:33,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-11-25 20:39:33,102 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:39:33,102 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:39:33,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-25 20:39:33,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:33,329 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:39:33,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:39:33,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1385555272, now seen corresponding path program 1 times [2021-11-25 20:39:33,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:39:33,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509014770] [2021-11-25 20:39:33,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:39:33,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:39:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-11-25 20:39:33,492 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:39:33,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509014770] [2021-11-25 20:39:33,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509014770] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:39:33,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447410380] [2021-11-25 20:39:33,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:39:33,493 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:33,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:39:33,494 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:39:33,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-25 20:39:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:33,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-25 20:39:33,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:39:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-11-25 20:39:33,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 20:39:33,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447410380] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:39:33,870 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 20:39:33,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 9 [2021-11-25 20:39:33,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969636577] [2021-11-25 20:39:33,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:39:33,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 20:39:33,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:39:33,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 20:39:33,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-25 20:39:33,873 INFO L87 Difference]: Start difference. First operand 2828 states and 3366 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2021-11-25 20:39:34,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:39:34,576 INFO L93 Difference]: Finished difference Result 6208 states and 7653 transitions. [2021-11-25 20:39:34,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 20:39:34,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 137 [2021-11-25 20:39:34,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:39:34,593 INFO L225 Difference]: With dead ends: 6208 [2021-11-25 20:39:34,593 INFO L226 Difference]: Without dead ends: 3521 [2021-11-25 20:39:34,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 136 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:39:34,600 INFO L933 BasicCegarLoop]: 386 mSDtfsCounter, 468 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:39:34,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [468 Valid, 1378 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 20:39:34,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2021-11-25 20:39:34,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 2828. [2021-11-25 20:39:34,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2828 states, 2056 states have (on average 1.17363813229572) internal successors, (2413), 2083 states have internal predecessors, (2413), 471 states have call successors, (471), 300 states have call predecessors, (471), 300 states have return successors, (471), 444 states have call predecessors, (471), 471 states have call successors, (471) [2021-11-25 20:39:34,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 3355 transitions. [2021-11-25 20:39:34,876 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 3355 transitions. Word has length 137 [2021-11-25 20:39:34,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:39:34,877 INFO L470 AbstractCegarLoop]: Abstraction has 2828 states and 3355 transitions. [2021-11-25 20:39:34,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2021-11-25 20:39:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 3355 transitions. [2021-11-25 20:39:34,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-11-25 20:39:34,883 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:39:34,884 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:39:34,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-25 20:39:35,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-25 20:39:35,104 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:39:35,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:39:35,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1772214134, now seen corresponding path program 1 times [2021-11-25 20:39:35,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:39:35,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591501303] [2021-11-25 20:39:35,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:39:35,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:39:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:36,609 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-11-25 20:39:36,609 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:39:36,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591501303] [2021-11-25 20:39:36,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591501303] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:39:36,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307448036] [2021-11-25 20:39:36,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:39:36,610 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:39:36,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:39:36,621 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:39:36,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-25 20:39:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:39:36,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-25 20:39:36,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:39:37,569 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 71 proven. 5 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-11-25 20:39:37,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:39:38,245 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2021-11-25 20:39:38,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307448036] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:39:38,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1272925707] [2021-11-25 20:39:38,249 INFO L159 IcfgInterpreter]: Started Sifa with 84 locations of interest [2021-11-25 20:39:38,250 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 20:39:38,250 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 20:39:38,251 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 20:39:38,251 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 20:39:45,324 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 74 for LOIs [2021-11-25 20:39:45,421 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 108 for LOIs [2021-11-25 20:39:45,433 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 104 for LOIs [2021-11-25 20:39:45,586 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 109 for LOIs [2021-11-25 20:39:45,645 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 112 for LOIs [2021-11-25 20:39:45,752 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 120 for LOIs [2021-11-25 20:39:46,124 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 20:40:34,723 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '155385#(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) (= (mod ~side2Failed_History_1~0 256) (mod ~side2Failed_History_2~0 256)) (<= 0 ~cs2~0) (<= ~manual_selection_History_0~0 127) (= ~manual_selection_History_1~0 0) (<= 0 (+ ~s2p_new~0 1)) (= |assert_#in~arg| 0) (<= 0 ~side2_written~0) (<= ~s1s2~0 0) (<= 0 ~s2p~0) (<= ~s2p~0 0) (<= 0 ~cs1~0) (<= 0 ~s1p~0) (<= 0 (+ ~s1s2_new~0 1)) (<= |#NULL.offset| 0) (<= 0 ~active_side_History_0~0) (= assert_~arg |assert_#in~arg|) (<= (+ ~cs2_new~0 1) 0) (<= (+ ~s1s2_new~0 1) 0) (<= 0 (+ ~s1p_new~0 1)) (<= (+ 2 ~active_side_History_2~0) 0) (<= (+ ~s2s1_new~0 1) 0) (= (mod ~side2Failed_History_1~0 256) 0) (= ~manual_selection_History_2~0 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)) (<= 0 (+ ~side1_written~0 1)) (<= ~side2_written~0 0) (<= 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 [2021-11-25 20:40:34,723 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 20:40:34,724 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:40:34,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 14, 14] total 55 [2021-11-25 20:40:34,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84479731] [2021-11-25 20:40:34,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:40:34,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-11-25 20:40:34,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:40:34,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-11-25 20:40:34,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1989, Invalid=10001, Unknown=0, NotChecked=0, Total=11990 [2021-11-25 20:40:34,729 INFO L87 Difference]: Start difference. First operand 2828 states and 3355 transitions. Second operand has 55 states, 43 states have (on average 3.953488372093023) internal successors, (170), 44 states have internal predecessors, (170), 18 states have call successors, (50), 5 states have call predecessors, (50), 17 states have return successors, (49), 24 states have call predecessors, (49), 18 states have call successors, (49) [2021-11-25 20:40:41,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:40:41,347 INFO L93 Difference]: Finished difference Result 7655 states and 9904 transitions. [2021-11-25 20:40:41,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-11-25 20:40:41,348 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 43 states have (on average 3.953488372093023) internal successors, (170), 44 states have internal predecessors, (170), 18 states have call successors, (50), 5 states have call predecessors, (50), 17 states have return successors, (49), 24 states have call predecessors, (49), 18 states have call successors, (49) Word has length 137 [2021-11-25 20:40:41,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:40:41,379 INFO L225 Difference]: With dead ends: 7655 [2021-11-25 20:40:41,379 INFO L226 Difference]: Without dead ends: 4997 [2021-11-25 20:40:41,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 324 SyntacticMatches, 15 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5944 ImplicationChecksByTransitivity, 51.5s TimeCoverageRelationStatistics Valid=2461, Invalid=16171, Unknown=0, NotChecked=0, Total=18632 [2021-11-25 20:40:41,393 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 853 mSDsluCounter, 12803 mSDsCounter, 0 mSdLazyCounter, 5864 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 12542 SdHoareTripleChecker+Invalid, 6137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 5864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:40:41,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [909 Valid, 12542 Invalid, 6137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 5864 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2021-11-25 20:40:41,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4997 states. [2021-11-25 20:40:41,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4997 to 2799. [2021-11-25 20:40:41,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2799 states, 2035 states have (on average 1.173955773955774) internal successors, (2389), 2061 states have internal predecessors, (2389), 466 states have call successors, (466), 297 states have call predecessors, (466), 297 states have return successors, (466), 440 states have call predecessors, (466), 466 states have call successors, (466) [2021-11-25 20:40:41,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2799 states and 3321 transitions. [2021-11-25 20:40:41,688 INFO L78 Accepts]: Start accepts. Automaton has 2799 states and 3321 transitions. Word has length 137 [2021-11-25 20:40:41,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:40:41,688 INFO L470 AbstractCegarLoop]: Abstraction has 2799 states and 3321 transitions. [2021-11-25 20:40:41,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 43 states have (on average 3.953488372093023) internal successors, (170), 44 states have internal predecessors, (170), 18 states have call successors, (50), 5 states have call predecessors, (50), 17 states have return successors, (49), 24 states have call predecessors, (49), 18 states have call successors, (49) [2021-11-25 20:40:41,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2799 states and 3321 transitions. [2021-11-25 20:40:41,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-11-25 20:40:41,694 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:40:41,694 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:40:41,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-25 20:40:41,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-25 20:40:41,921 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:40:41,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:40:41,922 INFO L85 PathProgramCache]: Analyzing trace with hash 306941895, now seen corresponding path program 1 times [2021-11-25 20:40:41,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:40:41,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675297147] [2021-11-25 20:40:41,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:40:41,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:40:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:40:42,127 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-11-25 20:40:42,127 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:40:42,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675297147] [2021-11-25 20:40:42,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675297147] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:40:42,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842486607] [2021-11-25 20:40:42,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:40:42,128 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:40:42,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:40:42,129 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:40:42,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-25 20:40:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:40:42,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-25 20:40:42,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:40:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 65 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-25 20:40:42,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:40:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-11-25 20:40:43,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842486607] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:40:43,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1649491242] [2021-11-25 20:40:43,549 INFO L159 IcfgInterpreter]: Started Sifa with 75 locations of interest [2021-11-25 20:40:43,549 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 20:40:43,550 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 20:40:43,550 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 20:40:43,550 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 20:41:17,747 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 56 for LOIs [2021-11-25 20:41:17,798 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 93 for LOIs [2021-11-25 20:41:17,807 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 111 for LOIs [2021-11-25 20:41:17,903 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 113 for LOIs [2021-11-25 20:41:18,009 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 126 for LOIs [2021-11-25 20:41:18,211 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 92 for LOIs [2021-11-25 20:41:18,246 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 20:41:48,530 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '170192#(and (<= 0 (+ ~manual_selection_History_0~0 128)) (<= 0 (+ ~s1s1_new~0 1)) (<= 0 (+ 2 ~active_side_History_1~0)) (= ~s1p~0 0) (<= 0 (+ ~s2s2_new~0 1)) (= ~cs1~0 0) (<= 0 (+ ~s2s1_new~0 1)) (= ~s2s1~0 0) (<= (+ ~s1p_new~0 1) 0) (<= ~manual_selection_History_0~0 127) (<= 0 (+ ~s2p_new~0 1)) (= ~s1s1~0 0) (exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_226| Int)) (and (<= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_226| 1) (= (ite (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_226| 0) 0 1) |assert_#in~arg|) (<= 0 |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_226|))) (<= 0 (+ ~s1s2_new~0 1)) (<= 0 ~active_side_History_0~0) (= assert_~arg |assert_#in~arg|) (<= (+ ~cs2_new~0 1) 0) (<= (+ ~s1s2_new~0 1) 0) (= ~s2s2~0 0) (<= 0 (+ ~s1p_new~0 1)) (<= (+ ~s2s1_new~0 1) 0) (= (mod assert_~arg 256) 0) (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~side2_written~0 1)) (= ~s1s2~0 0) (<= 0 (+ ~cs1_new~0 1)) (<= (+ ~cs1_new~0 1) 0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= 0 (+ 2 ~active_side_History_2~0)) (<= 0 (+ ~side1_written~0 1)) (<= ~side2_written~0 0) (<= ~side1_written~0 1) (<= 0 (+ ~cs2_new~0 1)) (= ~cs2~0 0) (<= 0 |#StackHeapBarrier|) (<= (+ ~s2p_new~0 1) 0) (= ~s2p~0 0) (<= (+ ~s2s2_new~0 1) 0) (<= (+ ~s1s1_new~0 1) 0) (= |#NULL.base| 0))' at error location [2021-11-25 20:41:48,530 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 20:41:48,531 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:41:48,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24 [2021-11-25 20:41:48,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913297059] [2021-11-25 20:41:48,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:41:48,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-25 20:41:48,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:41:48,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-25 20:41:48,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=790, Invalid=6692, Unknown=0, NotChecked=0, Total=7482 [2021-11-25 20:41:48,534 INFO L87 Difference]: Start difference. First operand 2799 states and 3321 transitions. Second operand has 24 states, 24 states have (on average 7.125) internal successors, (171), 24 states have internal predecessors, (171), 9 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (45), 9 states have call predecessors, (45), 9 states have call successors, (45) [2021-11-25 20:41:51,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:41:51,097 INFO L93 Difference]: Finished difference Result 6695 states and 8311 transitions. [2021-11-25 20:41:51,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-25 20:41:51,098 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.125) internal successors, (171), 24 states have internal predecessors, (171), 9 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (45), 9 states have call predecessors, (45), 9 states have call successors, (45) Word has length 137 [2021-11-25 20:41:51,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:41:51,114 INFO L225 Difference]: With dead ends: 6695 [2021-11-25 20:41:51,114 INFO L226 Difference]: Without dead ends: 4076 [2021-11-25 20:41:51,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 324 SyntacticMatches, 12 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3975 ImplicationChecksByTransitivity, 31.4s TimeCoverageRelationStatistics Valid=989, Invalid=9313, Unknown=0, NotChecked=0, Total=10302 [2021-11-25 20:41:51,123 INFO L933 BasicCegarLoop]: 326 mSDtfsCounter, 1665 mSDsluCounter, 2756 mSDsCounter, 0 mSdLazyCounter, 1836 mSolverCounterSat, 631 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1665 SdHoareTripleChecker+Valid, 3020 SdHoareTripleChecker+Invalid, 2467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 631 IncrementalHoareTripleChecker+Valid, 1836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:41:51,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1665 Valid, 3020 Invalid, 2467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [631 Valid, 1836 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-25 20:41:51,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2021-11-25 20:41:51,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 3206. [2021-11-25 20:41:51,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3206 states, 2335 states have (on average 1.1700214132762312) internal successors, (2732), 2364 states have internal predecessors, (2732), 528 states have call successors, (528), 342 states have call predecessors, (528), 342 states have return successors, (528), 499 states have call predecessors, (528), 528 states have call successors, (528) [2021-11-25 20:41:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3206 states to 3206 states and 3788 transitions. [2021-11-25 20:41:51,511 INFO L78 Accepts]: Start accepts. Automaton has 3206 states and 3788 transitions. Word has length 137 [2021-11-25 20:41:51,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:41:51,512 INFO L470 AbstractCegarLoop]: Abstraction has 3206 states and 3788 transitions. [2021-11-25 20:41:51,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.125) internal successors, (171), 24 states have internal predecessors, (171), 9 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (45), 9 states have call predecessors, (45), 9 states have call successors, (45) [2021-11-25 20:41:51,512 INFO L276 IsEmpty]: Start isEmpty. Operand 3206 states and 3788 transitions. [2021-11-25 20:41:51,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-11-25 20:41:51,516 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:41:51,517 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:41:51,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-25 20:41:51,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:41:51,745 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:41:51,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:41:51,746 INFO L85 PathProgramCache]: Analyzing trace with hash 202483465, now seen corresponding path program 1 times [2021-11-25 20:41:51,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:41:51,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113800312] [2021-11-25 20:41:51,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:41:51,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:41:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:41:51,928 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-11-25 20:41:51,928 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:41:51,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113800312] [2021-11-25 20:41:51,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113800312] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:41:51,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515589882] [2021-11-25 20:41:51,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:41:51,929 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:41:51,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:41:51,937 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:41:51,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-25 20:41:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:41:52,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-25 20:41:52,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:41:52,816 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 64 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-25 20:41:52,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:41:53,354 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-11-25 20:41:53,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515589882] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:41:53,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [911182862] [2021-11-25 20:41:53,356 INFO L159 IcfgInterpreter]: Started Sifa with 73 locations of interest [2021-11-25 20:41:53,356 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 20:41:53,357 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 20:41:53,357 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 20:41:53,357 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 20:42:49,853 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 75 for LOIs [2021-11-25 20:42:49,953 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 108 for LOIs [2021-11-25 20:42:49,966 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 106 for LOIs [2021-11-25 20:42:50,068 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 113 for LOIs [2021-11-25 20:42:50,225 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 105 for LOIs [2021-11-25 20:42:50,272 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 106 for LOIs [2021-11-25 20:42:50,320 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 20:43:38,503 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '183979#(and (<= 0 (+ ~manual_selection_History_0~0 128)) (<= ~s1p~0 0) (<= ~cs2~0 0) (<= 0 |#NULL.base|) (<= 0 (+ ~s1s1_new~0 1)) (<= ~active_side_History_2~0 2) (<= 0 (+ 2 ~active_side_History_1~0)) (<= 0 (+ ~s2s2_new~0 1)) (<= ~active_side_History_1~0 2) (<= ~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) (<= 0 (+ ~s2p_new~0 1)) (<= 0 ~side2_written~0) (<= ~s1s2~0 0) (<= 0 ~s2p~0) (<= 0 (+ ~manual_selection_History_2~0 128)) (<= ~s2p~0 0) (<= ~manual_selection_History_1~0 127) (<= 0 ~cs1~0) (<= 0 ~s1p~0) (<= 0 (+ ~s1s2_new~0 1)) (<= |#NULL.offset| 0) (<= 0 ~active_side_History_0~0) (= assert_~arg |assert_#in~arg|) (<= (+ ~cs2_new~0 1) 0) (<= (+ ~s1s2_new~0 1) 0) (<= 0 (+ ~s1p_new~0 1)) (<= (+ ~s2s1_new~0 1) 0) (<= ~active_side_History_0~0 2) (= (mod assert_~arg 256) 0) (<= ~manual_selection_History_2~0 127) (<= ~cs1~0 0) (<= 0 ~s2s2~0) (exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_458| Int)) (and (<= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_458| 1) (<= 0 |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_458|) (= (ite (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_458| 0) 0 1) |assert_#in~arg|))) (<= (+ ~nomsg~0 1) 0) (<= |#NULL.base| 0) (<= 0 (+ ~cs1_new~0 1)) (<= (+ ~cs1_new~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= 0 (+ ~manual_selection_History_1~0 128)) (<= 0 (+ 2 ~active_side_History_2~0)) (<= 0 (+ ~side1_written~0 1)) (<= ~side2_written~0 0) (<= 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 [2021-11-25 20:43:38,503 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 20:43:38,503 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:43:38,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24 [2021-11-25 20:43:38,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542988829] [2021-11-25 20:43:38,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:43:38,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-25 20:43:38,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:43:38,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-25 20:43:38,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=882, Invalid=6258, Unknown=0, NotChecked=0, Total=7140 [2021-11-25 20:43:38,506 INFO L87 Difference]: Start difference. First operand 3206 states and 3788 transitions. Second operand has 24 states, 24 states have (on average 7.291666666666667) internal successors, (175), 24 states have internal predecessors, (175), 9 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (45), 9 states have call predecessors, (45), 9 states have call successors, (45) [2021-11-25 20:43:41,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:43:41,690 INFO L93 Difference]: Finished difference Result 7781 states and 9873 transitions. [2021-11-25 20:43:41,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-25 20:43:41,690 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.291666666666667) internal successors, (175), 24 states have internal predecessors, (175), 9 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (45), 9 states have call predecessors, (45), 9 states have call successors, (45) Word has length 137 [2021-11-25 20:43:41,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:43:41,708 INFO L225 Difference]: With dead ends: 7781 [2021-11-25 20:43:41,708 INFO L226 Difference]: Without dead ends: 4782 [2021-11-25 20:43:41,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 328 SyntacticMatches, 10 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4676 ImplicationChecksByTransitivity, 49.4s TimeCoverageRelationStatistics Valid=1177, Invalid=9535, Unknown=0, NotChecked=0, Total=10712 [2021-11-25 20:43:41,716 INFO L933 BasicCegarLoop]: 315 mSDtfsCounter, 1838 mSDsluCounter, 2427 mSDsCounter, 0 mSdLazyCounter, 1803 mSolverCounterSat, 1109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1838 SdHoareTripleChecker+Valid, 2702 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1109 IncrementalHoareTripleChecker+Valid, 1803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-25 20:43:41,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1838 Valid, 2702 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1109 Valid, 1803 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-25 20:43:41,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4782 states. [2021-11-25 20:43:42,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4782 to 3225. [2021-11-25 20:43:42,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3225 states, 2352 states have (on average 1.1700680272108843) internal successors, (2752), 2381 states have internal predecessors, (2752), 529 states have call successors, (529), 343 states have call predecessors, (529), 343 states have return successors, (529), 500 states have call predecessors, (529), 529 states have call successors, (529) [2021-11-25 20:43:42,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3225 states to 3225 states and 3810 transitions. [2021-11-25 20:43:42,145 INFO L78 Accepts]: Start accepts. Automaton has 3225 states and 3810 transitions. Word has length 137 [2021-11-25 20:43:42,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:43:42,146 INFO L470 AbstractCegarLoop]: Abstraction has 3225 states and 3810 transitions. [2021-11-25 20:43:42,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.291666666666667) internal successors, (175), 24 states have internal predecessors, (175), 9 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (45), 9 states have call predecessors, (45), 9 states have call successors, (45) [2021-11-25 20:43:42,147 INFO L276 IsEmpty]: Start isEmpty. Operand 3225 states and 3810 transitions. [2021-11-25 20:43:42,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-25 20:43:42,151 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:43:42,151 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:43:42,190 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-25 20:43:42,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:43:42,367 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 20:43:42,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:43:42,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1365456898, now seen corresponding path program 1 times [2021-11-25 20:43:42,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:43:42,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576154802] [2021-11-25 20:43:42,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:43:42,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:43:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-25 20:43:42,519 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-25 20:43:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-25 20:43:42,749 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-25 20:43:42,749 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-25 20:43:42,750 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-25 20:43:42,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-25 20:43:42,756 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:43:42,759 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-25 20:43:42,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:43:42 BoogieIcfgContainer [2021-11-25 20:43:42,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-25 20:43:42,955 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-25 20:43:42,955 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-25 20:43:42,956 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-25 20:43:42,956 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:37:45" (3/4) ... [2021-11-25 20:43:42,958 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-25 20:43:43,207 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/witness.graphml [2021-11-25 20:43:43,207 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-25 20:43:43,208 INFO L158 Benchmark]: Toolchain (without parser) took 359806.58ms. Allocated memory was 102.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 63.8MB in the beginning and 1.1GB in the end (delta: -993.7MB). Peak memory consumption was 437.9MB. Max. memory is 16.1GB. [2021-11-25 20:43:43,208 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 102.8MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 20:43:43,210 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.81ms. Allocated memory is still 102.8MB. Free memory was 63.6MB in the beginning and 75.4MB in the end (delta: -11.8MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2021-11-25 20:43:43,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.79ms. Allocated memory is still 102.8MB. Free memory was 75.4MB in the beginning and 72.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-25 20:43:43,213 INFO L158 Benchmark]: Boogie Preprocessor took 53.51ms. Allocated memory is still 102.8MB. Free memory was 72.2MB in the beginning and 69.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-25 20:43:43,213 INFO L158 Benchmark]: RCFGBuilder took 1113.31ms. Allocated memory is still 102.8MB. Free memory was 69.5MB in the beginning and 59.8MB in the end (delta: 9.7MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2021-11-25 20:43:43,218 INFO L158 Benchmark]: TraceAbstraction took 357920.79ms. Allocated memory was 102.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 59.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 395.7MB. Max. memory is 16.1GB. [2021-11-25 20:43:43,219 INFO L158 Benchmark]: Witness Printer took 251.87ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2021-11-25 20:43:43,223 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.29ms. Allocated memory is still 102.8MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 397.81ms. Allocated memory is still 102.8MB. Free memory was 63.6MB in the beginning and 75.4MB in the end (delta: -11.8MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.79ms. Allocated memory is still 102.8MB. Free memory was 75.4MB in the beginning and 72.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.51ms. Allocated memory is still 102.8MB. Free memory was 72.2MB in the beginning and 69.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1113.31ms. Allocated memory is still 102.8MB. Free memory was 69.5MB in the beginning and 59.8MB in the end (delta: 9.7MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 357920.79ms. Allocated memory was 102.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 59.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 395.7MB. Max. memory is 16.1GB. * Witness Printer took 251.87ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. 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: 611]: 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 ; [L534] int c1 ; [L535] int i2 ; [L538] c1 = 0 [L539] side1Failed = __VERIFIER_nondet_bool() [L540] side2Failed = __VERIFIER_nondet_bool() [L541] side1_written = __VERIFIER_nondet_char() [L542] side2_written = __VERIFIER_nondet_char() [L543] side1Failed_History_0 = __VERIFIER_nondet_bool() [L544] side1Failed_History_1 = __VERIFIER_nondet_bool() [L545] side1Failed_History_2 = __VERIFIER_nondet_bool() [L546] side2Failed_History_0 = __VERIFIER_nondet_bool() [L547] side2Failed_History_1 = __VERIFIER_nondet_bool() [L548] side2Failed_History_2 = __VERIFIER_nondet_bool() [L549] active_side_History_0 = __VERIFIER_nondet_char() [L550] active_side_History_1 = __VERIFIER_nondet_char() [L551] active_side_History_2 = __VERIFIER_nondet_char() [L552] manual_selection_History_0 = __VERIFIER_nondet_char() [L553] manual_selection_History_1 = __VERIFIER_nondet_char() [L554] manual_selection_History_2 = __VERIFIER_nondet_char() [L555] 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); [L555] RET, EXPR init() [L555] i2 = init() [L556] 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) [L556] 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] [L557] cs1_old = nomsg [L558] cs1_new = nomsg [L559] cs2_old = nomsg [L560] cs2_new = nomsg [L561] s1s2_old = nomsg [L562] s1s2_new = nomsg [L563] s1s1_old = nomsg [L564] s1s1_new = nomsg [L565] s2s1_old = nomsg [L566] s2s1_new = nomsg [L567] s2s2_old = nomsg [L568] s2s2_new = nomsg [L569] s1p_old = nomsg [L570] s1p_new = nomsg [L571] s2p_old = nomsg [L572] s2p_new = nomsg [L573] 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] [L574] COND TRUE i2 < 10 [L576] 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 [L576] RET Console_task_each_pals_period() [L577] 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 TRUE \read(side1Failed) [L278] EXPR nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] EXPR nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] EXPR nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=0, manual_selection_History_0=127, 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=1, side1Failed_History_0=1, 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] [L577] RET Side1_activestandby_task_each_pals_period() [L578] 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, 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=1, side1Failed_History_0=1, 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 )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=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=1, side1Failed_History_0=1, 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L578] RET Side2_activestandby_task_each_pals_period() [L579] 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, index=0, manual_selection_History_0=127, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, 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 [L394] COND FALSE !((int )side1 == 1) [L397] COND FALSE !((int )side2 == 1) [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 [L409] 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 [L409] RET write_active_side_history(active_side) [L579] RET Pendulum_prism_task_each_pals_period() [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L596] CALL, EXPR check() [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] int8_t tmp___20 ; [L439] COND FALSE !(! side1Failed) [L442] COND TRUE ! side2Failed [L443] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L447] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) [L447] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L448] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L450] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L450] tmp___1 = read_side1_failed_history((unsigned char)1) [L451] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L452] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, 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=-255, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=0, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L452] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)0)=-255, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L452] tmp___2 = read_side1_failed_history((unsigned char)0) [L453] COND FALSE !(! 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [L478] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L478] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND FALSE !(\read(tmp___7)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [L494] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L494] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [L494] tmp___11 = read_side1_failed_history((unsigned char)1) [L495] COND TRUE ! tmp___11 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [L496] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L496] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [L496] tmp___12 = read_side2_failed_history((unsigned char)1) [L497] COND FALSE !(\read(tmp___12)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [L510] CALL, EXPR read_active_side_history((unsigned char)2) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND FALSE !((int )index == 0) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=2, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L151] COND FALSE !((int )index == 1) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=2, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L154] COND TRUE (int )index == 2 [L155] return (active_side_History_2); VAL [\old(index)=2, \result=-2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=2, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L510] RET, EXPR read_active_side_history((unsigned char)2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)2)=-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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [L510] tmp___20 = read_active_side_history((unsigned char)2) [L511] COND FALSE !((int )tmp___20 > -2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L529] return (1); VAL [\result=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L596] RET, EXPR check() [L596] c1 = check() [L597] CALL assert(c1) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L609] COND FALSE !(! arg) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=1, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L597] RET assert(c1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, i2=0, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L598] i2 ++ VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, i2=1, manual_selection_History_0=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L574] COND TRUE i2 < 10 [L576] 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 [L576] RET Console_task_each_pals_period() [L577] 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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=127, manual_selection=127, manual_selection_History_0=127, manual_selection_History_1=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L290] COND FALSE !((int )side1 == (int )side2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=127, manual_selection=127, manual_selection_History_0=127, manual_selection_History_1=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L293] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=127, manual_selection=127, manual_selection_History_0=127, manual_selection_History_1=127, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L294] COND TRUE (int )side2 != (int )nomsg [L295] next_state = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=127, manual_selection=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, next_state=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=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=127, manual_selection=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L577] RET Side1_activestandby_task_each_pals_period() [L578] 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 TRUE \read(side2Failed) [L335] EXPR nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new [L335] s2s1_new = nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new [L336] EXPR nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new [L336] s2s2_new = nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new [L337] EXPR nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new [L337] s2p_new = nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new [L338] side2_written = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=127, manual_selection=0, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L578] RET Side2_activestandby_task_each_pals_period() [L579] 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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=127, index=0, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=0, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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 [L394] COND FALSE !((int )side1 == 1) [L397] COND FALSE !((int )side2 == 1) [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 [L409] 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 [L409] RET write_active_side_history(active_side) [L579] RET Pendulum_prism_task_each_pals_period() [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L596] CALL, EXPR check() [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] int8_t tmp___20 ; [L439] COND TRUE ! side1Failed [L440] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L447] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) [L447] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=127, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L448] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=127, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] COND FALSE !(! tmp___0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127] [L478] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=-255, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L478] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=-255, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND TRUE \read(tmp___7) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___7=1] [L480] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L480] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___7=1] [L480] tmp___8 = read_side2_failed_history((unsigned char)1) [L481] COND TRUE ! tmp___8 VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___7=1, tmp___8=0] [L482] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=0, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L482] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___7=1, tmp___8=0] [L482] tmp___5 = read_active_side_history((unsigned char)0) [L483] COND TRUE ! ((int )tmp___5 == 2) [L484] return (0); VAL [\result=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___5=0, tmp___7=1, tmp___8=0] [L596] RET, EXPR check() [L596] c1 = check() [L597] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L609] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L611] reach_error() VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 357.6s, OverallIterations: 32, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 24.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10312 SdHoareTripleChecker+Valid, 14.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9963 mSDsluCounter, 57781 SdHoareTripleChecker+Invalid, 12.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51005 mSDsCounter, 3178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16766 IncrementalHoareTripleChecker+Invalid, 19944 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3178 mSolverCounterUnsat, 9112 mSDtfsCounter, 16766 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2783 GetRequests, 2024 SyntacticMatches, 69 SemanticMatches, 690 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20294 ImplicationChecksByTransitivity, 173.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3225occurred in iteration=31, InterpolantAutomatonStates: 286, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 14152 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 3621 NumberOfCodeBlocks, 3621 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 4090 ConstructedInterpolants, 0 QuantifiedInterpolants, 13780 SizeOfPredicates, 88 NumberOfNonLiveVariables, 5347 ConjunctsInSsa, 175 ConjunctsInUnsatCore, 47 InterpolantComputations, 25 PerfectInterpolantSequences, 1976/2096 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-25 20:43:43,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d3f779a-015c-4e14-b1bb-e5e6ab9927aa/bin/utaipan-eEHZpOm5b7/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