./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/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_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a30aa210ed4a7c8ee647a70aef136aef282e5eccb07388ecda6495e33bc30b6d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 09:32:53,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 09:32:53,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 09:32:53,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 09:32:53,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 09:32:53,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 09:32:53,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 09:32:53,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 09:32:53,187 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 09:32:53,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 09:32:53,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 09:32:53,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 09:32:53,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 09:32:53,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 09:32:53,196 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 09:32:53,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 09:32:53,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 09:32:53,200 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 09:32:53,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 09:32:53,205 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 09:32:53,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 09:32:53,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 09:32:53,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 09:32:53,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 09:32:53,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 09:32:53,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 09:32:53,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 09:32:53,221 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 09:32:53,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 09:32:53,223 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 09:32:53,223 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 09:32:53,224 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 09:32:53,225 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 09:32:53,226 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 09:32:53,227 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 09:32:53,227 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 09:32:53,228 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 09:32:53,228 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 09:32:53,228 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 09:32:53,229 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 09:32:53,230 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 09:32:53,231 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 09:32:53,256 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 09:32:53,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 09:32:53,257 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 09:32:53,257 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 09:32:53,258 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 09:32:53,258 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 09:32:53,258 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 09:32:53,258 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 09:32:53,258 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 09:32:53,259 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 09:32:53,259 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 09:32:53,259 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 09:32:53,259 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 09:32:53,259 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 09:32:53,260 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 09:32:53,260 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 09:32:53,260 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 09:32:53,260 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 09:32:53,261 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 09:32:53,261 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 09:32:53,261 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 09:32:53,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 09:32:53,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 09:32:53,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 09:32:53,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 09:32:53,262 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 09:32:53,262 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 09:32:53,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 09:32:53,263 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 09:32:53,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 09:32:53,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 09:32:53,263 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 09:32:53,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:32:53,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 09:32:53,264 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 09:32:53,264 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 09:32:53,264 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 09:32:53,264 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 09:32:53,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 09:32:53,265 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 09:32:53,265 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 09:32:53,265 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a30aa210ed4a7c8ee647a70aef136aef282e5eccb07388ecda6495e33bc30b6d [2022-12-14 09:32:53,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 09:32:53,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 09:32:53,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 09:32:53,457 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 09:32:53,457 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 09:32:53,458 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2022-12-14 09:32:56,085 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 09:32:56,294 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 09:32:56,295 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2022-12-14 09:32:56,304 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/data/d278d32fa/a067b188e0e1452a9c17771edce474f6/FLAGf460f997b [2022-12-14 09:32:56,316 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/data/d278d32fa/a067b188e0e1452a9c17771edce474f6 [2022-12-14 09:32:56,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 09:32:56,319 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 09:32:56,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 09:32:56,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 09:32:56,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 09:32:56,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:32:56" (1/1) ... [2022-12-14 09:32:56,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33b7208f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:32:56, skipping insertion in model container [2022-12-14 09:32:56,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:32:56" (1/1) ... [2022-12-14 09:32:56,329 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 09:32:56,361 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 09:32:56,550 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c[14540,14553] [2022-12-14 09:32:56,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:32:56,565 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 09:32:56,606 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c[14540,14553] [2022-12-14 09:32:56,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:32:56,618 INFO L208 MainTranslator]: Completed translation [2022-12-14 09:32:56,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:32:56 WrapperNode [2022-12-14 09:32:56,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 09:32:56,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 09:32:56,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 09:32:56,619 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 09:32:56,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:32:56" (1/1) ... [2022-12-14 09:32:56,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:32:56" (1/1) ... [2022-12-14 09:32:56,655 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 477 [2022-12-14 09:32:56,655 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 09:32:56,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 09:32:56,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 09:32:56,656 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 09:32:56,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:32:56" (1/1) ... [2022-12-14 09:32:56,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:32:56" (1/1) ... [2022-12-14 09:32:56,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:32:56" (1/1) ... [2022-12-14 09:32:56,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:32:56" (1/1) ... [2022-12-14 09:32:56,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:32:56" (1/1) ... [2022-12-14 09:32:56,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:32:56" (1/1) ... [2022-12-14 09:32:56,677 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:32:56" (1/1) ... [2022-12-14 09:32:56,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:32:56" (1/1) ... [2022-12-14 09:32:56,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 09:32:56,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 09:32:56,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 09:32:56,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 09:32:56,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:32:56" (1/1) ... [2022-12-14 09:32:56,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:32:56,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:32:56,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 09:32:56,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 09:32:56,740 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2022-12-14 09:32:56,740 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2022-12-14 09:32:56,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 09:32:56,740 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2022-12-14 09:32:56,740 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2022-12-14 09:32:56,741 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-12-14 09:32:56,741 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-12-14 09:32:56,741 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2022-12-14 09:32:56,741 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2022-12-14 09:32:56,741 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-14 09:32:56,741 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-14 09:32:56,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 09:32:56,741 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2022-12-14 09:32:56,741 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2022-12-14 09:32:56,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 09:32:56,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 09:32:56,741 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2022-12-14 09:32:56,741 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2022-12-14 09:32:56,830 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 09:32:56,832 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 09:32:57,235 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 09:32:57,325 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 09:32:57,325 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 09:32:57,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:32:57 BoogieIcfgContainer [2022-12-14 09:32:57,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 09:32:57,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 09:32:57,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 09:32:57,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 09:32:57,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 09:32:56" (1/3) ... [2022-12-14 09:32:57,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7593b139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:32:57, skipping insertion in model container [2022-12-14 09:32:57,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:32:56" (2/3) ... [2022-12-14 09:32:57,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7593b139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:32:57, skipping insertion in model container [2022-12-14 09:32:57,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:32:57" (3/3) ... [2022-12-14 09:32:57,333 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2022-12-14 09:32:57,347 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 09:32:57,347 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 09:32:57,383 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 09:32:57,388 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@79ef5b02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 09:32:57,388 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 09:32:57,391 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) [2022-12-14 09:32:57,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 09:32:57,397 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:32:57,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:32:57,398 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:32:57,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:32:57,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1859061150, now seen corresponding path program 1 times [2022-12-14 09:32:57,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:32:57,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696774590] [2022-12-14 09:32:57,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:32:57,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:32:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:32:57,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:32:57,724 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:32:57,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696774590] [2022-12-14 09:32:57,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696774590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:32:57,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:32:57,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:32:57,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051314125] [2022-12-14 09:32:57,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:32:57,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:32:57,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:32:57,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:32:57,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:32:57,755 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) [2022-12-14 09:32:57,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:32:57,862 INFO L93 Difference]: Finished difference Result 289 states and 469 transitions. [2022-12-14 09:32:57,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:32:57,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-12-14 09:32:57,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:32:57,873 INFO L225 Difference]: With dead ends: 289 [2022-12-14 09:32:57,873 INFO L226 Difference]: Without dead ends: 147 [2022-12-14 09:32:57,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:32:57,880 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 5 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:32:57,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 611 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:32:57,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-12-14 09:32:57,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2022-12-14 09:32:57,923 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) [2022-12-14 09:32:57,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 222 transitions. [2022-12-14 09:32:57,927 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 222 transitions. Word has length 19 [2022-12-14 09:32:57,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:32:57,928 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 222 transitions. [2022-12-14 09:32:57,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 09:32:57,928 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 222 transitions. [2022-12-14 09:32:57,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 09:32:57,930 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:32:57,930 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:32:57,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 09:32:57,930 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:32:57,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:32:57,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1188592738, now seen corresponding path program 1 times [2022-12-14 09:32:57,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:32:57,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969413424] [2022-12-14 09:32:57,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:32:57,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:32:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:32:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 09:32:58,121 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:32:58,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969413424] [2022-12-14 09:32:58,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969413424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:32:58,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:32:58,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:32:58,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933730103] [2022-12-14 09:32:58,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:32:58,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:32:58,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:32:58,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:32:58,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:32:58,133 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) [2022-12-14 09:32:58,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:32:58,192 INFO L93 Difference]: Finished difference Result 296 states and 447 transitions. [2022-12-14 09:32:58,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:32:58,193 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 [2022-12-14 09:32:58,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:32:58,194 INFO L225 Difference]: With dead ends: 296 [2022-12-14 09:32:58,194 INFO L226 Difference]: Without dead ends: 152 [2022-12-14 09:32:58,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:32:58,196 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 6 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:32:58,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 623 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:32:58,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-12-14 09:32:58,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-12-14 09:32:58,207 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) [2022-12-14 09:32:58,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 226 transitions. [2022-12-14 09:32:58,208 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 226 transitions. Word has length 28 [2022-12-14 09:32:58,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:32:58,209 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 226 transitions. [2022-12-14 09:32:58,209 INFO L496 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) [2022-12-14 09:32:58,209 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 226 transitions. [2022-12-14 09:32:58,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 09:32:58,210 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:32:58,210 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:32:58,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 09:32:58,210 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:32:58,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:32:58,211 INFO L85 PathProgramCache]: Analyzing trace with hash 156337993, now seen corresponding path program 1 times [2022-12-14 09:32:58,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:32:58,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627669484] [2022-12-14 09:32:58,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:32:58,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:32:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:32:58,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 09:32:58,336 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:32:58,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627669484] [2022-12-14 09:32:58,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627669484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:32:58,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:32:58,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:32:58,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429813885] [2022-12-14 09:32:58,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:32:58,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:32:58,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:32:58,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:32:58,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:32:58,339 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) [2022-12-14 09:32:58,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:32:58,400 INFO L93 Difference]: Finished difference Result 306 states and 458 transitions. [2022-12-14 09:32:58,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:32:58,400 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 [2022-12-14 09:32:58,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:32:58,402 INFO L225 Difference]: With dead ends: 306 [2022-12-14 09:32:58,402 INFO L226 Difference]: Without dead ends: 157 [2022-12-14 09:32:58,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:32:58,404 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 6 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:32:58,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 609 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:32:58,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-12-14 09:32:58,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-12-14 09:32:58,418 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) [2022-12-14 09:32:58,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 230 transitions. [2022-12-14 09:32:58,419 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 230 transitions. Word has length 36 [2022-12-14 09:32:58,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:32:58,420 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 230 transitions. [2022-12-14 09:32:58,420 INFO L496 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) [2022-12-14 09:32:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 230 transitions. [2022-12-14 09:32:58,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 09:32:58,421 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:32:58,421 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:32:58,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 09:32:58,422 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:32:58,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:32:58,422 INFO L85 PathProgramCache]: Analyzing trace with hash 864605813, now seen corresponding path program 1 times [2022-12-14 09:32:58,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:32:58,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909488351] [2022-12-14 09:32:58,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:32:58,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:32:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:32:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 09:32:58,591 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:32:58,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909488351] [2022-12-14 09:32:58,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909488351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:32:58,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:32:58,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:32:58,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087564605] [2022-12-14 09:32:58,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:32:58,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:32:58,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:32:58,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:32:58,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:32:58,594 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) [2022-12-14 09:32:58,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:32:58,650 INFO L93 Difference]: Finished difference Result 316 states and 466 transitions. [2022-12-14 09:32:58,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:32:58,651 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 [2022-12-14 09:32:58,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:32:58,653 INFO L225 Difference]: With dead ends: 316 [2022-12-14 09:32:58,653 INFO L226 Difference]: Without dead ends: 162 [2022-12-14 09:32:58,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:32:58,656 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 6 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:32:58,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 609 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:32:58,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-12-14 09:32:58,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-12-14 09:32:58,671 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) [2022-12-14 09:32:58,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2022-12-14 09:32:58,673 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 44 [2022-12-14 09:32:58,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:32:58,673 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2022-12-14 09:32:58,674 INFO L496 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) [2022-12-14 09:32:58,674 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2022-12-14 09:32:58,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 09:32:58,676 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:32:58,676 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:32:58,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 09:32:58,676 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:32:58,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:32:58,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1531853490, now seen corresponding path program 1 times [2022-12-14 09:32:58,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:32:58,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881370350] [2022-12-14 09:32:58,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:32:58,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:32:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:32:58,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 09:32:58,824 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:32:58,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881370350] [2022-12-14 09:32:58,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881370350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:32:58,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:32:58,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:32:58,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793141559] [2022-12-14 09:32:58,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:32:58,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:32:58,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:32:58,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:32:58,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:32:58,826 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) [2022-12-14 09:32:58,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:32:58,875 INFO L93 Difference]: Finished difference Result 325 states and 470 transitions. [2022-12-14 09:32:58,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:32:58,876 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 [2022-12-14 09:32:58,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:32:58,878 INFO L225 Difference]: With dead ends: 325 [2022-12-14 09:32:58,878 INFO L226 Difference]: Without dead ends: 166 [2022-12-14 09:32:58,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:32:58,880 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 5 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:32:58,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 618 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:32:58,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-12-14 09:32:58,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-12-14 09:32:58,893 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) [2022-12-14 09:32:58,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 237 transitions. [2022-12-14 09:32:58,895 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 237 transitions. Word has length 44 [2022-12-14 09:32:58,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:32:58,895 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 237 transitions. [2022-12-14 09:32:58,895 INFO L496 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) [2022-12-14 09:32:58,895 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 237 transitions. [2022-12-14 09:32:58,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-14 09:32:58,898 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:32:58,898 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:32:58,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 09:32:58,898 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:32:58,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:32:58,904 INFO L85 PathProgramCache]: Analyzing trace with hash 626983797, now seen corresponding path program 1 times [2022-12-14 09:32:58,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:32:58,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978477185] [2022-12-14 09:32:58,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:32:58,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:32:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:32:59,098 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 09:32:59,098 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:32:59,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978477185] [2022-12-14 09:32:59,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978477185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:32:59,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:32:59,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:32:59,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975528215] [2022-12-14 09:32:59,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:32:59,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:32:59,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:32:59,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:32:59,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:32:59,100 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) [2022-12-14 09:32:59,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:32:59,151 INFO L93 Difference]: Finished difference Result 335 states and 479 transitions. [2022-12-14 09:32:59,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:32:59,151 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 [2022-12-14 09:32:59,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:32:59,154 INFO L225 Difference]: With dead ends: 335 [2022-12-14 09:32:59,154 INFO L226 Difference]: Without dead ends: 172 [2022-12-14 09:32:59,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:32:59,156 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 7 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:32:59,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 620 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:32:59,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-12-14 09:32:59,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2022-12-14 09:32:59,167 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) [2022-12-14 09:32:59,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 242 transitions. [2022-12-14 09:32:59,168 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 242 transitions. Word has length 52 [2022-12-14 09:32:59,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:32:59,169 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 242 transitions. [2022-12-14 09:32:59,169 INFO L496 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) [2022-12-14 09:32:59,169 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 242 transitions. [2022-12-14 09:32:59,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-14 09:32:59,170 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:32:59,170 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:32:59,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 09:32:59,170 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:32:59,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:32:59,170 INFO L85 PathProgramCache]: Analyzing trace with hash 2125248318, now seen corresponding path program 1 times [2022-12-14 09:32:59,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:32:59,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896895508] [2022-12-14 09:32:59,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:32:59,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:32:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:32:59,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 09:32:59,458 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:32:59,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896895508] [2022-12-14 09:32:59,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896895508] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:32:59,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345058136] [2022-12-14 09:32:59,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:32:59,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:32:59,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:32:59,460 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:32:59,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 09:32:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:32:59,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 09:32:59,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:32:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 09:32:59,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:32:59,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345058136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:32:59,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 09:32:59,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2022-12-14 09:32:59,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70215987] [2022-12-14 09:32:59,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:32:59,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 09:32:59,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:32:59,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 09:32:59,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-12-14 09:32:59,728 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) [2022-12-14 09:32:59,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:32:59,992 INFO L93 Difference]: Finished difference Result 510 states and 710 transitions. [2022-12-14 09:32:59,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 09:32:59,993 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 [2022-12-14 09:32:59,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:32:59,995 INFO L225 Difference]: With dead ends: 510 [2022-12-14 09:32:59,995 INFO L226 Difference]: Without dead ends: 331 [2022-12-14 09:32:59,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-12-14 09:32:59,997 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 198 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:32:59,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1267 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 09:32:59,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-12-14 09:33:00,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2022-12-14 09:33:00,015 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) [2022-12-14 09:33:00,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 458 transitions. [2022-12-14 09:33:00,017 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 458 transitions. Word has length 55 [2022-12-14 09:33:00,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:33:00,018 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 458 transitions. [2022-12-14 09:33:00,018 INFO L496 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) [2022-12-14 09:33:00,018 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 458 transitions. [2022-12-14 09:33:00,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-14 09:33:00,019 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:33:00,019 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:33:00,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 09:33:00,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-14 09:33:00,221 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:33:00,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:33:00,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1660693667, now seen corresponding path program 1 times [2022-12-14 09:33:00,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:33:00,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267566896] [2022-12-14 09:33:00,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:00,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:33:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 09:33:00,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:33:00,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267566896] [2022-12-14 09:33:00,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267566896] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:33:00,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124400894] [2022-12-14 09:33:00,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:00,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:33:00,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:33:00,566 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:33:00,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 09:33:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:00,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 09:33:00,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:33:00,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:33:00,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:33:01,028 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 09:33:01,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124400894] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:33:01,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1642690766] [2022-12-14 09:33:01,046 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-12-14 09:33:01,046 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:33:01,050 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:33:01,055 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:33:01,055 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:33:02,940 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 123 for LOIs [2022-12-14 09:33:02,975 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 146 for LOIs [2022-12-14 09:33:02,992 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 94 for LOIs [2022-12-14 09:33:03,028 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:33:11,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1642690766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:33:11,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:33:11,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [9, 9, 9] total 35 [2022-12-14 09:33:11,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861554530] [2022-12-14 09:33:11,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:33:11,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 09:33:11,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:33:11,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 09:33:11,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1068, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 09:33:11,108 INFO L87 Difference]: Start difference. First operand 327 states and 458 transitions. Second operand has 24 states, 20 states have (on average 1.9) internal successors, (38), 16 states have internal predecessors, (38), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-12-14 09:33:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:33:16,971 INFO L93 Difference]: Finished difference Result 740 states and 1044 transitions. [2022-12-14 09:33:16,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 09:33:16,972 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 1.9) internal successors, (38), 16 states have internal predecessors, (38), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 57 [2022-12-14 09:33:16,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:33:16,976 INFO L225 Difference]: With dead ends: 740 [2022-12-14 09:33:16,976 INFO L226 Difference]: Without dead ends: 416 [2022-12-14 09:33:16,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 141 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=145, Invalid=1261, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 09:33:16,978 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 181 mSDsluCounter, 2666 mSDsCounter, 0 mSdLazyCounter, 1624 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 2942 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:33:16,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 2942 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1624 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-12-14 09:33:16,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-12-14 09:33:17,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 393. [2022-12-14 09:33:17,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 287 states have (on average 1.386759581881533) internal successors, (398), 288 states have internal predecessors, (398), 75 states have call successors, (75), 30 states have call predecessors, (75), 30 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2022-12-14 09:33:17,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 548 transitions. [2022-12-14 09:33:17,025 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 548 transitions. Word has length 57 [2022-12-14 09:33:17,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:33:17,025 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 548 transitions. [2022-12-14 09:33:17,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 1.9) internal successors, (38), 16 states have internal predecessors, (38), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-12-14 09:33:17,025 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 548 transitions. [2022-12-14 09:33:17,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-14 09:33:17,026 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:33:17,026 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:33:17,031 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 09:33:17,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:33:17,227 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:33:17,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:33:17,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1127392381, now seen corresponding path program 1 times [2022-12-14 09:33:17,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:33:17,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018557098] [2022-12-14 09:33:17,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:17,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:33:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:17,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 09:33:17,531 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:33:17,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018557098] [2022-12-14 09:33:17,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018557098] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:33:17,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182705960] [2022-12-14 09:33:17,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:17,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:33:17,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:33:17,532 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:33:17,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 09:33:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:17,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 09:33:17,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:33:17,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:33:17,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:33:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 09:33:17,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182705960] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:33:17,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1600257624] [2022-12-14 09:33:17,923 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-12-14 09:33:17,923 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:33:17,924 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:33:17,924 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:33:17,924 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:33:19,776 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 123 for LOIs [2022-12-14 09:33:19,798 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 145 for LOIs [2022-12-14 09:33:19,814 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 148 for LOIs [2022-12-14 09:33:19,856 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:33:30,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1600257624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:33:30,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:33:30,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [9, 9, 9] total 34 [2022-12-14 09:33:30,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767376529] [2022-12-14 09:33:30,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:33:30,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 09:33:30,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:33:30,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 09:33:30,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 09:33:30,376 INFO L87 Difference]: Start difference. First operand 393 states and 548 transitions. Second operand has 23 states, 20 states have (on average 1.9) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 09:33:34,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:33:34,015 INFO L93 Difference]: Finished difference Result 813 states and 1151 transitions. [2022-12-14 09:33:34,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 09:33:34,016 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 1.9) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 57 [2022-12-14 09:33:34,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:33:34,018 INFO L225 Difference]: With dead ends: 813 [2022-12-14 09:33:34,018 INFO L226 Difference]: Without dead ends: 489 [2022-12-14 09:33:34,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 141 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=160, Invalid=1030, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 09:33:34,019 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 139 mSDsluCounter, 2130 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 2422 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-12-14 09:33:34,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 2422 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-12-14 09:33:34,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2022-12-14 09:33:34,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 457. [2022-12-14 09:33:34,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 333 states have (on average 1.3723723723723724) internal successors, (457), 334 states have internal predecessors, (457), 90 states have call successors, (90), 33 states have call predecessors, (90), 33 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2022-12-14 09:33:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 637 transitions. [2022-12-14 09:33:34,068 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 637 transitions. Word has length 57 [2022-12-14 09:33:34,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:33:34,068 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 637 transitions. [2022-12-14 09:33:34,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 1.9) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 09:33:34,068 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 637 transitions. [2022-12-14 09:33:34,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-14 09:33:34,069 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:33:34,069 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:33:34,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 09:33:34,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-14 09:33:34,270 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:33:34,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:33:34,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1685793880, now seen corresponding path program 1 times [2022-12-14 09:33:34,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:33:34,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784982282] [2022-12-14 09:33:34,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:34,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:33:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 09:33:34,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:33:34,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784982282] [2022-12-14 09:33:34,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784982282] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:33:34,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394337157] [2022-12-14 09:33:34,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:34,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:33:34,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:33:34,508 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:33:34,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 09:33:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:34,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 09:33:34,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:33:34,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:33:34,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:33:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 09:33:34,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394337157] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:33:34,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1018938282] [2022-12-14 09:33:34,848 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2022-12-14 09:33:34,848 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:33:34,849 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:33:34,849 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:33:34,849 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:33:36,018 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 125 for LOIs [2022-12-14 09:33:36,038 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 146 for LOIs [2022-12-14 09:33:36,054 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 93 for LOIs [2022-12-14 09:33:36,092 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:33:46,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1018938282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:33:46,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:33:46,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [9, 9, 9] total 37 [2022-12-14 09:33:46,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827435579] [2022-12-14 09:33:46,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:33:46,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 09:33:46,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:33:46,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 09:33:46,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1178, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 09:33:46,089 INFO L87 Difference]: Start difference. First operand 457 states and 637 transitions. Second operand has 26 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 18 states have internal predecessors, (40), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-12-14 09:33:52,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:33:52,183 INFO L93 Difference]: Finished difference Result 866 states and 1221 transitions. [2022-12-14 09:33:52,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 09:33:52,184 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 18 states have internal predecessors, (40), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-12-14 09:33:52,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:33:52,186 INFO L225 Difference]: With dead ends: 866 [2022-12-14 09:33:52,186 INFO L226 Difference]: Without dead ends: 542 [2022-12-14 09:33:52,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 145 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=181, Invalid=1379, Unknown=0, NotChecked=0, Total=1560 [2022-12-14 09:33:52,187 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 129 mSDsluCounter, 3036 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 3344 SdHoareTripleChecker+Invalid, 1969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-12-14 09:33:52,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 3344 Invalid, 1969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-12-14 09:33:52,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-12-14 09:33:52,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 493. [2022-12-14 09:33:52,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 359 states have (on average 1.3565459610027855) internal successors, (487), 360 states have internal predecessors, (487), 97 states have call successors, (97), 36 states have call predecessors, (97), 36 states have return successors, (97), 96 states have call predecessors, (97), 97 states have call successors, (97) [2022-12-14 09:33:52,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 681 transitions. [2022-12-14 09:33:52,252 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 681 transitions. Word has length 59 [2022-12-14 09:33:52,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:33:52,252 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 681 transitions. [2022-12-14 09:33:52,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 18 states have internal predecessors, (40), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-12-14 09:33:52,252 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 681 transitions. [2022-12-14 09:33:52,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-14 09:33:52,253 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:33:52,253 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:33:52,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 09:33:52,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 09:33:52,455 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:33:52,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:33:52,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1278092955, now seen corresponding path program 1 times [2022-12-14 09:33:52,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:33:52,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284875261] [2022-12-14 09:33:52,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:52,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:33:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 09:33:52,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:33:52,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284875261] [2022-12-14 09:33:52,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284875261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:33:52,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:33:52,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:33:52,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096939517] [2022-12-14 09:33:52,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:33:52,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:33:52,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:33:52,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:33:52,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:33:52,547 INFO L87 Difference]: Start difference. First operand 493 states and 681 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) [2022-12-14 09:33:52,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:33:52,660 INFO L93 Difference]: Finished difference Result 893 states and 1255 transitions. [2022-12-14 09:33:52,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:33:52,661 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 [2022-12-14 09:33:52,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:33:52,663 INFO L225 Difference]: With dead ends: 893 [2022-12-14 09:33:52,664 INFO L226 Difference]: Without dead ends: 501 [2022-12-14 09:33:52,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:33:52,665 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 5 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:33:52,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 618 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:33:52,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-12-14 09:33:52,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2022-12-14 09:33:52,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 365 states have (on average 1.3506849315068492) internal successors, (493), 366 states have internal predecessors, (493), 97 states have call successors, (97), 38 states have call predecessors, (97), 38 states have return successors, (97), 96 states have call predecessors, (97), 97 states have call successors, (97) [2022-12-14 09:33:52,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 687 transitions. [2022-12-14 09:33:52,728 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 687 transitions. Word has length 61 [2022-12-14 09:33:52,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:33:52,729 INFO L495 AbstractCegarLoop]: Abstraction has 501 states and 687 transitions. [2022-12-14 09:33:52,729 INFO L496 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) [2022-12-14 09:33:52,729 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 687 transitions. [2022-12-14 09:33:52,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-14 09:33:52,730 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:33:52,730 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:33:52,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 09:33:52,730 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:33:52,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:33:52,730 INFO L85 PathProgramCache]: Analyzing trace with hash 884670323, now seen corresponding path program 1 times [2022-12-14 09:33:52,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:33:52,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381549140] [2022-12-14 09:33:52,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:52,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:33:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:52,940 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 09:33:52,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:33:52,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381549140] [2022-12-14 09:33:52,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381549140] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:33:52,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732812973] [2022-12-14 09:33:52,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:52,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:33:52,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:33:52,942 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:33:52,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 09:33:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:53,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 09:33:53,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:33:53,180 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:33:53,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:33:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 09:33:53,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732812973] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:33:53,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1475956199] [2022-12-14 09:33:53,287 INFO L159 IcfgInterpreter]: Started Sifa with 55 locations of interest [2022-12-14 09:33:53,287 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:33:53,287 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:33:53,287 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:33:53,287 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:33:55,954 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 231 for LOIs [2022-12-14 09:33:56,168 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 146 for LOIs [2022-12-14 09:33:56,184 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 192 for LOIs [2022-12-14 09:33:56,304 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 154 for LOIs [2022-12-14 09:33:56,361 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 151 for LOIs [2022-12-14 09:33:56,436 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 148 for LOIs [2022-12-14 09:33:56,511 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:34:27,571 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13533#(and (<= 0 (+ ~manual_selection_History_0~0 128)) (= ~s1p_old~0 (ite (<= (mod ~nomsg~0 256) 127) (mod ~nomsg~0 256) (+ (- 256) (mod ~nomsg~0 256)))) (not (= (mod ~side1Failed~0 256) 0)) (<= 0 (+ 2 ~active_side_History_1~0)) (= ~s1p~0 0) (= ~cs1~0 0) (= ~s2s1~0 0) (<= (+ ~s1p_new~0 1) 0) (<= ~manual_selection_History_0~0 127) (= ~manual_selection_History_1~0 0) (= |assert_#in~arg| 0) (= (ite (<= (mod (ite (not (= ~nomsg~0 ~manual_selection_History_0~0)) ~manual_selection_History_0~0 ~nomsg~0) 256) 127) (mod (ite (not (= ~nomsg~0 ~manual_selection_History_0~0)) ~manual_selection_History_0~0 ~nomsg~0) 256) (+ (mod (ite (not (= ~nomsg~0 ~manual_selection_History_0~0)) ~manual_selection_History_0~0 ~nomsg~0) 256) (- 256))) ~cs2_old~0) (= ~s1s1~0 0) (= ~s1s2_old~0 (ite (<= (mod ~nomsg~0 256) 127) (mod ~nomsg~0 256) (+ (- 256) (mod ~nomsg~0 256)))) (= ~nomsg~0 ~s1s1_new~0) (= ~nomsg~0 ~s2s1_new~0) (= assert_~arg |assert_#in~arg|) (not (= (mod ~side1Failed_History_1~0 256) 0)) (= ~s2s2~0 0) (= ~side2Failed~0 ~side2Failed_History_0~0) (<= 0 (+ ~s1p_new~0 1)) (<= (+ 2 ~active_side_History_2~0) 0) (<= 0 ~manual_selection_History_2~0) (= (mod ~side2Failed_History_1~0 256) 0) (= ~side2_written~0 0) (= ~s1s2~0 0) (= (mod ~side2Failed~0 256) 0) (= ~nomsg~0 ~s2p_new~0) (= ~s2p_old~0 (ite (<= (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256) 127) (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256) (+ (- 256) (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256)))) (<= (+ 2 ~active_side_History_1~0) 0) (= ~side1Failed_History_0~0 ~side1Failed~0) (= (ite (<= (mod (ite (not (= ~nomsg~0 ~manual_selection_History_0~0)) ~manual_selection_History_0~0 ~nomsg~0) 256) 127) (mod (ite (not (= ~nomsg~0 ~manual_selection_History_0~0)) ~manual_selection_History_0~0 ~nomsg~0) 256) (+ (mod (ite (not (= ~nomsg~0 ~manual_selection_History_0~0)) ~manual_selection_History_0~0 ~nomsg~0) 256) (- 256))) ~cs1_old~0) (= |#NULL.offset| 0) (<= 0 (+ 2 ~active_side_History_2~0)) (= ~s1s1_old~0 (ite (<= (mod ~nomsg~0 256) 127) (mod ~nomsg~0 256) (+ (- 256) (mod ~nomsg~0 256)))) (<= ~manual_selection_History_2~0 0) (= ~nomsg~0 ~cs1_new~0) (= ~active_side_History_0~0 0) (<= 0 (+ ~side1_written~0 1)) (= ~nomsg~0 ~s2s2_new~0) (= (ite (<= (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256) 127) (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256) (+ (- 256) (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256))) ~s2s1_old~0) (= ~nomsg~0 ~cs2_new~0) (= ~s2s2_old~0 (ite (<= (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256) 127) (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256) (+ (- 256) (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256)))) (<= 0 (+ ~cs2_new~0 1)) (= ~cs2~0 0) (<= (+ ~side1_written~0 1) 0) (= ~nomsg~0 ~s1s2_new~0) (<= 0 |#StackHeapBarrier|) (= ~s2p~0 0) (<= (+ ~s1s1_new~0 1) 0) (= |#NULL.base| 0))' at error location [2022-12-14 09:34:27,571 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:34:27,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:34:27,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-12-14 09:34:27,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443389268] [2022-12-14 09:34:27,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:34:27,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 09:34:27,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:34:27,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 09:34:27,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=2503, Unknown=0, NotChecked=0, Total=2756 [2022-12-14 09:34:27,573 INFO L87 Difference]: Start difference. First operand 501 states and 687 transitions. Second operand has 13 states, 9 states have (on average 7.777777777777778) internal successors, (70), 12 states have internal predecessors, (70), 4 states have call successors, (17), 3 states have call predecessors, (17), 8 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-12-14 09:34:28,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:34:28,079 INFO L93 Difference]: Finished difference Result 1221 states and 1699 transitions. [2022-12-14 09:34:28,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 09:34:28,079 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 7.777777777777778) internal successors, (70), 12 states have internal predecessors, (70), 4 states have call successors, (17), 3 states have call predecessors, (17), 8 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 65 [2022-12-14 09:34:28,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:34:28,082 INFO L225 Difference]: With dead ends: 1221 [2022-12-14 09:34:28,082 INFO L226 Difference]: Without dead ends: 837 [2022-12-14 09:34:28,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 140 SyntacticMatches, 12 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=277, Invalid=3029, Unknown=0, NotChecked=0, Total=3306 [2022-12-14 09:34:28,083 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 296 mSDsluCounter, 3063 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 3396 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 09:34:28,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 3396 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 09:34:28,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2022-12-14 09:34:28,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 529. [2022-12-14 09:34:28,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 386 states have (on average 1.3160621761658031) internal successors, (508), 389 states have internal predecessors, (508), 95 states have call successors, (95), 47 states have call predecessors, (95), 47 states have return successors, (95), 92 states have call predecessors, (95), 95 states have call successors, (95) [2022-12-14 09:34:28,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 698 transitions. [2022-12-14 09:34:28,152 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 698 transitions. Word has length 65 [2022-12-14 09:34:28,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:34:28,152 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 698 transitions. [2022-12-14 09:34:28,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 7.777777777777778) internal successors, (70), 12 states have internal predecessors, (70), 4 states have call successors, (17), 3 states have call predecessors, (17), 8 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-12-14 09:34:28,152 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 698 transitions. [2022-12-14 09:34:28,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-14 09:34:28,153 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:34:28,153 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:34:28,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 09:34:28,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:34:28,354 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:34:28,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:34:28,354 INFO L85 PathProgramCache]: Analyzing trace with hash 848130119, now seen corresponding path program 1 times [2022-12-14 09:34:28,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:34:28,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642818018] [2022-12-14 09:34:28,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:34:28,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:34:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:34:28,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 09:34:28,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:34:28,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642818018] [2022-12-14 09:34:28,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642818018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:34:28,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:34:28,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 09:34:28,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135755833] [2022-12-14 09:34:28,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:34:28,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 09:34:28,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:34:28,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 09:34:28,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 09:34:28,548 INFO L87 Difference]: Start difference. First operand 529 states and 698 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) [2022-12-14 09:34:29,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:34:29,159 INFO L93 Difference]: Finished difference Result 1167 states and 1611 transitions. [2022-12-14 09:34:29,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 09:34:29,159 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 [2022-12-14 09:34:29,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:34:29,163 INFO L225 Difference]: With dead ends: 1167 [2022-12-14 09:34:29,163 INFO L226 Difference]: Without dead ends: 861 [2022-12-14 09:34:29,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-12-14 09:34:29,165 INFO L413 NwaCegarLoop]: 397 mSDtfsCounter, 527 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 09:34:29,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1810 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 09:34:29,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2022-12-14 09:34:29,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 657. [2022-12-14 09:34:29,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 477 states have (on average 1.3123689727463312) internal successors, (626), 480 states have internal predecessors, (626), 119 states have call successors, (119), 60 states have call predecessors, (119), 60 states have return successors, (119), 116 states have call predecessors, (119), 119 states have call successors, (119) [2022-12-14 09:34:29,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 864 transitions. [2022-12-14 09:34:29,286 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 864 transitions. Word has length 66 [2022-12-14 09:34:29,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:34:29,286 INFO L495 AbstractCegarLoop]: Abstraction has 657 states and 864 transitions. [2022-12-14 09:34:29,286 INFO L496 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) [2022-12-14 09:34:29,286 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 864 transitions. [2022-12-14 09:34:29,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-14 09:34:29,288 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:34:29,288 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:34:29,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 09:34:29,288 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:34:29,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:34:29,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1710487076, now seen corresponding path program 1 times [2022-12-14 09:34:29,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:34:29,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199847278] [2022-12-14 09:34:29,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:34:29,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:34:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:34:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 09:34:29,468 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:34:29,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199847278] [2022-12-14 09:34:29,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199847278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:34:29,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:34:29,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 09:34:29,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901278998] [2022-12-14 09:34:29,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:34:29,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 09:34:29,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:34:29,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 09:34:29,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 09:34:29,470 INFO L87 Difference]: Start difference. First operand 657 states and 864 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) [2022-12-14 09:34:30,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:34:30,169 INFO L93 Difference]: Finished difference Result 1524 states and 2101 transitions. [2022-12-14 09:34:30,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 09:34:30,170 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 [2022-12-14 09:34:30,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:34:30,179 INFO L225 Difference]: With dead ends: 1524 [2022-12-14 09:34:30,179 INFO L226 Difference]: Without dead ends: 1194 [2022-12-14 09:34:30,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-12-14 09:34:30,181 INFO L413 NwaCegarLoop]: 481 mSDtfsCounter, 578 mSDsluCounter, 1693 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 2174 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 09:34:30,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 2174 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 09:34:30,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2022-12-14 09:34:30,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 919. [2022-12-14 09:34:30,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 664 states have (on average 1.3207831325301205) internal successors, (877), 669 states have internal predecessors, (877), 169 states have call successors, (169), 85 states have call predecessors, (169), 85 states have return successors, (169), 164 states have call predecessors, (169), 169 states have call successors, (169) [2022-12-14 09:34:30,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1215 transitions. [2022-12-14 09:34:30,325 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1215 transitions. Word has length 68 [2022-12-14 09:34:30,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:34:30,325 INFO L495 AbstractCegarLoop]: Abstraction has 919 states and 1215 transitions. [2022-12-14 09:34:30,326 INFO L496 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) [2022-12-14 09:34:30,326 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1215 transitions. [2022-12-14 09:34:30,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-14 09:34:30,326 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:34:30,326 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-14 09:34:30,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 09:34:30,327 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:34:30,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:34:30,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1648066435, now seen corresponding path program 1 times [2022-12-14 09:34:30,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:34:30,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375623650] [2022-12-14 09:34:30,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:34:30,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:34:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:34:30,535 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 09:34:30,535 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:34:30,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375623650] [2022-12-14 09:34:30,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375623650] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:34:30,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845484371] [2022-12-14 09:34:30,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:34:30,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:34:30,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:34:30,537 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:34:30,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 09:34:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:34:30,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 09:34:30,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:34:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:34:30,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:34:30,795 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 09:34:30,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845484371] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:34:30,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [511260962] [2022-12-14 09:34:30,797 INFO L159 IcfgInterpreter]: Started Sifa with 58 locations of interest [2022-12-14 09:34:30,797 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:34:30,798 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:34:30,798 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:34:30,798 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:34:33,754 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 123 for LOIs [2022-12-14 09:34:33,776 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 145 for LOIs [2022-12-14 09:34:33,792 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 92 for LOIs [2022-12-14 09:34:33,865 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 148 for LOIs [2022-12-14 09:34:33,908 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:34:53,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [511260962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:34:53,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:34:53,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [8, 9, 9] total 45 [2022-12-14 09:34:53,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213006755] [2022-12-14 09:34:53,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:34:53,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 09:34:53,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:34:53,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 09:34:53,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1801, Unknown=0, NotChecked=0, Total=1980 [2022-12-14 09:34:53,141 INFO L87 Difference]: Start difference. First operand 919 states and 1215 transitions. Second operand has 34 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 23 states have internal predecessors, (43), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2022-12-14 09:34:58,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:34:58,374 INFO L93 Difference]: Finished difference Result 1488 states and 1984 transitions. [2022-12-14 09:34:58,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-14 09:34:58,375 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 23 states have internal predecessors, (43), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) Word has length 72 [2022-12-14 09:34:58,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:34:58,377 INFO L225 Difference]: With dead ends: 1488 [2022-12-14 09:34:58,377 INFO L226 Difference]: Without dead ends: 905 [2022-12-14 09:34:58,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 170 SyntacticMatches, 12 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=196, Invalid=1966, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 09:34:58,379 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 68 mSDsluCounter, 2521 mSDsCounter, 0 mSdLazyCounter, 2249 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 2718 SdHoareTripleChecker+Invalid, 2264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:34:58,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 2718 Invalid, 2264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2249 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-12-14 09:34:58,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2022-12-14 09:34:58,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 905. [2022-12-14 09:34:58,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 654 states have (on average 1.319571865443425) internal successors, (863), 659 states have internal predecessors, (863), 166 states have call successors, (166), 84 states have call predecessors, (166), 84 states have return successors, (166), 161 states have call predecessors, (166), 166 states have call successors, (166) [2022-12-14 09:34:58,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1195 transitions. [2022-12-14 09:34:58,481 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1195 transitions. Word has length 72 [2022-12-14 09:34:58,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:34:58,481 INFO L495 AbstractCegarLoop]: Abstraction has 905 states and 1195 transitions. [2022-12-14 09:34:58,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 23 states have internal predecessors, (43), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2022-12-14 09:34:58,481 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1195 transitions. [2022-12-14 09:34:58,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-14 09:34:58,482 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:34:58,482 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-14 09:34:58,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 09:34:58,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 09:34:58,683 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:34:58,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:34:58,683 INFO L85 PathProgramCache]: Analyzing trace with hash -581716579, now seen corresponding path program 1 times [2022-12-14 09:34:58,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:34:58,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180074419] [2022-12-14 09:34:58,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:34:58,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:34:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:34:58,882 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 09:34:58,882 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:34:58,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180074419] [2022-12-14 09:34:58,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180074419] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:34:58,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198012957] [2022-12-14 09:34:58,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:34:58,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:34:58,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:34:58,883 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:34:58,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 09:34:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:34:58,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 09:34:58,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:34:59,070 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 09:34:59,070 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:34:59,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198012957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:34:59,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 09:34:59,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-12-14 09:34:59,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435760380] [2022-12-14 09:34:59,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:34:59,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 09:34:59,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:34:59,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 09:34:59,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-12-14 09:34:59,071 INFO L87 Difference]: Start difference. First operand 905 states and 1195 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-14 09:34:59,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:34:59,611 INFO L93 Difference]: Finished difference Result 1770 states and 2402 transitions. [2022-12-14 09:34:59,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 09:34:59,611 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 72 [2022-12-14 09:34:59,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:34:59,614 INFO L225 Difference]: With dead ends: 1770 [2022-12-14 09:34:59,614 INFO L226 Difference]: Without dead ends: 1070 [2022-12-14 09:34:59,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-12-14 09:34:59,616 INFO L413 NwaCegarLoop]: 422 mSDtfsCounter, 493 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 09:34:59,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 1510 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 09:34:59,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2022-12-14 09:34:59,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 905. [2022-12-14 09:34:59,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 654 states have (on average 1.3134556574923548) internal successors, (859), 659 states have internal predecessors, (859), 166 states have call successors, (166), 84 states have call predecessors, (166), 84 states have return successors, (166), 161 states have call predecessors, (166), 166 states have call successors, (166) [2022-12-14 09:34:59,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1191 transitions. [2022-12-14 09:34:59,718 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1191 transitions. Word has length 72 [2022-12-14 09:34:59,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:34:59,718 INFO L495 AbstractCegarLoop]: Abstraction has 905 states and 1191 transitions. [2022-12-14 09:34:59,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-14 09:34:59,718 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1191 transitions. [2022-12-14 09:34:59,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 09:34:59,719 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:34:59,719 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-12-14 09:34:59,724 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 09:34:59,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 09:34:59,919 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:34:59,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:34:59,920 INFO L85 PathProgramCache]: Analyzing trace with hash 191631407, now seen corresponding path program 1 times [2022-12-14 09:34:59,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:34:59,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974791663] [2022-12-14 09:34:59,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:34:59,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:34:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:35:00,038 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 09:35:00,038 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:35:00,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974791663] [2022-12-14 09:35:00,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974791663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:35:00,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:35:00,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 09:35:00,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702283842] [2022-12-14 09:35:00,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:35:00,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 09:35:00,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:35:00,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 09:35:00,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 09:35:00,040 INFO L87 Difference]: Start difference. First operand 905 states and 1191 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-12-14 09:35:00,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:35:00,258 INFO L93 Difference]: Finished difference Result 1194 states and 1643 transitions. [2022-12-14 09:35:00,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 09:35:00,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 75 [2022-12-14 09:35:00,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:35:00,263 INFO L225 Difference]: With dead ends: 1194 [2022-12-14 09:35:00,264 INFO L226 Difference]: Without dead ends: 1192 [2022-12-14 09:35:00,264 INFO L412 NwaCegarLoop]: 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 [2022-12-14 09:35:00,265 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 153 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1489 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:35:00,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1489 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:35:00,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2022-12-14 09:35:00,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 913. [2022-12-14 09:35:00,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 658 states have (on average 1.3115501519756838) internal successors, (863), 665 states have internal predecessors, (863), 168 states have call successors, (168), 86 states have call predecessors, (168), 86 states have return successors, (168), 161 states have call predecessors, (168), 168 states have call successors, (168) [2022-12-14 09:35:00,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1199 transitions. [2022-12-14 09:35:00,429 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1199 transitions. Word has length 75 [2022-12-14 09:35:00,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:35:00,429 INFO L495 AbstractCegarLoop]: Abstraction has 913 states and 1199 transitions. [2022-12-14 09:35:00,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-12-14 09:35:00,430 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1199 transitions. [2022-12-14 09:35:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-12-14 09:35:00,431 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:35:00,431 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:35:00,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 09:35:00,431 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:35:00,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:35:00,432 INFO L85 PathProgramCache]: Analyzing trace with hash 71265005, now seen corresponding path program 1 times [2022-12-14 09:35:00,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:35:00,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552362268] [2022-12-14 09:35:00,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:35:00,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:35:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:35:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 09:35:00,558 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:35:00,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552362268] [2022-12-14 09:35:00,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552362268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:35:00,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:35:00,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:35:00,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119786662] [2022-12-14 09:35:00,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:35:00,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:35:00,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:35:00,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:35:00,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:35:00,560 INFO L87 Difference]: Start difference. First operand 913 states and 1199 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-12-14 09:35:00,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:35:00,708 INFO L93 Difference]: Finished difference Result 1579 states and 2085 transitions. [2022-12-14 09:35:00,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:35:00,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 78 [2022-12-14 09:35:00,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:35:00,711 INFO L225 Difference]: With dead ends: 1579 [2022-12-14 09:35:00,711 INFO L226 Difference]: Without dead ends: 901 [2022-12-14 09:35:00,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:35:00,713 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 7 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:35:00,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 610 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:35:00,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2022-12-14 09:35:00,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 901. [2022-12-14 09:35:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 652 states have (on average 1.2868098159509203) internal successors, (839), 659 states have internal predecessors, (839), 162 states have call successors, (162), 86 states have call predecessors, (162), 86 states have return successors, (162), 155 states have call predecessors, (162), 162 states have call successors, (162) [2022-12-14 09:35:00,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1163 transitions. [2022-12-14 09:35:00,819 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1163 transitions. Word has length 78 [2022-12-14 09:35:00,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:35:00,819 INFO L495 AbstractCegarLoop]: Abstraction has 901 states and 1163 transitions. [2022-12-14 09:35:00,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-12-14 09:35:00,819 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1163 transitions. [2022-12-14 09:35:00,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-14 09:35:00,821 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:35:00,821 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-12-14 09:35:00,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 09:35:00,821 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:35:00,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:35:00,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1924198557, now seen corresponding path program 1 times [2022-12-14 09:35:00,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:35:00,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081611171] [2022-12-14 09:35:00,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:35:00,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:35:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:35:01,245 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 09:35:01,245 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:35:01,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081611171] [2022-12-14 09:35:01,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081611171] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:35:01,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796206568] [2022-12-14 09:35:01,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:35:01,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:35:01,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:35:01,247 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:35:01,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 09:35:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:35:01,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 09:35:01,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:35:01,604 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 09:35:01,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:35:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 09:35:01,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796206568] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:35:01,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1097195668] [2022-12-14 09:35:01,715 INFO L159 IcfgInterpreter]: Started Sifa with 61 locations of interest [2022-12-14 09:35:01,715 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:35:01,715 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:35:01,715 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:35:01,715 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:35:04,379 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 217 for LOIs [2022-12-14 09:35:04,545 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 146 for LOIs [2022-12-14 09:35:04,561 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 121 for LOIs [2022-12-14 09:35:04,644 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 105 for LOIs [2022-12-14 09:35:04,663 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 101 for LOIs [2022-12-14 09:35:04,687 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 94 for LOIs [2022-12-14 09:35:04,710 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:35:30,442 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '35491#(and (<= ~active_side_History_0~0 0) (<= 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) (= ~manual_selection_History_1~0 0) (<= 0 (+ ~s2p_new~0 1)) (= |assert_#in~arg| 0) (<= 0 ~side2_written~0) (= ~s1s1~0 0) (<= 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) (not (= (mod ~side1Failed_History_0~0 256) 0)) (<= 0 (+ ~s1p_new~0 1)) (<= (+ 2 ~active_side_History_2~0) 0) (<= (+ ~s2s1_new~0 1) 0) (<= 0 ~manual_selection_History_2~0) (not (= (mod ~side2Failed_History_1~0 256) 0)) (<= (+ ~nomsg~0 1) 0) (= ~s1s2~0 0) (<= 0 (+ ~cs1_new~0 1)) (<= (+ 2 ~active_side_History_1~0) 0) (<= (+ ~cs1_new~0 1) 0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= 0 (+ 2 ~active_side_History_2~0)) (<= ~manual_selection_History_2~0 0) (<= 0 (+ ~side1_written~0 1)) (<= ~side2_written~0 0) (<= 0 (+ ~cs2_new~0 1)) (= ~cs2~0 0) (<= (+ ~side1_written~0 1) 0) (<= 0 |#StackHeapBarrier|) (<= (+ ~s2p_new~0 1) 0) (= ~s2p~0 0) (<= (+ ~s2s2_new~0 1) 0) (= (mod ~side1Failed_History_1~0 256) 0) (<= (+ ~s1s1_new~0 1) 0) (= |#NULL.base| 0))' at error location [2022-12-14 09:35:30,442 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:35:30,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:35:30,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 20 [2022-12-14 09:35:30,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571580055] [2022-12-14 09:35:30,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:35:30,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 09:35:30,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:35:30,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 09:35:30,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=3994, Unknown=0, NotChecked=0, Total=4422 [2022-12-14 09:35:30,444 INFO L87 Difference]: Start difference. First operand 901 states and 1163 transitions. Second operand has 20 states, 15 states have (on average 5.733333333333333) internal successors, (86), 18 states have internal predecessors, (86), 6 states have call successors, (26), 3 states have call predecessors, (26), 9 states have return successors, (26), 7 states have call predecessors, (26), 6 states have call successors, (26) [2022-12-14 09:35:31,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:35:31,293 INFO L93 Difference]: Finished difference Result 2204 states and 3035 transitions. [2022-12-14 09:35:31,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 09:35:31,294 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 5.733333333333333) internal successors, (86), 18 states have internal predecessors, (86), 6 states have call successors, (26), 3 states have call predecessors, (26), 9 states have return successors, (26), 7 states have call predecessors, (26), 6 states have call successors, (26) Word has length 80 [2022-12-14 09:35:31,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:35:31,304 INFO L225 Difference]: With dead ends: 2204 [2022-12-14 09:35:31,304 INFO L226 Difference]: Without dead ends: 1463 [2022-12-14 09:35:31,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 178 SyntacticMatches, 9 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1597 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=484, Invalid=4918, Unknown=0, NotChecked=0, Total=5402 [2022-12-14 09:35:31,309 INFO L413 NwaCegarLoop]: 362 mSDtfsCounter, 307 mSDsluCounter, 3956 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 4318 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 09:35:31,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 4318 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 09:35:31,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2022-12-14 09:35:31,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 880. [2022-12-14 09:35:31,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 637 states have (on average 1.2794348508634223) internal successors, (815), 644 states have internal predecessors, (815), 156 states have call successors, (156), 86 states have call predecessors, (156), 86 states have return successors, (156), 149 states have call predecessors, (156), 156 states have call successors, (156) [2022-12-14 09:35:31,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1127 transitions. [2022-12-14 09:35:31,482 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1127 transitions. Word has length 80 [2022-12-14 09:35:31,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:35:31,483 INFO L495 AbstractCegarLoop]: Abstraction has 880 states and 1127 transitions. [2022-12-14 09:35:31,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 5.733333333333333) internal successors, (86), 18 states have internal predecessors, (86), 6 states have call successors, (26), 3 states have call predecessors, (26), 9 states have return successors, (26), 7 states have call predecessors, (26), 6 states have call successors, (26) [2022-12-14 09:35:31,483 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1127 transitions. [2022-12-14 09:35:31,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-14 09:35:31,483 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:35:31,483 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 09:35:31,488 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 09:35:31,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:35:31,685 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:35:31,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:35:31,686 INFO L85 PathProgramCache]: Analyzing trace with hash 231606509, now seen corresponding path program 1 times [2022-12-14 09:35:31,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:35:31,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085915649] [2022-12-14 09:35:31,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:35:31,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:35:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:35:31,895 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 09:35:31,895 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:35:31,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085915649] [2022-12-14 09:35:31,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085915649] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:35:31,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855825932] [2022-12-14 09:35:31,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:35:31,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:35:31,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:35:31,897 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:35:31,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 09:35:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:35:31,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 09:35:31,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:35:32,058 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:35:32,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:35:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-14 09:35:32,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855825932] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:35:32,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1237946343] [2022-12-14 09:35:32,132 INFO L159 IcfgInterpreter]: Started Sifa with 61 locations of interest [2022-12-14 09:35:32,133 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:35:32,133 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:35:32,133 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:35:32,133 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:35:33,908 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 123 for LOIs [2022-12-14 09:35:33,929 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 145 for LOIs [2022-12-14 09:35:33,945 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 94 for LOIs [2022-12-14 09:35:34,015 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 100 for LOIs [2022-12-14 09:35:34,040 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 94 for LOIs [2022-12-14 09:35:34,067 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:35:53,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1237946343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:35:53,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:35:53,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [8, 9, 9] total 53 [2022-12-14 09:35:53,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617486286] [2022-12-14 09:35:53,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:35:53,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-14 09:35:53,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:35:53,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-14 09:35:53,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2497, Unknown=0, NotChecked=0, Total=2756 [2022-12-14 09:35:53,043 INFO L87 Difference]: Start difference. First operand 880 states and 1127 transitions. Second operand has 42 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 28 states have internal predecessors, (45), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-12-14 09:36:11,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:36:11,443 INFO L93 Difference]: Finished difference Result 1489 states and 1937 transitions. [2022-12-14 09:36:11,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-14 09:36:11,444 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 28 states have internal predecessors, (45), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 80 [2022-12-14 09:36:11,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:36:11,449 INFO L225 Difference]: With dead ends: 1489 [2022-12-14 09:36:11,449 INFO L226 Difference]: Without dead ends: 915 [2022-12-14 09:36:11,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 186 SyntacticMatches, 12 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 31.0s TimeCoverageRelationStatistics Valid=458, Invalid=3964, Unknown=0, NotChecked=0, Total=4422 [2022-12-14 09:36:11,451 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 216 mSDsluCounter, 4297 mSDsCounter, 0 mSdLazyCounter, 3489 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 4570 SdHoareTripleChecker+Invalid, 3597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 3489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:36:11,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 4570 Invalid, 3597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 3489 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-12-14 09:36:11,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2022-12-14 09:36:11,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 883. [2022-12-14 09:36:11,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 639 states have (on average 1.2785602503912363) internal successors, (817), 646 states have internal predecessors, (817), 157 states have call successors, (157), 86 states have call predecessors, (157), 86 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2022-12-14 09:36:11,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1131 transitions. [2022-12-14 09:36:11,585 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1131 transitions. Word has length 80 [2022-12-14 09:36:11,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:36:11,585 INFO L495 AbstractCegarLoop]: Abstraction has 883 states and 1131 transitions. [2022-12-14 09:36:11,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 28 states have internal predecessors, (45), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-12-14 09:36:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1131 transitions. [2022-12-14 09:36:11,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-12-14 09:36:11,586 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:36:11,586 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 09:36:11,591 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 09:36:11,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:36:11,788 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:36:11,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:36:11,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1201064152, now seen corresponding path program 1 times [2022-12-14 09:36:11,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:36:11,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337538361] [2022-12-14 09:36:11,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:36:11,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:36:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:36:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 09:36:12,005 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:36:12,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337538361] [2022-12-14 09:36:12,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337538361] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:36:12,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194554043] [2022-12-14 09:36:12,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:36:12,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:36:12,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:36:12,007 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:36:12,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 09:36:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:36:12,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 09:36:12,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:36:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:36:12,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:36:12,261 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-14 09:36:12,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194554043] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:36:12,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [107121792] [2022-12-14 09:36:12,263 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2022-12-14 09:36:12,264 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:36:12,264 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:36:12,264 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:36:12,264 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:36:15,454 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 125 for LOIs [2022-12-14 09:36:15,475 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 146 for LOIs [2022-12-14 09:36:15,491 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 122 for LOIs [2022-12-14 09:36:15,580 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 151 for LOIs [2022-12-14 09:36:15,621 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 147 for LOIs [2022-12-14 09:36:15,661 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:36:43,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [107121792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:36:43,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:36:43,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [8, 9, 9] total 53 [2022-12-14 09:36:43,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262854020] [2022-12-14 09:36:43,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:36:43,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-14 09:36:43,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:36:43,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-14 09:36:43,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=2513, Unknown=0, NotChecked=0, Total=2756 [2022-12-14 09:36:43,108 INFO L87 Difference]: Start difference. First operand 883 states and 1131 transitions. Second operand has 42 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 29 states have internal predecessors, (47), 8 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2022-12-14 09:36:50,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:36:50,538 INFO L93 Difference]: Finished difference Result 1492 states and 1941 transitions. [2022-12-14 09:36:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-14 09:36:50,539 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 29 states have internal predecessors, (47), 8 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) Word has length 82 [2022-12-14 09:36:50,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:36:50,542 INFO L225 Difference]: With dead ends: 1492 [2022-12-14 09:36:50,542 INFO L226 Difference]: Without dead ends: 918 [2022-12-14 09:36:50,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 193 SyntacticMatches, 11 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=251, Invalid=2611, Unknown=0, NotChecked=0, Total=2862 [2022-12-14 09:36:50,544 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 161 mSDsluCounter, 4440 mSDsCounter, 0 mSdLazyCounter, 3494 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 4731 SdHoareTripleChecker+Invalid, 3541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 3494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-12-14 09:36:50,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 4731 Invalid, 3541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 3494 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-12-14 09:36:50,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2022-12-14 09:36:50,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 886. [2022-12-14 09:36:50,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 641 states have (on average 1.2776911076443058) internal successors, (819), 648 states have internal predecessors, (819), 158 states have call successors, (158), 86 states have call predecessors, (158), 86 states have return successors, (158), 151 states have call predecessors, (158), 158 states have call successors, (158) [2022-12-14 09:36:50,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1135 transitions. [2022-12-14 09:36:50,709 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1135 transitions. Word has length 82 [2022-12-14 09:36:50,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:36:50,709 INFO L495 AbstractCegarLoop]: Abstraction has 886 states and 1135 transitions. [2022-12-14 09:36:50,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 29 states have internal predecessors, (47), 8 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2022-12-14 09:36:50,709 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1135 transitions. [2022-12-14 09:36:50,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-14 09:36:50,710 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:36:50,710 INFO L195 NwaCegarLoop]: trace histogram [5, 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] [2022-12-14 09:36:50,716 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 09:36:50,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:36:50,912 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:36:50,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:36:50,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1550129439, now seen corresponding path program 1 times [2022-12-14 09:36:50,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:36:50,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659012371] [2022-12-14 09:36:50,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:36:50,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:36:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:36:51,073 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 09:36:51,074 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:36:51,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659012371] [2022-12-14 09:36:51,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659012371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:36:51,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:36:51,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:36:51,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314150281] [2022-12-14 09:36:51,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:36:51,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:36:51,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:36:51,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:36:51,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:36:51,075 INFO L87 Difference]: Start difference. First operand 886 states and 1135 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) [2022-12-14 09:36:51,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:36:51,268 INFO L93 Difference]: Finished difference Result 1513 states and 1955 transitions. [2022-12-14 09:36:51,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:36:51,268 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 87 [2022-12-14 09:36:51,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:36:51,272 INFO L225 Difference]: With dead ends: 1513 [2022-12-14 09:36:51,272 INFO L226 Difference]: Without dead ends: 874 [2022-12-14 09:36:51,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:36:51,274 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 7 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:36:51,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 592 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:36:51,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2022-12-14 09:36:51,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2022-12-14 09:36:51,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 635 states have (on average 1.2519685039370079) internal successors, (795), 642 states have internal predecessors, (795), 152 states have call successors, (152), 86 states have call predecessors, (152), 86 states have return successors, (152), 145 states have call predecessors, (152), 152 states have call successors, (152) [2022-12-14 09:36:51,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1099 transitions. [2022-12-14 09:36:51,410 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1099 transitions. Word has length 87 [2022-12-14 09:36:51,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:36:51,410 INFO L495 AbstractCegarLoop]: Abstraction has 874 states and 1099 transitions. [2022-12-14 09:36:51,410 INFO L496 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) [2022-12-14 09:36:51,410 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1099 transitions. [2022-12-14 09:36:51,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-14 09:36:51,411 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:36:51,411 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:36:51,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 09:36:51,411 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:36:51,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:36:51,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1847822074, now seen corresponding path program 1 times [2022-12-14 09:36:51,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:36:51,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254930366] [2022-12-14 09:36:51,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:36:51,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:36:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:36:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 09:36:51,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:36:51,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254930366] [2022-12-14 09:36:51,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254930366] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:36:51,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117221443] [2022-12-14 09:36:51,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:36:51,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:36:51,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:36:51,587 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:36:51,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 09:36:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:36:51,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 09:36:51,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:36:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 09:36:51,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:36:51,864 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 09:36:51,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117221443] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:36:51,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2119389433] [2022-12-14 09:36:51,866 INFO L159 IcfgInterpreter]: Started Sifa with 64 locations of interest [2022-12-14 09:36:51,866 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:36:51,866 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:36:51,866 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:36:51,867 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:36:54,721 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 123 for LOIs [2022-12-14 09:36:54,741 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 146 for LOIs [2022-12-14 09:36:54,757 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 122 for LOIs [2022-12-14 09:36:54,840 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 202 for LOIs [2022-12-14 09:36:55,224 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 148 for LOIs [2022-12-14 09:36:55,266 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:37:26,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2119389433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:37:26,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:37:26,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [8, 9, 9] total 54 [2022-12-14 09:37:26,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780199790] [2022-12-14 09:37:26,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:37:26,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-14 09:37:26,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:37:26,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-14 09:37:26,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=2588, Unknown=0, NotChecked=0, Total=2862 [2022-12-14 09:37:26,821 INFO L87 Difference]: Start difference. First operand 874 states and 1099 transitions. Second operand has 43 states, 38 states have (on average 1.263157894736842) internal successors, (48), 29 states have internal predecessors, (48), 9 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2022-12-14 09:37:33,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:37:33,134 INFO L93 Difference]: Finished difference Result 1462 states and 1864 transitions. [2022-12-14 09:37:33,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-14 09:37:33,134 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 38 states have (on average 1.263157894736842) internal successors, (48), 29 states have internal predecessors, (48), 9 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) Word has length 87 [2022-12-14 09:37:33,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:37:33,136 INFO L225 Difference]: With dead ends: 1462 [2022-12-14 09:37:33,136 INFO L226 Difference]: Without dead ends: 896 [2022-12-14 09:37:33,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 208 SyntacticMatches, 10 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=282, Invalid=2688, Unknown=0, NotChecked=0, Total=2970 [2022-12-14 09:37:33,138 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 196 mSDsluCounter, 3546 mSDsCounter, 0 mSdLazyCounter, 3029 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 3807 SdHoareTripleChecker+Invalid, 3092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-12-14 09:37:33,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 3807 Invalid, 3092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3029 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-12-14 09:37:33,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2022-12-14 09:37:33,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 861. [2022-12-14 09:37:33,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 626 states have (on average 1.2492012779552715) internal successors, (782), 633 states have internal predecessors, (782), 148 states have call successors, (148), 86 states have call predecessors, (148), 86 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-12-14 09:37:33,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1078 transitions. [2022-12-14 09:37:33,265 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1078 transitions. Word has length 87 [2022-12-14 09:37:33,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:37:33,265 INFO L495 AbstractCegarLoop]: Abstraction has 861 states and 1078 transitions. [2022-12-14 09:37:33,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 38 states have (on average 1.263157894736842) internal successors, (48), 29 states have internal predecessors, (48), 9 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2022-12-14 09:37:33,265 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1078 transitions. [2022-12-14 09:37:33,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-14 09:37:33,266 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:37:33,266 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:37:33,270 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 09:37:33,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-14 09:37:33,468 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:37:33,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:37:33,469 INFO L85 PathProgramCache]: Analyzing trace with hash 970383979, now seen corresponding path program 1 times [2022-12-14 09:37:33,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:37:33,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305753476] [2022-12-14 09:37:33,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:37:33,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:37:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:37:33,671 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 09:37:33,671 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:37:33,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305753476] [2022-12-14 09:37:33,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305753476] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:37:33,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237368907] [2022-12-14 09:37:33,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:37:33,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:37:33,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:37:33,672 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:37:33,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 09:37:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:37:33,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 09:37:33,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:37:33,822 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 09:37:33,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:37:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 09:37:33,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237368907] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:37:33,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1683177081] [2022-12-14 09:37:33,913 INFO L159 IcfgInterpreter]: Started Sifa with 66 locations of interest [2022-12-14 09:37:33,913 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:37:33,913 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:37:33,913 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:37:33,913 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:37:36,507 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 125 for LOIs [2022-12-14 09:37:36,528 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 146 for LOIs [2022-12-14 09:37:36,544 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 198 for LOIs [2022-12-14 09:37:36,873 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 203 for LOIs [2022-12-14 09:37:37,206 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 147 for LOIs [2022-12-14 09:37:37,246 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:38:10,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1683177081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:38:10,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:38:10,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [8, 9, 9] total 54 [2022-12-14 09:38:10,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838170217] [2022-12-14 09:38:10,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:38:10,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-14 09:38:10,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:38:10,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-14 09:38:10,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=2618, Unknown=0, NotChecked=0, Total=2862 [2022-12-14 09:38:10,024 INFO L87 Difference]: Start difference. First operand 861 states and 1078 transitions. Second operand has 43 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 30 states have internal predecessors, (50), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2022-12-14 09:38:18,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:38:18,589 INFO L93 Difference]: Finished difference Result 1462 states and 1864 transitions. [2022-12-14 09:38:18,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-14 09:38:18,590 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 30 states have internal predecessors, (50), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) Word has length 89 [2022-12-14 09:38:18,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:38:18,592 INFO L225 Difference]: With dead ends: 1462 [2022-12-14 09:38:18,592 INFO L226 Difference]: Without dead ends: 893 [2022-12-14 09:38:18,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 215 SyntacticMatches, 9 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 33.7s TimeCoverageRelationStatistics Valid=252, Invalid=2718, Unknown=0, NotChecked=0, Total=2970 [2022-12-14 09:38:18,593 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 214 mSDsluCounter, 4716 mSDsCounter, 0 mSdLazyCounter, 3843 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 4994 SdHoareTripleChecker+Invalid, 3907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-12-14 09:38:18,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 4994 Invalid, 3907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3843 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2022-12-14 09:38:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2022-12-14 09:38:18,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 861. [2022-12-14 09:38:18,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 626 states have (on average 1.2476038338658146) internal successors, (781), 633 states have internal predecessors, (781), 148 states have call successors, (148), 86 states have call predecessors, (148), 86 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-12-14 09:38:18,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1077 transitions. [2022-12-14 09:38:18,725 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1077 transitions. Word has length 89 [2022-12-14 09:38:18,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:38:18,725 INFO L495 AbstractCegarLoop]: Abstraction has 861 states and 1077 transitions. [2022-12-14 09:38:18,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 30 states have internal predecessors, (50), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2022-12-14 09:38:18,725 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1077 transitions. [2022-12-14 09:38:18,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-14 09:38:18,726 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:38:18,726 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:38:18,730 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 09:38:18,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-14 09:38:18,928 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:38:18,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:38:18,929 INFO L85 PathProgramCache]: Analyzing trace with hash -587429320, now seen corresponding path program 1 times [2022-12-14 09:38:18,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:38:18,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756437268] [2022-12-14 09:38:18,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:38:18,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:38:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:38:19,140 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 09:38:19,140 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:38:19,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756437268] [2022-12-14 09:38:19,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756437268] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:38:19,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841709059] [2022-12-14 09:38:19,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:38:19,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:38:19,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:38:19,141 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:38:19,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 09:38:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:38:19,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 09:38:19,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:38:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 09:38:19,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:38:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 09:38:19,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841709059] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:38:19,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2105774997] [2022-12-14 09:38:19,366 INFO L159 IcfgInterpreter]: Started Sifa with 70 locations of interest [2022-12-14 09:38:19,366 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:38:19,366 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:38:19,366 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:38:19,366 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:38:21,559 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 125 for LOIs [2022-12-14 09:38:21,579 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 146 for LOIs [2022-12-14 09:38:21,595 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 93 for LOIs [2022-12-14 09:38:21,663 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 135 for LOIs [2022-12-14 09:38:21,909 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 93 for LOIs [2022-12-14 09:38:21,931 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:38:46,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2105774997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:38:46,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:38:46,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [8, 9, 9] total 59 [2022-12-14 09:38:46,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087718914] [2022-12-14 09:38:46,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:38:46,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-12-14 09:38:46,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:38:46,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-12-14 09:38:46,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=3106, Unknown=0, NotChecked=0, Total=3422 [2022-12-14 09:38:46,016 INFO L87 Difference]: Start difference. First operand 861 states and 1077 transitions. Second operand has 48 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 33 states have internal predecessors, (54), 10 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-12-14 09:39:09,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:39:09,348 INFO L93 Difference]: Finished difference Result 1449 states and 1842 transitions. [2022-12-14 09:39:09,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-14 09:39:09,349 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 33 states have internal predecessors, (54), 10 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 93 [2022-12-14 09:39:09,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:39:09,351 INFO L225 Difference]: With dead ends: 1449 [2022-12-14 09:39:09,351 INFO L226 Difference]: Without dead ends: 883 [2022-12-14 09:39:09,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 217 SyntacticMatches, 14 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1439 ImplicationChecksByTransitivity, 40.4s TimeCoverageRelationStatistics Valid=568, Invalid=4982, Unknown=0, NotChecked=0, Total=5550 [2022-12-14 09:39:09,353 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 252 mSDsluCounter, 4484 mSDsCounter, 0 mSdLazyCounter, 3673 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 4756 SdHoareTripleChecker+Invalid, 3796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 3673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-12-14 09:39:09,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 4756 Invalid, 3796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 3673 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-12-14 09:39:09,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2022-12-14 09:39:09,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 848. [2022-12-14 09:39:09,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 617 states have (on average 1.2447325769854134) internal successors, (768), 624 states have internal predecessors, (768), 144 states have call successors, (144), 86 states have call predecessors, (144), 86 states have return successors, (144), 137 states have call predecessors, (144), 144 states have call successors, (144) [2022-12-14 09:39:09,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1056 transitions. [2022-12-14 09:39:09,484 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1056 transitions. Word has length 93 [2022-12-14 09:39:09,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:39:09,484 INFO L495 AbstractCegarLoop]: Abstraction has 848 states and 1056 transitions. [2022-12-14 09:39:09,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 33 states have internal predecessors, (54), 10 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-12-14 09:39:09,485 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1056 transitions. [2022-12-14 09:39:09,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-14 09:39:09,485 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:39:09,486 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 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] [2022-12-14 09:39:09,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 09:39:09,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-14 09:39:09,688 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:39:09,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:39:09,689 INFO L85 PathProgramCache]: Analyzing trace with hash 773131699, now seen corresponding path program 1 times [2022-12-14 09:39:09,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:39:09,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888299166] [2022-12-14 09:39:09,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:39:09,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:39:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:39:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-12-14 09:39:09,812 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:39:09,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888299166] [2022-12-14 09:39:09,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888299166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:39:09,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:39:09,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:39:09,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381531625] [2022-12-14 09:39:09,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:39:09,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:39:09,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:39:09,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:39:09,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:39:09,814 INFO L87 Difference]: Start difference. First operand 848 states and 1056 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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) [2022-12-14 09:39:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:39:09,983 INFO L93 Difference]: Finished difference Result 1415 states and 1789 transitions. [2022-12-14 09:39:09,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:39:09,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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 103 [2022-12-14 09:39:09,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:39:09,986 INFO L225 Difference]: With dead ends: 1415 [2022-12-14 09:39:09,986 INFO L226 Difference]: Without dead ends: 836 [2022-12-14 09:39:09,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:39:09,987 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 7 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:39:09,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 580 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:39:09,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2022-12-14 09:39:10,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 786. [2022-12-14 09:39:10,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 575 states have (on average 1.2104347826086956) internal successors, (696), 582 states have internal predecessors, (696), 130 states have call successors, (130), 80 states have call predecessors, (130), 80 states have return successors, (130), 123 states have call predecessors, (130), 130 states have call successors, (130) [2022-12-14 09:39:10,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 956 transitions. [2022-12-14 09:39:10,112 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 956 transitions. Word has length 103 [2022-12-14 09:39:10,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:39:10,112 INFO L495 AbstractCegarLoop]: Abstraction has 786 states and 956 transitions. [2022-12-14 09:39:10,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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) [2022-12-14 09:39:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 956 transitions. [2022-12-14 09:39:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-14 09:39:10,113 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:39:10,113 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:39:10,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-14 09:39:10,113 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:39:10,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:39:10,114 INFO L85 PathProgramCache]: Analyzing trace with hash -406978683, now seen corresponding path program 1 times [2022-12-14 09:39:10,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:39:10,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888214746] [2022-12-14 09:39:10,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:39:10,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:39:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:39:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-12-14 09:39:10,210 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:39:10,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888214746] [2022-12-14 09:39:10,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888214746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:39:10,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:39:10,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:39:10,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620825680] [2022-12-14 09:39:10,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:39:10,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:39:10,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:39:10,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:39:10,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:39:10,211 INFO L87 Difference]: Start difference. First operand 786 states and 956 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-12-14 09:39:10,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:39:10,363 INFO L93 Difference]: Finished difference Result 1258 states and 1560 transitions. [2022-12-14 09:39:10,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:39:10,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2022-12-14 09:39:10,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:39:10,365 INFO L225 Difference]: With dead ends: 1258 [2022-12-14 09:39:10,365 INFO L226 Difference]: Without dead ends: 774 [2022-12-14 09:39:10,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:39:10,366 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 6 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:39:10,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 571 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:39:10,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2022-12-14 09:39:10,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 758. [2022-12-14 09:39:10,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 555 states have (on average 1.1891891891891893) internal successors, (660), 562 states have internal predecessors, (660), 124 states have call successors, (124), 78 states have call predecessors, (124), 78 states have return successors, (124), 117 states have call predecessors, (124), 124 states have call successors, (124) [2022-12-14 09:39:10,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 908 transitions. [2022-12-14 09:39:10,494 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 908 transitions. Word has length 119 [2022-12-14 09:39:10,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:39:10,494 INFO L495 AbstractCegarLoop]: Abstraction has 758 states and 908 transitions. [2022-12-14 09:39:10,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-12-14 09:39:10,494 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 908 transitions. [2022-12-14 09:39:10,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-12-14 09:39:10,496 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:39:10,496 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:39:10,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-14 09:39:10,497 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:39:10,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:39:10,497 INFO L85 PathProgramCache]: Analyzing trace with hash -375705278, now seen corresponding path program 1 times [2022-12-14 09:39:10,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:39:10,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111380730] [2022-12-14 09:39:10,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:39:10,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:39:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:39:10,724 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-12-14 09:39:10,725 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:39:10,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111380730] [2022-12-14 09:39:10,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111380730] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:39:10,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217107439] [2022-12-14 09:39:10,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:39:10,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:39:10,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:39:10,726 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:39:10,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 09:39:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:39:10,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 09:39:10,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:39:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 69 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-14 09:39:10,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:39:10,970 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-12-14 09:39:10,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217107439] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:39:10,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1910967473] [2022-12-14 09:39:10,972 INFO L159 IcfgInterpreter]: Started Sifa with 81 locations of interest [2022-12-14 09:39:10,972 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:39:10,972 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:39:10,972 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:39:10,972 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:39:17,461 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 91 for LOIs [2022-12-14 09:39:17,557 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 146 for LOIs [2022-12-14 09:39:17,573 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 92 for LOIs [2022-12-14 09:39:17,661 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 151 for LOIs [2022-12-14 09:39:17,692 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 195 for LOIs [2022-12-14 09:39:18,087 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 184 for LOIs [2022-12-14 09:39:18,484 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:40:00,371 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '67391#(and (<= 0 (+ ~manual_selection_History_0~0 128)) (= ~s1p_old~0 (ite (<= (mod ~nomsg~0 256) 127) (mod ~nomsg~0 256) (+ (- 256) (mod ~nomsg~0 256)))) (not (= (mod ~side1Failed~0 256) 0)) (<= 0 (+ 2 ~active_side_History_1~0)) (= ~s1p~0 0) (= ~cs1~0 0) (= ~s2s1~0 0) (<= (+ ~s1p_new~0 1) 0) (= (mod ~side2Failed_History_1~0 256) (mod ~side2Failed_History_2~0 256)) (<= ~manual_selection_History_0~0 127) (= ~manual_selection_History_1~0 0) (= |assert_#in~arg| 0) (= (ite (<= (mod (ite (not (= ~nomsg~0 ~manual_selection_History_0~0)) ~manual_selection_History_0~0 ~nomsg~0) 256) 127) (mod (ite (not (= ~nomsg~0 ~manual_selection_History_0~0)) ~manual_selection_History_0~0 ~nomsg~0) 256) (+ (mod (ite (not (= ~nomsg~0 ~manual_selection_History_0~0)) ~manual_selection_History_0~0 ~nomsg~0) 256) (- 256))) ~cs2_old~0) (= ~s1s1~0 0) (= ~s1s2_old~0 (ite (<= (mod ~nomsg~0 256) 127) (mod ~nomsg~0 256) (+ (- 256) (mod ~nomsg~0 256)))) (= ~nomsg~0 ~s1s1_new~0) (= ~nomsg~0 ~s2s1_new~0) (= assert_~arg |assert_#in~arg|) (= ~s2s2~0 0) (= ~side2Failed~0 ~side2Failed_History_0~0) (<= 0 (+ ~s1p_new~0 1)) (<= (+ 2 ~active_side_History_2~0) 0) (= ~side2_written~0 0) (= ~manual_selection_History_2~0 0) (= ~s1s2~0 0) (= (mod ~side2Failed~0 256) 0) (= ~nomsg~0 ~s2p_new~0) (= ~s2p_old~0 (ite (<= (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256) 127) (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256) (+ (- 256) (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256)))) (<= (+ 2 ~active_side_History_1~0) 0) (= ~side1Failed_History_0~0 ~side1Failed~0) (= (ite (<= (mod (ite (not (= ~nomsg~0 ~manual_selection_History_0~0)) ~manual_selection_History_0~0 ~nomsg~0) 256) 127) (mod (ite (not (= ~nomsg~0 ~manual_selection_History_0~0)) ~manual_selection_History_0~0 ~nomsg~0) 256) (+ (mod (ite (not (= ~nomsg~0 ~manual_selection_History_0~0)) ~manual_selection_History_0~0 ~nomsg~0) 256) (- 256))) ~cs1_old~0) (= |#NULL.offset| 0) (<= 0 (+ 2 ~active_side_History_2~0)) (= ~s1s1_old~0 (ite (<= (mod ~nomsg~0 256) 127) (mod ~nomsg~0 256) (+ (- 256) (mod ~nomsg~0 256)))) (= ~nomsg~0 ~cs1_new~0) (= ~active_side_History_0~0 0) (<= 0 (+ ~side1_written~0 1)) (= ~nomsg~0 ~s2s2_new~0) (= (ite (<= (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256) 127) (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256) (+ (- 256) (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256))) ~s2s1_old~0) (= ~nomsg~0 ~cs2_new~0) (= ~s2s2_old~0 (ite (<= (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256) 127) (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256) (+ (- 256) (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256)))) (<= 0 (+ ~cs2_new~0 1)) (= ~cs2~0 0) (<= (+ ~side1_written~0 1) 0) (= ~nomsg~0 ~s1s2_new~0) (<= 0 |#StackHeapBarrier|) (= ~s2p~0 0) (<= (+ ~s1s1_new~0 1) 0) (= |#NULL.base| 0))' at error location [2022-12-14 09:40:00,371 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:40:00,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:40:00,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 13 [2022-12-14 09:40:00,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916311603] [2022-12-14 09:40:00,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:40:00,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 09:40:00,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:40:00,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 09:40:00,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=3709, Unknown=0, NotChecked=0, Total=4032 [2022-12-14 09:40:00,372 INFO L87 Difference]: Start difference. First operand 758 states and 908 transitions. Second operand has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 10 states have internal predecessors, (103), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (30), 6 states have call predecessors, (30), 3 states have call successors, (30) [2022-12-14 09:40:01,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:40:01,153 INFO L93 Difference]: Finished difference Result 2063 states and 2618 transitions. [2022-12-14 09:40:01,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 09:40:01,153 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 10 states have internal predecessors, (103), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (30), 6 states have call predecessors, (30), 3 states have call successors, (30) Word has length 129 [2022-12-14 09:40:01,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:40:01,156 INFO L225 Difference]: With dead ends: 2063 [2022-12-14 09:40:01,156 INFO L226 Difference]: Without dead ends: 1457 [2022-12-14 09:40:01,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 313 SyntacticMatches, 21 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1460 ImplicationChecksByTransitivity, 42.1s TimeCoverageRelationStatistics Valid=359, Invalid=4333, Unknown=0, NotChecked=0, Total=4692 [2022-12-14 09:40:01,158 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 374 mSDsluCounter, 2084 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 2345 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 09:40:01,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 2345 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 09:40:01,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2022-12-14 09:40:01,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1061. [2022-12-14 09:40:01,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 777 states have (on average 1.1814671814671815) internal successors, (918), 787 states have internal predecessors, (918), 172 states have call successors, (172), 111 states have call predecessors, (172), 111 states have return successors, (172), 162 states have call predecessors, (172), 172 states have call successors, (172) [2022-12-14 09:40:01,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1262 transitions. [2022-12-14 09:40:01,311 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1262 transitions. Word has length 129 [2022-12-14 09:40:01,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:40:01,312 INFO L495 AbstractCegarLoop]: Abstraction has 1061 states and 1262 transitions. [2022-12-14 09:40:01,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 10 states have internal predecessors, (103), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (30), 6 states have call predecessors, (30), 3 states have call successors, (30) [2022-12-14 09:40:01,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1262 transitions. [2022-12-14 09:40:01,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-14 09:40:01,313 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:40:01,313 INFO L195 NwaCegarLoop]: 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] [2022-12-14 09:40:01,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-14 09:40:01,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-14 09:40:01,515 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:40:01,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:40:01,516 INFO L85 PathProgramCache]: Analyzing trace with hash 295151570, now seen corresponding path program 1 times [2022-12-14 09:40:01,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:40:01,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801824903] [2022-12-14 09:40:01,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:40:01,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:40:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:40:03,191 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-12-14 09:40:03,191 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:40:03,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801824903] [2022-12-14 09:40:03,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801824903] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:40:03,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071178231] [2022-12-14 09:40:03,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:40:03,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:40:03,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:40:03,193 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:40:03,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 09:40:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:40:03,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 09:40:03,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:40:03,808 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 71 proven. 5 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-12-14 09:40:03,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:40:04,270 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-12-14 09:40:04,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071178231] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:40:04,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [489402868] [2022-12-14 09:40:04,271 INFO L159 IcfgInterpreter]: Started Sifa with 84 locations of interest [2022-12-14 09:40:04,272 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:40:04,272 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:40:04,272 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:40:04,272 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:40:08,519 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 89 for LOIs [2022-12-14 09:40:08,613 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 146 for LOIs [2022-12-14 09:40:08,629 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 120 for LOIs [2022-12-14 09:40:08,794 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 99 for LOIs [2022-12-14 09:40:08,818 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 121 for LOIs [2022-12-14 09:40:08,932 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 130 for LOIs [2022-12-14 09:40:09,215 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:40:49,334 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '72426#(and (<= ~active_side_History_0~0 0) (<= 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) (= (mod ~side2Failed_History_1~0 256) (mod ~side2Failed_History_2~0 256)) (<= ~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) (= ~s1s1~0 0) (<= 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)) (<= (+ 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) (<= (+ ~nomsg~0 1) 0) (= ~s1s2~0 0) (<= 0 (+ ~cs1_new~0 1)) (<= (+ 2 ~active_side_History_1~0) 0) (<= (+ ~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) (<= 0 (+ ~cs2_new~0 1)) (= ~cs2~0 0) (<= (+ ~side1_written~0 1) 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 [2022-12-14 09:40:49,334 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:40:49,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:40:49,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 14, 14] total 55 [2022-12-14 09:40:49,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299152416] [2022-12-14 09:40:49,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:40:49,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-12-14 09:40:49,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:40:49,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-12-14 09:40:49,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1989, Invalid=10001, Unknown=0, NotChecked=0, Total=11990 [2022-12-14 09:40:49,339 INFO L87 Difference]: Start difference. First operand 1061 states and 1262 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) [2022-12-14 09:40:55,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:40:55,031 INFO L93 Difference]: Finished difference Result 2756 states and 3613 transitions. [2022-12-14 09:40:55,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-14 09:40:55,032 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 [2022-12-14 09:40:55,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:40:55,037 INFO L225 Difference]: With dead ends: 2756 [2022-12-14 09:40:55,037 INFO L226 Difference]: Without dead ends: 1889 [2022-12-14 09:40:55,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 321 SyntacticMatches, 18 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 42.7s TimeCoverageRelationStatistics Valid=2461, Invalid=16171, Unknown=0, NotChecked=0, Total=18632 [2022-12-14 09:40:55,039 INFO L413 NwaCegarLoop]: 457 mSDtfsCounter, 831 mSDsluCounter, 13678 mSDsCounter, 0 mSdLazyCounter, 5885 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 14135 SdHoareTripleChecker+Invalid, 6080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 5885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:40:55,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 14135 Invalid, 6080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 5885 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-12-14 09:40:55,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2022-12-14 09:40:55,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1003. [2022-12-14 09:40:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 737 states have (on average 1.2048846675712348) internal successors, (888), 749 states have internal predecessors, (888), 160 states have call successors, (160), 105 states have call predecessors, (160), 105 states have return successors, (160), 148 states have call predecessors, (160), 160 states have call successors, (160) [2022-12-14 09:40:55,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1208 transitions. [2022-12-14 09:40:55,201 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1208 transitions. Word has length 137 [2022-12-14 09:40:55,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:40:55,201 INFO L495 AbstractCegarLoop]: Abstraction has 1003 states and 1208 transitions. [2022-12-14 09:40:55,201 INFO L496 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) [2022-12-14 09:40:55,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1208 transitions. [2022-12-14 09:40:55,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-14 09:40:55,202 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:40:55,202 INFO L195 NwaCegarLoop]: 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] [2022-12-14 09:40:55,207 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 09:40:55,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-14 09:40:55,403 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:40:55,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:40:55,403 INFO L85 PathProgramCache]: Analyzing trace with hash -833778471, now seen corresponding path program 1 times [2022-12-14 09:40:55,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:40:55,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363417084] [2022-12-14 09:40:55,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:40:55,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:40:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:40:56,012 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-12-14 09:40:56,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:40:56,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363417084] [2022-12-14 09:40:56,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363417084] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:40:56,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686784304] [2022-12-14 09:40:56,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:40:56,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:40:56,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:40:56,014 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:40:56,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 09:40:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:40:56,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-14 09:40:56,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:40:56,458 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 64 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 09:40:56,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:40:56,775 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-12-14 09:40:56,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686784304] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:40:56,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1510671788] [2022-12-14 09:40:56,777 INFO L159 IcfgInterpreter]: Started Sifa with 73 locations of interest [2022-12-14 09:40:56,777 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:40:56,777 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:40:56,778 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:40:56,778 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:41:07,617 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 254 for LOIs [2022-12-14 09:41:08,417 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 98 for LOIs [2022-12-14 09:41:08,423 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 96 for LOIs [2022-12-14 09:41:08,491 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 156 for LOIs [2022-12-14 09:41:08,533 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 153 for LOIs [2022-12-14 09:41:08,576 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 95 for LOIs [2022-12-14 09:41:08,598 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:41:42,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1510671788] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:41:42,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:41:42,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [9, 9, 9] total 67 [2022-12-14 09:41:42,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049535900] [2022-12-14 09:41:42,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:41:42,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-12-14 09:41:42,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:41:42,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-12-14 09:41:42,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=685, Invalid=3737, Unknown=0, NotChecked=0, Total=4422 [2022-12-14 09:41:42,764 INFO L87 Difference]: Start difference. First operand 1003 states and 1208 transitions. Second operand has 50 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 34 states have internal predecessors, (58), 12 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-12-14 09:42:00,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:42:00,223 INFO L93 Difference]: Finished difference Result 1947 states and 2391 transitions. [2022-12-14 09:42:00,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-12-14 09:42:00,224 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 34 states have internal predecessors, (58), 12 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 137 [2022-12-14 09:42:00,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:42:00,227 INFO L225 Difference]: With dead ends: 1947 [2022-12-14 09:42:00,227 INFO L226 Difference]: Without dead ends: 1211 [2022-12-14 09:42:00,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 333 SyntacticMatches, 21 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2765 ImplicationChecksByTransitivity, 46.6s TimeCoverageRelationStatistics Valid=1036, Invalid=5936, Unknown=0, NotChecked=0, Total=6972 [2022-12-14 09:42:00,229 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 171 mSDsluCounter, 2485 mSDsCounter, 0 mSdLazyCounter, 2728 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 2669 SdHoareTripleChecker+Invalid, 2796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 2728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-12-14 09:42:00,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 2669 Invalid, 2796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 2728 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-12-14 09:42:00,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2022-12-14 09:42:00,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1161. [2022-12-14 09:42:00,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 851 states have (on average 1.198589894242068) internal successors, (1020), 864 states have internal predecessors, (1020), 191 states have call successors, (191), 118 states have call predecessors, (191), 118 states have return successors, (191), 178 states have call predecessors, (191), 191 states have call successors, (191) [2022-12-14 09:42:00,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1402 transitions. [2022-12-14 09:42:00,469 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1402 transitions. Word has length 137 [2022-12-14 09:42:00,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:42:00,469 INFO L495 AbstractCegarLoop]: Abstraction has 1161 states and 1402 transitions. [2022-12-14 09:42:00,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 34 states have internal predecessors, (58), 12 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-12-14 09:42:00,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1402 transitions. [2022-12-14 09:42:00,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-14 09:42:00,470 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:42:00,470 INFO L195 NwaCegarLoop]: 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] [2022-12-14 09:42:00,475 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 09:42:00,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:42:00,672 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:42:00,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:42:00,672 INFO L85 PathProgramCache]: Analyzing trace with hash 673102777, now seen corresponding path program 1 times [2022-12-14 09:42:00,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:42:00,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346123170] [2022-12-14 09:42:00,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:42:00,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:42:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:42:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-12-14 09:42:01,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:42:01,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346123170] [2022-12-14 09:42:01,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346123170] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:42:01,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796542745] [2022-12-14 09:42:01,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:42:01,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:42:01,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:42:01,076 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:42:01,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 09:42:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:42:01,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-14 09:42:01,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:42:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 65 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 09:42:01,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:42:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-12-14 09:42:01,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796542745] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:42:01,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [971603455] [2022-12-14 09:42:01,940 INFO L159 IcfgInterpreter]: Started Sifa with 75 locations of interest [2022-12-14 09:42:01,940 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:42:01,940 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:42:01,941 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:42:01,941 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:42:29,877 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 80 for LOIs [2022-12-14 09:42:29,930 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 93 for LOIs [2022-12-14 09:42:29,935 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 113 for LOIs [2022-12-14 09:42:30,011 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 93 for LOIs [2022-12-14 09:42:30,079 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 126 for LOIs [2022-12-14 09:42:30,267 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 92 for LOIs [2022-12-14 09:42:30,288 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:42:57,710 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '83407#(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) (<= 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)) (exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_540| Int)) (and (= (ite (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_540| 0) 0 1) |assert_#in~arg|) (<= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_540| 1) (<= 0 |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_540|))) (<= ~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 [2022-12-14 09:42:57,710 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:42:57,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:42:57,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-12-14 09:42:57,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895923428] [2022-12-14 09:42:57,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:42:57,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 09:42:57,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:42:57,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 09:42:57,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=714, Invalid=6596, Unknown=0, NotChecked=0, Total=7310 [2022-12-14 09:42:57,712 INFO L87 Difference]: Start difference. First operand 1161 states and 1402 transitions. Second operand has 23 states, 23 states have (on average 7.434782608695652) internal successors, (171), 23 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) [2022-12-14 09:43:01,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:43:01,129 INFO L93 Difference]: Finished difference Result 2545 states and 3207 transitions. [2022-12-14 09:43:01,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 09:43:01,130 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.434782608695652) internal successors, (171), 23 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 [2022-12-14 09:43:01,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:43:01,134 INFO L225 Difference]: With dead ends: 2545 [2022-12-14 09:43:01,134 INFO L226 Difference]: Without dead ends: 1776 [2022-12-14 09:43:01,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 332 SyntacticMatches, 9 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4398 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=1156, Invalid=11054, Unknown=0, NotChecked=0, Total=12210 [2022-12-14 09:43:01,136 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 1236 mSDsluCounter, 1780 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 491 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 2096 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 491 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 09:43:01,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 2096 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [491 Valid, 1377 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 09:43:01,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2022-12-14 09:43:01,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1319. [2022-12-14 09:43:01,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 961 states have (on average 1.177939646201873) internal successors, (1132), 972 states have internal predecessors, (1132), 220 states have call successors, (220), 137 states have call predecessors, (220), 137 states have return successors, (220), 209 states have call predecessors, (220), 220 states have call successors, (220) [2022-12-14 09:43:01,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1572 transitions. [2022-12-14 09:43:01,524 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1572 transitions. Word has length 137 [2022-12-14 09:43:01,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:43:01,524 INFO L495 AbstractCegarLoop]: Abstraction has 1319 states and 1572 transitions. [2022-12-14 09:43:01,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.434782608695652) internal successors, (171), 23 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) [2022-12-14 09:43:01,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1572 transitions. [2022-12-14 09:43:01,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-12-14 09:43:01,526 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:43:01,527 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:43:01,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-14 09:43:01,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:43:01,728 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:43:01,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:43:01,729 INFO L85 PathProgramCache]: Analyzing trace with hash 238232212, now seen corresponding path program 1 times [2022-12-14 09:43:01,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:43:01,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585567863] [2022-12-14 09:43:01,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:43:01,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:43:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:43:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-12-14 09:43:02,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:43:02,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585567863] [2022-12-14 09:43:02,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585567863] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:43:02,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063723074] [2022-12-14 09:43:02,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:43:02,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:43:02,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:43:02,052 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:43:02,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 09:43:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:43:02,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 09:43:02,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:43:02,419 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 66 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 09:43:02,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:43:02,695 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-12-14 09:43:02,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063723074] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:43:02,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1373849741] [2022-12-14 09:43:02,696 INFO L159 IcfgInterpreter]: Started Sifa with 75 locations of interest [2022-12-14 09:43:02,697 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:43:02,697 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:43:02,697 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:43:02,697 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:43:42,665 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 84 for LOIs [2022-12-14 09:43:42,722 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 97 for LOIs [2022-12-14 09:43:42,727 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 115 for LOIs [2022-12-14 09:43:42,807 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 97 for LOIs [2022-12-14 09:43:42,875 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 127 for LOIs [2022-12-14 09:43:43,050 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 95 for LOIs [2022-12-14 09:43:43,073 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:44:11,503 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '89447#(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)) (<= 0 ~side2_written~0) (exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_689| Int)) (and (= (ite (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_689| 0) 0 1) |assert_#in~arg|) (<= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_689| 1) (<= 0 |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_689|))) (<= ~manual_selection_History_1~0 127) (= ~s1s1~0 0) (<= 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) (<= ~active_side_History_0~0 2) (= (mod assert_~arg 256) 0) (<= (+ ~nomsg~0 1) 0) (= ~s1s2~0 0) (<= 0 (+ ~cs1_new~0 1)) (<= (+ ~cs1_new~0 1) 0) (= |#NULL.offset| 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 (+ ~cs2_new~0 1)) (= ~cs2~0 0) (<= (+ ~side1_written~0 1) 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 [2022-12-14 09:44:11,503 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:44:11,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:44:11,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 19 [2022-12-14 09:44:11,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639814433] [2022-12-14 09:44:11,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:44:11,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 09:44:11,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:44:11,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 09:44:11,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=773, Invalid=5707, Unknown=0, NotChecked=0, Total=6480 [2022-12-14 09:44:11,504 INFO L87 Difference]: Start difference. First operand 1319 states and 1572 transitions. Second operand has 19 states, 19 states have (on average 8.157894736842104) internal successors, (155), 19 states have internal predecessors, (155), 8 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (35), 8 states have call predecessors, (35), 8 states have call successors, (35) [2022-12-14 09:44:14,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:44:14,542 INFO L93 Difference]: Finished difference Result 4549 states and 6023 transitions. [2022-12-14 09:44:14,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-14 09:44:14,542 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.157894736842104) internal successors, (155), 19 states have internal predecessors, (155), 8 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (35), 8 states have call predecessors, (35), 8 states have call successors, (35) Word has length 139 [2022-12-14 09:44:14,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:44:14,551 INFO L225 Difference]: With dead ends: 4549 [2022-12-14 09:44:14,551 INFO L226 Difference]: Without dead ends: 3590 [2022-12-14 09:44:14,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 342 SyntacticMatches, 9 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4475 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=1270, Invalid=9860, Unknown=0, NotChecked=0, Total=11130 [2022-12-14 09:44:14,555 INFO L413 NwaCegarLoop]: 373 mSDtfsCounter, 1690 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 902 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 2883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 902 IncrementalHoareTripleChecker+Valid, 1981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:44:14,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1690 Valid, 1817 Invalid, 2883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [902 Valid, 1981 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 09:44:14,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2022-12-14 09:44:15,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 2323. [2022-12-14 09:44:15,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2323 states, 1703 states have (on average 1.196124486200822) internal successors, (2037), 1721 states have internal predecessors, (2037), 381 states have call successors, (381), 238 states have call predecessors, (381), 238 states have return successors, (381), 363 states have call predecessors, (381), 381 states have call successors, (381) [2022-12-14 09:44:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 2799 transitions. [2022-12-14 09:44:15,108 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 2799 transitions. Word has length 139 [2022-12-14 09:44:15,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:44:15,108 INFO L495 AbstractCegarLoop]: Abstraction has 2323 states and 2799 transitions. [2022-12-14 09:44:15,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.157894736842104) internal successors, (155), 19 states have internal predecessors, (155), 8 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (35), 8 states have call predecessors, (35), 8 states have call successors, (35) [2022-12-14 09:44:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 2799 transitions. [2022-12-14 09:44:15,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-12-14 09:44:15,110 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:44:15,110 INFO L195 NwaCegarLoop]: 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] [2022-12-14 09:44:15,114 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-14 09:44:15,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-12-14 09:44:15,311 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:44:15,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:44:15,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1231739604, now seen corresponding path program 1 times [2022-12-14 09:44:15,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:44:15,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097409221] [2022-12-14 09:44:15,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:44:15,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:44:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 09:44:15,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 09:44:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 09:44:15,540 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 09:44:15,540 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 09:44:15,541 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-14 09:44:15,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-14 09:44:15,545 INFO L445 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, 1] [2022-12-14 09:44:15,549 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 09:44:15,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 09:44:15 BoogieIcfgContainer [2022-12-14 09:44:15,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 09:44:15,670 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 09:44:15,670 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 09:44:15,670 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 09:44:15,670 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:32:57" (3/4) ... [2022-12-14 09:44:15,671 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 09:44:15,757 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 09:44:15,757 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 09:44:15,758 INFO L158 Benchmark]: Toolchain (without parser) took 679439.01ms. Allocated memory was 146.8MB in the beginning and 645.9MB in the end (delta: 499.1MB). Free memory was 115.3MB in the beginning and 209.4MB in the end (delta: -94.1MB). Peak memory consumption was 407.4MB. Max. memory is 16.1GB. [2022-12-14 09:44:15,758 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 146.8MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 09:44:15,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.13ms. Allocated memory is still 146.8MB. Free memory was 114.9MB in the beginning and 97.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 09:44:15,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.45ms. Allocated memory is still 146.8MB. Free memory was 97.7MB in the beginning and 94.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 09:44:15,758 INFO L158 Benchmark]: Boogie Preprocessor took 25.41ms. Allocated memory is still 146.8MB. Free memory was 94.4MB in the beginning and 91.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 09:44:15,758 INFO L158 Benchmark]: RCFGBuilder took 645.50ms. Allocated memory is still 146.8MB. Free memory was 91.8MB in the beginning and 82.0MB in the end (delta: 9.9MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. [2022-12-14 09:44:15,758 INFO L158 Benchmark]: TraceAbstraction took 678340.61ms. Allocated memory was 146.8MB in the beginning and 645.9MB in the end (delta: 499.1MB). Free memory was 81.4MB in the beginning and 232.7MB in the end (delta: -151.3MB). Peak memory consumption was 347.8MB. Max. memory is 16.1GB. [2022-12-14 09:44:15,759 INFO L158 Benchmark]: Witness Printer took 87.94ms. Allocated memory is still 645.9MB. Free memory was 232.7MB in the beginning and 209.4MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-14 09:44:15,759 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.11ms. Allocated memory is still 146.8MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.13ms. Allocated memory is still 146.8MB. Free memory was 114.9MB in the beginning and 97.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.45ms. Allocated memory is still 146.8MB. Free memory was 97.7MB in the beginning and 94.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.41ms. Allocated memory is still 146.8MB. Free memory was 94.4MB in the beginning and 91.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 645.50ms. Allocated memory is still 146.8MB. Free memory was 91.8MB in the beginning and 82.0MB in the end (delta: 9.9MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. * TraceAbstraction took 678340.61ms. Allocated memory was 146.8MB in the beginning and 645.9MB in the end (delta: 499.1MB). Free memory was 81.4MB in the beginning and 232.7MB in the end (delta: -151.3MB). Peak memory consumption was 347.8MB. Max. memory is 16.1GB. * Witness Printer took 87.94ms. Allocated memory is still 645.9MB. Free memory was 232.7MB in the beginning and 209.4MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. 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] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 [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] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=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] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=-2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=-256, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)0)=-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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=-256, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=-256, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-256, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=-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___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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=2, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=2, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=2, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 [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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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] s2s1_new = nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new [L336] s2s2_new = nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=0, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, index=0, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=-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] 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-1] [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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-1] [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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=0, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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: 678.2s, OverallIterations: 33, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 120.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8795 SdHoareTripleChecker+Valid, 60.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8477 mSDsluCounter, 79971 SdHoareTripleChecker+Invalid, 54.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71116 mSDsCounter, 2720 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40655 IncrementalHoareTripleChecker+Invalid, 43375 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2720 mSolverCounterUnsat, 8855 mSDtfsCounter, 40655 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5104 GetRequests, 3758 SyntacticMatches, 180 SemanticMatches, 1166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28084 ImplicationChecksByTransitivity, 468.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2323occurred in iteration=32, InterpolantAutomatonStates: 607, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 32 MinimizatonAttempts, 5210 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 4273 NumberOfCodeBlocks, 4273 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 5568 ConstructedInterpolants, 0 QuantifiedInterpolants, 21459 SizeOfPredicates, 145 NumberOfNonLiveVariables, 8746 ConjunctsInSsa, 342 ConjunctsInUnsatCore, 66 InterpolantComputations, 16 PerfectInterpolantSequences, 2494/2685 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 34.7s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 54, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 533, DAG_INTERPRETER_EARLY_EXITS: 15, TOOLS_POST_APPLICATIONS: 536, TOOLS_POST_TIME: 9.2s, TOOLS_POST_CALL_APPLICATIONS: 238, TOOLS_POST_CALL_TIME: 10.8s, TOOLS_POST_RETURN_APPLICATIONS: 166, TOOLS_POST_RETURN_TIME: 6.1s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 940, TOOLS_QUANTIFIERELIM_TIME: 25.7s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.6s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 1371, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 250, DOMAIN_JOIN_TIME: 6.9s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 2, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 533, DOMAIN_ISBOTTOM_TIME: 1.3s, LOOP_SUMMARIZER_APPLICATIONS: 2, LOOP_SUMMARIZER_CACHE_MISSES: 2, LOOP_SUMMARIZER_OVERALL_TIME: 1.4s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 1.4s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 2, CALL_SUMMARIZER_APPLICATIONS: 166, CALL_SUMMARIZER_CACHE_MISSES: 44, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.2s, DAG_COMPRESSION_PROCESSED_NODES: 27957, DAG_COMPRESSION_RETAINED_NODES: 1630, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-14 09:44:15,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1376e3cc-c49a-4072-b5fb-ece363ab2114/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE