./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 906036225f588312d23f50dd6f109319810cf1ead43ce885e134bcc5a0be0190 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 03:32:43,316 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 03:32:43,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 03:32:43,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 03:32:43,368 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 03:32:43,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 03:32:43,376 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 03:32:43,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 03:32:43,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 03:32:43,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 03:32:43,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 03:32:43,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 03:32:43,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 03:32:43,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 03:32:43,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 03:32:43,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 03:32:43,411 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 03:32:43,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 03:32:43,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 03:32:43,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 03:32:43,426 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 03:32:43,428 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 03:32:43,432 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 03:32:43,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 03:32:43,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 03:32:43,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 03:32:43,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 03:32:43,443 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 03:32:43,444 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 03:32:43,445 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 03:32:43,446 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 03:32:43,447 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 03:32:43,450 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 03:32:43,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 03:32:43,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 03:32:43,453 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 03:32:43,454 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 03:32:43,454 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 03:32:43,454 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 03:32:43,455 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 03:32:43,456 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 03:32:43,457 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-23 03:32:43,508 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 03:32:43,509 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 03:32:43,510 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 03:32:43,511 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 03:32:43,518 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 03:32:43,519 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 03:32:43,519 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 03:32:43,519 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 03:32:43,520 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 03:32:43,520 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-23 03:32:43,521 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 03:32:43,521 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 03:32:43,522 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-23 03:32:43,522 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-23 03:32:43,522 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 03:32:43,522 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-23 03:32:43,523 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-23 03:32:43,523 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-23 03:32:43,524 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 03:32:43,525 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 03:32:43,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 03:32:43,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 03:32:43,525 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 03:32:43,526 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 03:32:43,526 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 03:32:43,526 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 03:32:43,528 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 03:32:43,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 03:32:43,529 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 03:32:43,529 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 03:32:43,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 03:32:43,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 03:32:43,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 03:32:43,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 03:32:43,531 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 03:32:43,531 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 03:32:43,531 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-23 03:32:43,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 03:32:43,532 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 03:32:43,532 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 03:32:43,532 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 03:32:43,533 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/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_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 906036225f588312d23f50dd6f109319810cf1ead43ce885e134bcc5a0be0190 [2021-11-23 03:32:43,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 03:32:44,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 03:32:44,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 03:32:44,018 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 03:32:44,019 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 03:32:44,021 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2021-11-23 03:32:44,104 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/data/2594b3f62/eaedfff73fa741789c11065b00844f2c/FLAG0abfd4eb6 [2021-11-23 03:32:44,694 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 03:32:44,694 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2021-11-23 03:32:44,713 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/data/2594b3f62/eaedfff73fa741789c11065b00844f2c/FLAG0abfd4eb6 [2021-11-23 03:32:44,971 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/data/2594b3f62/eaedfff73fa741789c11065b00844f2c [2021-11-23 03:32:44,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 03:32:44,978 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 03:32:44,981 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 03:32:44,981 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 03:32:44,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 03:32:44,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:32:44" (1/1) ... [2021-11-23 03:32:44,989 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55fa918b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:32:44, skipping insertion in model container [2021-11-23 03:32:44,989 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:32:44" (1/1) ... [2021-11-23 03:32:44,997 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 03:32:45,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 03:32:45,454 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c[14682,14695] [2021-11-23 03:32:45,457 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 03:32:45,467 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 03:32:45,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c[14682,14695] [2021-11-23 03:32:45,542 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 03:32:45,565 INFO L208 MainTranslator]: Completed translation [2021-11-23 03:32:45,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:32:45 WrapperNode [2021-11-23 03:32:45,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 03:32:45,568 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 03:32:45,568 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 03:32:45,569 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 03:32:45,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:32:45" (1/1) ... [2021-11-23 03:32:45,600 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:32:45" (1/1) ... [2021-11-23 03:32:45,667 INFO L137 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 535 [2021-11-23 03:32:45,668 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 03:32:45,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 03:32:45,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 03:32:45,669 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 03:32:45,688 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:32:45" (1/1) ... [2021-11-23 03:32:45,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:32:45" (1/1) ... [2021-11-23 03:32:45,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:32:45" (1/1) ... [2021-11-23 03:32:45,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:32:45" (1/1) ... [2021-11-23 03:32:45,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:32:45" (1/1) ... [2021-11-23 03:32:45,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:32:45" (1/1) ... [2021-11-23 03:32:45,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:32:45" (1/1) ... [2021-11-23 03:32:45,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 03:32:45,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 03:32:45,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 03:32:45,766 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 03:32:45,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:32:45" (1/1) ... [2021-11-23 03:32:45,779 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 03:32:45,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:32:45,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 03:32:45,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 03:32:45,864 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2021-11-23 03:32:45,864 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2021-11-23 03:32:45,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 03:32:45,864 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2021-11-23 03:32:45,864 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2021-11-23 03:32:45,864 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2021-11-23 03:32:45,865 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2021-11-23 03:32:45,865 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2021-11-23 03:32:45,865 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2021-11-23 03:32:45,865 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-23 03:32:45,865 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-23 03:32:45,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 03:32:45,865 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2021-11-23 03:32:45,866 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2021-11-23 03:32:45,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 03:32:45,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 03:32:45,866 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2021-11-23 03:32:45,867 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2021-11-23 03:32:46,030 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 03:32:46,033 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 03:32:46,837 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 03:32:47,085 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 03:32:47,085 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-23 03:32:47,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:32:47 BoogieIcfgContainer [2021-11-23 03:32:47,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 03:32:47,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 03:32:47,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 03:32:47,095 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 03:32:47,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:32:44" (1/3) ... [2021-11-23 03:32:47,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6884b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:32:47, skipping insertion in model container [2021-11-23 03:32:47,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:32:45" (2/3) ... [2021-11-23 03:32:47,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6884b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:32:47, skipping insertion in model container [2021-11-23 03:32:47,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:32:47" (3/3) ... [2021-11-23 03:32:47,100 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2021-11-23 03:32:47,107 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 03:32:47,107 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-23 03:32:47,169 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 03:32:47,178 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 03:32:47,178 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-23 03:32:47,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 109 states have (on average 1.5412844036697249) internal successors, (168), 111 states have internal predecessors, (168), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2021-11-23 03:32:47,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-23 03:32:47,213 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:32:47,214 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:32:47,214 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:32:47,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:32:47,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1402390635, now seen corresponding path program 1 times [2021-11-23 03:32:47,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:32:47,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393923368] [2021-11-23 03:32:47,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:32:47,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:32:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:32:47,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:32:47,709 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:32:47,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393923368] [2021-11-23 03:32:47,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393923368] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:32:47,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:32:47,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 03:32:47,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695510374] [2021-11-23 03:32:47,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:32:47,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:32:47,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:32:47,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:32:47,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:32:47,767 INFO L87 Difference]: Start difference. First operand has 149 states, 109 states have (on average 1.5412844036697249) internal successors, (168), 111 states have internal predecessors, (168), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-23 03:32:48,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:32:48,020 INFO L93 Difference]: Finished difference Result 298 states and 487 transitions. [2021-11-23 03:32:48,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:32:48,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-11-23 03:32:48,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:32:48,041 INFO L225 Difference]: With dead ends: 298 [2021-11-23 03:32:48,041 INFO L226 Difference]: Without dead ends: 152 [2021-11-23 03:32:48,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:32:48,059 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 5 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:32:48,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 623 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:32:48,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-11-23 03:32:48,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2021-11-23 03:32:48,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 112 states have (on average 1.5089285714285714) internal successors, (169), 113 states have internal predecessors, (169), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2021-11-23 03:32:48,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2021-11-23 03:32:48,130 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 19 [2021-11-23 03:32:48,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:32:48,131 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2021-11-23 03:32:48,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-23 03:32:48,132 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2021-11-23 03:32:48,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-23 03:32:48,135 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:32:48,135 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:32:48,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 03:32:48,136 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:32:48,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:32:48,145 INFO L85 PathProgramCache]: Analyzing trace with hash 698242933, now seen corresponding path program 1 times [2021-11-23 03:32:48,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:32:48,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607471833] [2021-11-23 03:32:48,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:32:48,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:32:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:32:48,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 03:32:48,308 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:32:48,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607471833] [2021-11-23 03:32:48,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607471833] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:32:48,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:32:48,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 03:32:48,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204884637] [2021-11-23 03:32:48,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:32:48,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 03:32:48,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:32:48,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 03:32:48,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:32:48,313 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 03:32:48,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:32:48,755 INFO L93 Difference]: Finished difference Result 432 states and 672 transitions. [2021-11-23 03:32:48,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 03:32:48,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2021-11-23 03:32:48,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:32:48,768 INFO L225 Difference]: With dead ends: 432 [2021-11-23 03:32:48,769 INFO L226 Difference]: Without dead ends: 283 [2021-11-23 03:32:48,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-23 03:32:48,779 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 566 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 03:32:48,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [566 Valid, 593 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 03:32:48,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-11-23 03:32:48,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 186. [2021-11-23 03:32:48,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 141 states have (on average 1.5106382978723405) internal successors, (213), 141 states have internal predecessors, (213), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2021-11-23 03:32:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 281 transitions. [2021-11-23 03:32:48,829 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 281 transitions. Word has length 30 [2021-11-23 03:32:48,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:32:48,834 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 281 transitions. [2021-11-23 03:32:48,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 03:32:48,835 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 281 transitions. [2021-11-23 03:32:48,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-23 03:32:48,836 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:32:48,837 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:32:48,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 03:32:48,837 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:32:48,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:32:48,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1421239568, now seen corresponding path program 1 times [2021-11-23 03:32:48,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:32:48,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726065061] [2021-11-23 03:32:48,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:32:48,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:32:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:32:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 03:32:49,028 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:32:49,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726065061] [2021-11-23 03:32:49,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726065061] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:32:49,030 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:32:49,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 03:32:49,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26610089] [2021-11-23 03:32:49,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:32:49,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 03:32:49,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:32:49,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 03:32:49,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:32:49,034 INFO L87 Difference]: Start difference. First operand 186 states and 281 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 03:32:49,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:32:49,433 INFO L93 Difference]: Finished difference Result 432 states and 670 transitions. [2021-11-23 03:32:49,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 03:32:49,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2021-11-23 03:32:49,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:32:49,439 INFO L225 Difference]: With dead ends: 432 [2021-11-23 03:32:49,439 INFO L226 Difference]: Without dead ends: 283 [2021-11-23 03:32:49,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-23 03:32:49,452 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 562 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 03:32:49,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [562 Valid, 596 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 03:32:49,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-11-23 03:32:49,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 186. [2021-11-23 03:32:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 141 states have (on average 1.50354609929078) internal successors, (212), 141 states have internal predecessors, (212), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2021-11-23 03:32:49,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 280 transitions. [2021-11-23 03:32:49,539 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 280 transitions. Word has length 31 [2021-11-23 03:32:49,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:32:49,540 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 280 transitions. [2021-11-23 03:32:49,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 03:32:49,540 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 280 transitions. [2021-11-23 03:32:49,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-23 03:32:49,542 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:32:49,545 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:32:49,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 03:32:49,546 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:32:49,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:32:49,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1401044311, now seen corresponding path program 1 times [2021-11-23 03:32:49,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:32:49,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78726877] [2021-11-23 03:32:49,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:32:49,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:32:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:32:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 03:32:49,750 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:32:49,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78726877] [2021-11-23 03:32:49,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78726877] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:32:49,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:32:49,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 03:32:49,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968948046] [2021-11-23 03:32:49,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:32:49,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:32:49,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:32:49,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:32:49,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:32:49,755 INFO L87 Difference]: Start difference. First operand 186 states and 280 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-23 03:32:49,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:32:49,864 INFO L93 Difference]: Finished difference Result 340 states and 514 transitions. [2021-11-23 03:32:49,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:32:49,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2021-11-23 03:32:49,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:32:49,870 INFO L225 Difference]: With dead ends: 340 [2021-11-23 03:32:49,870 INFO L226 Difference]: Without dead ends: 191 [2021-11-23 03:32:49,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:32:49,880 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 6 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:32:49,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 635 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:32:49,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-11-23 03:32:49,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2021-11-23 03:32:49,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 145 states have (on average 1.4896551724137932) internal successors, (216), 145 states have internal predecessors, (216), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2021-11-23 03:32:49,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 284 transitions. [2021-11-23 03:32:49,927 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 284 transitions. Word has length 33 [2021-11-23 03:32:49,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:32:49,928 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 284 transitions. [2021-11-23 03:32:49,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-23 03:32:49,930 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 284 transitions. [2021-11-23 03:32:49,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-23 03:32:49,938 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:32:49,938 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:32:49,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 03:32:49,938 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:32:49,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:32:49,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1975676803, now seen corresponding path program 1 times [2021-11-23 03:32:49,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:32:49,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100633535] [2021-11-23 03:32:49,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:32:49,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:32:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:32:50,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 03:32:50,072 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:32:50,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100633535] [2021-11-23 03:32:50,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100633535] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:32:50,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:32:50,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 03:32:50,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603001621] [2021-11-23 03:32:50,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:32:50,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:32:50,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:32:50,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:32:50,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:32:50,075 INFO L87 Difference]: Start difference. First operand 191 states and 284 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-23 03:32:50,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:32:50,201 INFO L93 Difference]: Finished difference Result 350 states and 525 transitions. [2021-11-23 03:32:50,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:32:50,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2021-11-23 03:32:50,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:32:50,205 INFO L225 Difference]: With dead ends: 350 [2021-11-23 03:32:50,209 INFO L226 Difference]: Without dead ends: 196 [2021-11-23 03:32:50,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:32:50,211 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 6 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:32:50,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 621 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:32:50,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-11-23 03:32:50,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2021-11-23 03:32:50,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 149 states have (on average 1.476510067114094) internal successors, (220), 149 states have internal predecessors, (220), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2021-11-23 03:32:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 288 transitions. [2021-11-23 03:32:50,239 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 288 transitions. Word has length 41 [2021-11-23 03:32:50,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:32:50,242 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 288 transitions. [2021-11-23 03:32:50,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-23 03:32:50,242 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 288 transitions. [2021-11-23 03:32:50,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-23 03:32:50,248 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:32:50,248 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:32:50,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 03:32:50,249 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:32:50,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:32:50,250 INFO L85 PathProgramCache]: Analyzing trace with hash -819289017, now seen corresponding path program 1 times [2021-11-23 03:32:50,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:32:50,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146025324] [2021-11-23 03:32:50,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:32:50,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:32:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:32:50,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 03:32:50,374 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:32:50,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146025324] [2021-11-23 03:32:50,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146025324] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:32:50,374 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:32:50,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 03:32:50,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25996999] [2021-11-23 03:32:50,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:32:50,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:32:50,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:32:50,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:32:50,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:32:50,377 INFO L87 Difference]: Start difference. First operand 196 states and 288 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-23 03:32:50,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:32:50,484 INFO L93 Difference]: Finished difference Result 359 states and 529 transitions. [2021-11-23 03:32:50,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:32:50,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 49 [2021-11-23 03:32:50,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:32:50,489 INFO L225 Difference]: With dead ends: 359 [2021-11-23 03:32:50,489 INFO L226 Difference]: Without dead ends: 200 [2021-11-23 03:32:50,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:32:50,492 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 5 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:32:50,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 630 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:32:50,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-11-23 03:32:50,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2021-11-23 03:32:50,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 152 states have internal predecessors, (223), 34 states have call successors, (34), 13 states have call predecessors, (34), 13 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2021-11-23 03:32:50,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 291 transitions. [2021-11-23 03:32:50,515 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 291 transitions. Word has length 49 [2021-11-23 03:32:50,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:32:50,516 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 291 transitions. [2021-11-23 03:32:50,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-23 03:32:50,516 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 291 transitions. [2021-11-23 03:32:50,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-23 03:32:50,518 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:32:50,518 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:32:50,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-23 03:32:50,519 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:32:50,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:32:50,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1577170286, now seen corresponding path program 1 times [2021-11-23 03:32:50,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:32:50,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732833763] [2021-11-23 03:32:50,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:32:50,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:32:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:32:50,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 03:32:50,690 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:32:50,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732833763] [2021-11-23 03:32:50,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732833763] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:32:50,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:32:50,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 03:32:50,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190292928] [2021-11-23 03:32:50,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:32:50,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:32:50,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:32:50,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:32:50,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:32:50,693 INFO L87 Difference]: Start difference. First operand 200 states and 291 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-23 03:32:50,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:32:50,781 INFO L93 Difference]: Finished difference Result 368 states and 539 transitions. [2021-11-23 03:32:50,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:32:50,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 49 [2021-11-23 03:32:50,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:32:50,784 INFO L225 Difference]: With dead ends: 368 [2021-11-23 03:32:50,785 INFO L226 Difference]: Without dead ends: 205 [2021-11-23 03:32:50,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:32:50,787 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 6 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:32:50,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 621 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:32:50,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-11-23 03:32:50,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2021-11-23 03:32:50,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 156 states have (on average 1.455128205128205) internal successors, (227), 156 states have internal predecessors, (227), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2021-11-23 03:32:50,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 295 transitions. [2021-11-23 03:32:50,806 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 295 transitions. Word has length 49 [2021-11-23 03:32:50,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:32:50,807 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 295 transitions. [2021-11-23 03:32:50,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-23 03:32:50,807 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 295 transitions. [2021-11-23 03:32:50,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-23 03:32:50,809 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:32:50,809 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:32:50,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-23 03:32:50,809 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:32:50,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:32:50,810 INFO L85 PathProgramCache]: Analyzing trace with hash 46065614, now seen corresponding path program 1 times [2021-11-23 03:32:50,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:32:50,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215940732] [2021-11-23 03:32:50,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:32:50,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:32:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:32:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-23 03:32:50,908 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:32:50,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215940732] [2021-11-23 03:32:50,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215940732] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:32:50,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:32:50,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 03:32:50,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561685170] [2021-11-23 03:32:50,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:32:50,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:32:50,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:32:50,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:32:50,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:32:50,911 INFO L87 Difference]: Start difference. First operand 205 states and 295 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-23 03:32:50,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:32:50,994 INFO L93 Difference]: Finished difference Result 379 states and 546 transitions. [2021-11-23 03:32:50,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:32:50,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 57 [2021-11-23 03:32:50,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:32:50,998 INFO L225 Difference]: With dead ends: 379 [2021-11-23 03:32:50,999 INFO L226 Difference]: Without dead ends: 211 [2021-11-23 03:32:51,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:32:51,000 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 7 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:32:51,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 632 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:32:51,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-11-23 03:32:51,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2021-11-23 03:32:51,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 161 states have (on average 1.4409937888198758) internal successors, (232), 161 states have internal predecessors, (232), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2021-11-23 03:32:51,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 300 transitions. [2021-11-23 03:32:51,020 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 300 transitions. Word has length 57 [2021-11-23 03:32:51,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:32:51,021 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 300 transitions. [2021-11-23 03:32:51,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-23 03:32:51,022 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 300 transitions. [2021-11-23 03:32:51,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-23 03:32:51,023 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:32:51,023 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:32:51,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-23 03:32:51,024 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:32:51,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:32:51,024 INFO L85 PathProgramCache]: Analyzing trace with hash 202306747, now seen corresponding path program 1 times [2021-11-23 03:32:51,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:32:51,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951774434] [2021-11-23 03:32:51,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:32:51,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:32:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:32:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 03:32:51,338 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:32:51,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951774434] [2021-11-23 03:32:51,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951774434] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:32:51,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433293672] [2021-11-23 03:32:51,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:32:51,339 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:32:51,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:32:51,347 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:32:51,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 03:32:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:32:51,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-23 03:32:51,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:32:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 03:32:52,071 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 03:32:52,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433293672] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:32:52,072 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 03:32:52,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2021-11-23 03:32:52,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297367302] [2021-11-23 03:32:52,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:32:52,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 03:32:52,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:32:52,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 03:32:52,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-23 03:32:52,074 INFO L87 Difference]: Start difference. First operand 211 states and 300 transitions. Second operand has 8 states, 6 states have (on average 7.5) internal successors, (45), 8 states have internal predecessors, (45), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-23 03:32:52,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:32:52,466 INFO L93 Difference]: Finished difference Result 598 states and 836 transitions. [2021-11-23 03:32:52,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 03:32:52,467 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.5) internal successors, (45), 8 states have internal predecessors, (45), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 60 [2021-11-23 03:32:52,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:32:52,473 INFO L225 Difference]: With dead ends: 598 [2021-11-23 03:32:52,473 INFO L226 Difference]: Without dead ends: 398 [2021-11-23 03:32:52,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-11-23 03:32:52,477 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 222 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 03:32:52,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 1144 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 03:32:52,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-11-23 03:32:52,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 395. [2021-11-23 03:32:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 299 states have (on average 1.4214046822742474) internal successors, (425), 300 states have internal predecessors, (425), 65 states have call successors, (65), 30 states have call predecessors, (65), 30 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2021-11-23 03:32:52,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 555 transitions. [2021-11-23 03:32:52,515 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 555 transitions. Word has length 60 [2021-11-23 03:32:52,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:32:52,516 INFO L470 AbstractCegarLoop]: Abstraction has 395 states and 555 transitions. [2021-11-23 03:32:52,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.5) internal successors, (45), 8 states have internal predecessors, (45), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-23 03:32:52,516 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 555 transitions. [2021-11-23 03:32:52,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-23 03:32:52,519 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:32:52,519 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:32:52,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 03:32:52,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-11-23 03:32:52,747 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:32:52,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:32:52,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1935039856, now seen corresponding path program 1 times [2021-11-23 03:32:52,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:32:52,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375313063] [2021-11-23 03:32:52,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:32:52,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:32:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:32:53,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 03:32:53,114 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:32:53,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375313063] [2021-11-23 03:32:53,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375313063] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:32:53,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226383814] [2021-11-23 03:32:53,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:32:53,115 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:32:53,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:32:53,119 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:32:53,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 03:32:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:32:53,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-23 03:32:53,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:32:53,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:32:53,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:32:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 03:32:54,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226383814] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:32:54,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [110839350] [2021-11-23 03:32:54,287 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2021-11-23 03:32:54,287 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:32:54,293 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 03:32:54,301 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 03:32:54,301 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 03:32:59,165 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 111 for LOIs [2021-11-23 03:32:59,362 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 108 for LOIs [2021-11-23 03:32:59,385 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 104 for LOIs [2021-11-23 03:32:59,476 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 03:33:16,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [110839350] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:33:16,233 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:33:16,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [9, 9, 9] total 37 [2021-11-23 03:33:16,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387064353] [2021-11-23 03:33:16,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:33:16,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-23 03:33:16,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:33:16,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-23 03:33:16,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1200, Unknown=0, NotChecked=0, Total=1332 [2021-11-23 03:33:16,237 INFO L87 Difference]: Start difference. First operand 395 states and 555 transitions. Second operand has 26 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 18 states have internal predecessors, (43), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-23 03:33:23,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:33:23,136 INFO L93 Difference]: Finished difference Result 819 states and 1158 transitions. [2021-11-23 03:33:23,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-23 03:33:23,136 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 18 states have internal predecessors, (43), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 62 [2021-11-23 03:33:23,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:33:23,142 INFO L225 Difference]: With dead ends: 819 [2021-11-23 03:33:23,142 INFO L226 Difference]: Without dead ends: 464 [2021-11-23 03:33:23,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 151 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=155, Invalid=1405, Unknown=0, NotChecked=0, Total=1560 [2021-11-23 03:33:23,145 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 134 mSDsluCounter, 3259 mSDsCounter, 0 mSdLazyCounter, 2070 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 3521 SdHoareTripleChecker+Invalid, 2123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2021-11-23 03:33:23,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 3521 Invalid, 2123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2070 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2021-11-23 03:33:23,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-11-23 03:33:23,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 441. [2021-11-23 03:33:23,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 330 states have (on average 1.4) internal successors, (462), 331 states have internal predecessors, (462), 78 states have call successors, (78), 32 states have call predecessors, (78), 32 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2021-11-23 03:33:23,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 618 transitions. [2021-11-23 03:33:23,199 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 618 transitions. Word has length 62 [2021-11-23 03:33:23,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:33:23,199 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 618 transitions. [2021-11-23 03:33:23,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 18 states have internal predecessors, (43), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-23 03:33:23,200 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 618 transitions. [2021-11-23 03:33:23,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-23 03:33:23,201 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:33:23,201 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:33:23,237 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-23 03:33:23,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-23 03:33:23,427 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:33:23,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:33:23,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1493661489, now seen corresponding path program 1 times [2021-11-23 03:33:23,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:33:23,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431014835] [2021-11-23 03:33:23,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:33:23,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:33:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:33:23,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 03:33:23,636 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:33:23,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431014835] [2021-11-23 03:33:23,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431014835] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:33:23,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239383267] [2021-11-23 03:33:23,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:33:23,637 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:33:23,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:33:23,638 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:33:23,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-23 03:33:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:33:23,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-23 03:33:23,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:33:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:33:24,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:33:24,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 03:33:24,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239383267] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:33:24,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [614741303] [2021-11-23 03:33:24,358 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2021-11-23 03:33:24,358 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:33:24,360 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 03:33:24,360 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 03:33:24,360 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 03:33:42,340 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 174 for LOIs [2021-11-23 03:33:43,929 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 12 for LOIs [2021-11-23 03:33:43,940 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 21 for LOIs [2021-11-23 03:33:43,952 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 30 for LOIs [2021-11-23 03:33:43,961 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 26 for LOIs [2021-11-23 03:33:43,982 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 15 for LOIs [2021-11-23 03:33:43,988 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 03:33:57,747 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10108#(and (= |assert_#in~arg| 0) (<= ~manual_selection_History_1~0 127) (<= ~active_side_History_1~0 127) (<= 0 ~active_side_History_0~0) (= assert_~arg |assert_#in~arg|) (not (= (mod ~side1Failed_History_1~0 256) 0)) (= (mod ~side2Failed_History_1~0 256) 0) (<= ~active_side_History_0~0 2) (not (= 2 ~active_side_History_0~0)) (not (= ~manual_selection_History_1~0 0)) (<= 0 (+ ~manual_selection_History_1~0 128)) (<= 0 (+ ~active_side_History_1~0 128)))' at error location [2021-11-23 03:33:57,747 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 03:33:57,748 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:33:57,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2021-11-23 03:33:57,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285229142] [2021-11-23 03:33:57,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:33:57,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-23 03:33:57,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:33:57,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-23 03:33:57,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2829, Unknown=0, NotChecked=0, Total=3080 [2021-11-23 03:33:57,751 INFO L87 Difference]: Start difference. First operand 441 states and 618 transitions. Second operand has 13 states, 9 states have (on average 7.444444444444445) internal successors, (67), 12 states have internal predecessors, (67), 4 states have call successors, (15), 3 states have call predecessors, (15), 8 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2021-11-23 03:33:58,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:33:58,392 INFO L93 Difference]: Finished difference Result 1153 states and 1628 transitions. [2021-11-23 03:33:58,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-23 03:33:58,393 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 7.444444444444445) internal successors, (67), 12 states have internal predecessors, (67), 4 states have call successors, (15), 3 states have call predecessors, (15), 8 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 62 [2021-11-23 03:33:58,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:33:58,400 INFO L225 Difference]: With dead ends: 1153 [2021-11-23 03:33:58,401 INFO L226 Difference]: Without dead ends: 795 [2021-11-23 03:33:58,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 130 SyntacticMatches, 9 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=277, Invalid=3383, Unknown=0, NotChecked=0, Total=3660 [2021-11-23 03:33:58,405 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 269 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 2131 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 03:33:58,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 2131 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 03:33:58,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2021-11-23 03:33:58,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 496. [2021-11-23 03:33:58,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 369 states have (on average 1.3712737127371273) internal successors, (506), 372 states have internal predecessors, (506), 84 states have call successors, (84), 42 states have call predecessors, (84), 42 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2021-11-23 03:33:58,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 674 transitions. [2021-11-23 03:33:58,478 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 674 transitions. Word has length 62 [2021-11-23 03:33:58,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:33:58,478 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 674 transitions. [2021-11-23 03:33:58,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 7.444444444444445) internal successors, (67), 12 states have internal predecessors, (67), 4 states have call successors, (15), 3 states have call predecessors, (15), 8 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2021-11-23 03:33:58,479 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 674 transitions. [2021-11-23 03:33:58,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-23 03:33:58,480 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:33:58,481 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:33:58,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-23 03:33:58,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:33:58,694 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:33:58,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:33:58,695 INFO L85 PathProgramCache]: Analyzing trace with hash 372001254, now seen corresponding path program 1 times [2021-11-23 03:33:58,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:33:58,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466994752] [2021-11-23 03:33:58,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:33:58,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:33:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:33:58,771 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 03:33:58,771 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:33:58,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466994752] [2021-11-23 03:33:58,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466994752] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:33:58,772 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:33:58,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 03:33:58,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584339211] [2021-11-23 03:33:58,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:33:58,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:33:58,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:33:58,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:33:58,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:33:58,774 INFO L87 Difference]: Start difference. First operand 496 states and 674 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-23 03:33:58,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:33:58,886 INFO L93 Difference]: Finished difference Result 905 states and 1235 transitions. [2021-11-23 03:33:58,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:33:58,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 66 [2021-11-23 03:33:58,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:33:58,891 INFO L225 Difference]: With dead ends: 905 [2021-11-23 03:33:58,892 INFO L226 Difference]: Without dead ends: 508 [2021-11-23 03:33:58,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:33:58,894 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 5 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:33:58,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 630 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:33:58,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-11-23 03:33:58,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2021-11-23 03:33:58,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 378 states have (on average 1.3624338624338623) internal successors, (515), 381 states have internal predecessors, (515), 84 states have call successors, (84), 45 states have call predecessors, (84), 45 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2021-11-23 03:33:58,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 683 transitions. [2021-11-23 03:33:58,959 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 683 transitions. Word has length 66 [2021-11-23 03:33:58,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:33:58,960 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 683 transitions. [2021-11-23 03:33:58,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-23 03:33:58,960 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 683 transitions. [2021-11-23 03:33:58,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-23 03:33:58,961 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:33:58,962 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:33:58,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-23 03:33:58,962 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:33:58,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:33:58,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1950784243, now seen corresponding path program 1 times [2021-11-23 03:33:58,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:33:58,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135969429] [2021-11-23 03:33:58,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:33:58,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:33:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:33:59,049 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-23 03:33:59,050 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:33:59,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135969429] [2021-11-23 03:33:59,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135969429] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:33:59,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:33:59,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 03:33:59,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638043599] [2021-11-23 03:33:59,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:33:59,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 03:33:59,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:33:59,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 03:33:59,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:33:59,053 INFO L87 Difference]: Start difference. First operand 508 states and 683 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-23 03:33:59,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:33:59,307 INFO L93 Difference]: Finished difference Result 640 states and 893 transitions. [2021-11-23 03:33:59,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 03:33:59,308 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 65 [2021-11-23 03:33:59,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:33:59,314 INFO L225 Difference]: With dead ends: 640 [2021-11-23 03:33:59,314 INFO L226 Difference]: Without dead ends: 638 [2021-11-23 03:33:59,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-23 03:33:59,316 INFO L933 BasicCegarLoop]: 382 mSDtfsCounter, 171 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:33:59,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 1698 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:33:59,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2021-11-23 03:33:59,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 512. [2021-11-23 03:33:59,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 380 states have (on average 1.3605263157894736) internal successors, (517), 384 states have internal predecessors, (517), 85 states have call successors, (85), 46 states have call predecessors, (85), 46 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2021-11-23 03:33:59,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 687 transitions. [2021-11-23 03:33:59,393 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 687 transitions. Word has length 65 [2021-11-23 03:33:59,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:33:59,393 INFO L470 AbstractCegarLoop]: Abstraction has 512 states and 687 transitions. [2021-11-23 03:33:59,394 INFO L471 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-23 03:33:59,394 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 687 transitions. [2021-11-23 03:33:59,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-23 03:33:59,402 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:33:59,402 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:33:59,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-23 03:33:59,402 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:33:59,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:33:59,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1894530078, now seen corresponding path program 1 times [2021-11-23 03:33:59,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:33:59,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143388423] [2021-11-23 03:33:59,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:33:59,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:33:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:33:59,487 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-23 03:33:59,487 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:33:59,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143388423] [2021-11-23 03:33:59,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143388423] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:33:59,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:33:59,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 03:33:59,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74734407] [2021-11-23 03:33:59,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:33:59,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:33:59,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:33:59,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:33:59,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:33:59,490 INFO L87 Difference]: Start difference. First operand 512 states and 687 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, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-23 03:33:59,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:33:59,605 INFO L93 Difference]: Finished difference Result 831 states and 1118 transitions. [2021-11-23 03:33:59,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:33:59,606 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, (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 68 [2021-11-23 03:33:59,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:33:59,613 INFO L225 Difference]: With dead ends: 831 [2021-11-23 03:33:59,613 INFO L226 Difference]: Without dead ends: 506 [2021-11-23 03:33:59,614 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:33:59,615 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 7 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 03:33:59,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 622 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 03:33:59,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2021-11-23 03:33:59,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2021-11-23 03:33:59,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 377 states have (on average 1.339522546419098) internal successors, (505), 381 states have internal predecessors, (505), 82 states have call successors, (82), 46 states have call predecessors, (82), 46 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2021-11-23 03:33:59,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 669 transitions. [2021-11-23 03:33:59,676 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 669 transitions. Word has length 68 [2021-11-23 03:33:59,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:33:59,677 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 669 transitions. [2021-11-23 03:33:59,677 INFO L471 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, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-23 03:33:59,677 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 669 transitions. [2021-11-23 03:33:59,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-23 03:33:59,679 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:33:59,679 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:33:59,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-23 03:33:59,680 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:33:59,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:33:59,680 INFO L85 PathProgramCache]: Analyzing trace with hash 359885845, now seen corresponding path program 1 times [2021-11-23 03:33:59,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:33:59,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508248648] [2021-11-23 03:33:59,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:33:59,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:33:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 03:34:00,060 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:34:00,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508248648] [2021-11-23 03:34:00,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508248648] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:34:00,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243287609] [2021-11-23 03:34:00,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:00,061 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:34:00,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:34:00,063 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:34:00,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-23 03:34:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:00,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-23 03:34:00,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:34:00,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 03:34:00,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:34:00,949 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 03:34:00,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243287609] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:34:00,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1928976184] [2021-11-23 03:34:00,954 INFO L159 IcfgInterpreter]: Started Sifa with 60 locations of interest [2021-11-23 03:34:00,954 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:34:00,955 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 03:34:00,955 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 03:34:00,955 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 03:34:19,071 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 174 for LOIs [2021-11-23 03:34:20,671 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 16 for LOIs [2021-11-23 03:34:20,673 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 30 for LOIs [2021-11-23 03:34:20,688 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 31 for LOIs [2021-11-23 03:34:20,700 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 25 for LOIs [2021-11-23 03:34:20,713 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 15 for LOIs [2021-11-23 03:34:20,720 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 03:34:35,941 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '17904#(and (= |assert_#in~arg| 0) (<= ~manual_selection_History_1~0 127) (<= ~active_side_History_1~0 127) (not (= ~active_side_History_0~0 1)) (<= 0 ~active_side_History_0~0) (= assert_~arg |assert_#in~arg|) (<= ~active_side_History_0~0 2) (not (= (mod ~side2Failed_History_1~0 256) 0)) (not (= ~manual_selection_History_1~0 0)) (<= 0 (+ ~manual_selection_History_1~0 128)) (<= 0 (+ ~active_side_History_1~0 128)) (= (mod ~side1Failed_History_1~0 256) 0))' at error location [2021-11-23 03:34:35,941 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 03:34:35,942 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:34:35,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 20 [2021-11-23 03:34:35,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951147033] [2021-11-23 03:34:35,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:34:35,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-23 03:34:35,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:34:35,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-23 03:34:35,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=3859, Unknown=0, NotChecked=0, Total=4160 [2021-11-23 03:34:35,946 INFO L87 Difference]: Start difference. First operand 506 states and 669 transitions. Second operand has 20 states, 15 states have (on average 6.0) internal successors, (90), 18 states have internal predecessors, (90), 6 states have call successors, (22), 3 states have call predecessors, (22), 9 states have return successors, (22), 7 states have call predecessors, (22), 6 states have call successors, (22) [2021-11-23 03:34:37,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:34:37,241 INFO L93 Difference]: Finished difference Result 1124 states and 1550 transitions. [2021-11-23 03:34:37,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-23 03:34:37,242 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 6.0) internal successors, (90), 18 states have internal predecessors, (90), 6 states have call successors, (22), 3 states have call predecessors, (22), 9 states have return successors, (22), 7 states have call predecessors, (22), 6 states have call successors, (22) Word has length 70 [2021-11-23 03:34:37,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:34:37,251 INFO L225 Difference]: With dead ends: 1124 [2021-11-23 03:34:37,252 INFO L226 Difference]: Without dead ends: 755 [2021-11-23 03:34:37,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 148 SyntacticMatches, 11 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1592 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=352, Invalid=4760, Unknown=0, NotChecked=0, Total=5112 [2021-11-23 03:34:37,259 INFO L933 BasicCegarLoop]: 365 mSDtfsCounter, 564 mSDsluCounter, 4237 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 4389 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-23 03:34:37,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [599 Valid, 4389 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-23 03:34:37,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2021-11-23 03:34:37,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 512. [2021-11-23 03:34:37,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 382 states have (on average 1.3350785340314135) internal successors, (510), 387 states have internal predecessors, (510), 80 states have call successors, (80), 49 states have call predecessors, (80), 49 states have return successors, (80), 75 states have call predecessors, (80), 80 states have call successors, (80) [2021-11-23 03:34:37,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 670 transitions. [2021-11-23 03:34:37,328 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 670 transitions. Word has length 70 [2021-11-23 03:34:37,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:34:37,329 INFO L470 AbstractCegarLoop]: Abstraction has 512 states and 670 transitions. [2021-11-23 03:34:37,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 6.0) internal successors, (90), 18 states have internal predecessors, (90), 6 states have call successors, (22), 3 states have call predecessors, (22), 9 states have return successors, (22), 7 states have call predecessors, (22), 6 states have call successors, (22) [2021-11-23 03:34:37,329 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 670 transitions. [2021-11-23 03:34:37,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-23 03:34:37,331 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:34:37,331 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:34:37,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-23 03:34:37,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:34:37,549 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:34:37,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:34:37,549 INFO L85 PathProgramCache]: Analyzing trace with hash -992035311, now seen corresponding path program 1 times [2021-11-23 03:34:37,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:34:37,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686144131] [2021-11-23 03:34:37,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:37,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:34:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:37,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 03:34:37,678 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:34:37,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686144131] [2021-11-23 03:34:37,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686144131] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:34:37,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:34:37,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 03:34:37,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336777207] [2021-11-23 03:34:37,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:34:37,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 03:34:37,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:34:37,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 03:34:37,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-23 03:34:37,681 INFO L87 Difference]: Start difference. First operand 512 states and 670 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-23 03:34:38,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:34:38,450 INFO L93 Difference]: Finished difference Result 1210 states and 1663 transitions. [2021-11-23 03:34:38,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 03:34:38,451 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 71 [2021-11-23 03:34:38,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:34:38,458 INFO L225 Difference]: With dead ends: 1210 [2021-11-23 03:34:38,459 INFO L226 Difference]: Without dead ends: 901 [2021-11-23 03:34:38,460 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:34:38,461 INFO L933 BasicCegarLoop]: 430 mSDtfsCounter, 705 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-23 03:34:38,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [711 Valid, 1739 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-23 03:34:38,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2021-11-23 03:34:38,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 639. [2021-11-23 03:34:38,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 474 states have (on average 1.3291139240506329) internal successors, (630), 479 states have internal predecessors, (630), 103 states have call successors, (103), 61 states have call predecessors, (103), 61 states have return successors, (103), 98 states have call predecessors, (103), 103 states have call successors, (103) [2021-11-23 03:34:38,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 836 transitions. [2021-11-23 03:34:38,549 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 836 transitions. Word has length 71 [2021-11-23 03:34:38,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:34:38,551 INFO L470 AbstractCegarLoop]: Abstraction has 639 states and 836 transitions. [2021-11-23 03:34:38,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-23 03:34:38,552 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 836 transitions. [2021-11-23 03:34:38,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-23 03:34:38,554 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:34:38,555 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:34:38,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-23 03:34:38,555 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:34:38,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:34:38,556 INFO L85 PathProgramCache]: Analyzing trace with hash -2067927662, now seen corresponding path program 1 times [2021-11-23 03:34:38,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:34:38,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33192717] [2021-11-23 03:34:38,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:38,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:34:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:38,609 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 03:34:38,610 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:34:38,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33192717] [2021-11-23 03:34:38,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33192717] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:34:38,611 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:34:38,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 03:34:38,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89597508] [2021-11-23 03:34:38,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:34:38,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:34:38,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:34:38,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:34:38,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:34:38,613 INFO L87 Difference]: Start difference. First operand 639 states and 836 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-23 03:34:38,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:34:38,912 INFO L93 Difference]: Finished difference Result 1597 states and 2132 transitions. [2021-11-23 03:34:38,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 03:34:38,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2021-11-23 03:34:38,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:34:38,921 INFO L225 Difference]: With dead ends: 1597 [2021-11-23 03:34:38,922 INFO L226 Difference]: Without dead ends: 1156 [2021-11-23 03:34:38,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:34:38,924 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 339 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:34:38,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 809 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:34:38,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2021-11-23 03:34:39,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1038. [2021-11-23 03:34:39,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 769 states have (on average 1.319895968790637) internal successors, (1015), 778 states have internal predecessors, (1015), 168 states have call successors, (168), 100 states have call predecessors, (168), 100 states have return successors, (168), 159 states have call predecessors, (168), 168 states have call successors, (168) [2021-11-23 03:34:39,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1351 transitions. [2021-11-23 03:34:39,055 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1351 transitions. Word has length 71 [2021-11-23 03:34:39,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:34:39,056 INFO L470 AbstractCegarLoop]: Abstraction has 1038 states and 1351 transitions. [2021-11-23 03:34:39,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-23 03:34:39,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1351 transitions. [2021-11-23 03:34:39,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-23 03:34:39,058 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:34:39,058 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:34:39,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-23 03:34:39,059 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:34:39,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:34:39,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2033385991, now seen corresponding path program 1 times [2021-11-23 03:34:39,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:34:39,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641507918] [2021-11-23 03:34:39,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:39,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:34:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:34:39,201 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 03:34:39,201 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:34:39,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641507918] [2021-11-23 03:34:39,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641507918] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:34:39,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:34:39,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 03:34:39,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796865686] [2021-11-23 03:34:39,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:34:39,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 03:34:39,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:34:39,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 03:34:39,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-23 03:34:39,204 INFO L87 Difference]: Start difference. First operand 1038 states and 1351 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-11-23 03:34:40,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:34:40,191 INFO L93 Difference]: Finished difference Result 2933 states and 3981 transitions. [2021-11-23 03:34:40,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 03:34:40,192 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2021-11-23 03:34:40,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:34:40,208 INFO L225 Difference]: With dead ends: 2933 [2021-11-23 03:34:40,208 INFO L226 Difference]: Without dead ends: 2149 [2021-11-23 03:34:40,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-11-23 03:34:40,212 INFO L933 BasicCegarLoop]: 442 mSDtfsCounter, 771 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-23 03:34:40,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [777 Valid, 1829 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-23 03:34:40,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2149 states. [2021-11-23 03:34:40,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2149 to 1453. [2021-11-23 03:34:40,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1068 states have (on average 1.3099250936329587) internal successors, (1399), 1080 states have internal predecessors, (1399), 244 states have call successors, (244), 140 states have call predecessors, (244), 140 states have return successors, (244), 232 states have call predecessors, (244), 244 states have call successors, (244) [2021-11-23 03:34:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 1887 transitions. [2021-11-23 03:34:40,407 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 1887 transitions. Word has length 73 [2021-11-23 03:34:40,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:34:40,407 INFO L470 AbstractCegarLoop]: Abstraction has 1453 states and 1887 transitions. [2021-11-23 03:34:40,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-11-23 03:34:40,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1887 transitions. [2021-11-23 03:34:40,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-23 03:34:40,410 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:34:40,410 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:34:40,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-23 03:34:40,410 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:34:40,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:34:40,411 INFO L85 PathProgramCache]: Analyzing trace with hash 972839730, now seen corresponding path program 1 times [2021-11-23 03:34:40,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:34:40,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529292153] [2021-11-23 03:34:40,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:34:40,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:34:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 03:34:40,459 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 03:34:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 03:34:40,558 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-23 03:34:40,559 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-23 03:34:40,560 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-23 03:34:40,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-23 03:34:40,565 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:34:40,569 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-23 03:34:40,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:34:40 BoogieIcfgContainer [2021-11-23 03:34:40,722 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-23 03:34:40,723 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 03:34:40,723 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 03:34:40,723 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 03:34:40,724 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:32:47" (3/4) ... [2021-11-23 03:34:40,725 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-23 03:34:40,863 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/witness.graphml [2021-11-23 03:34:40,863 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 03:34:40,864 INFO L158 Benchmark]: Toolchain (without parser) took 115885.85ms. Allocated memory was 77.6MB in the beginning and 503.3MB in the end (delta: 425.7MB). Free memory was 38.2MB in the beginning and 219.3MB in the end (delta: -181.1MB). Peak memory consumption was 246.8MB. Max. memory is 16.1GB. [2021-11-23 03:34:40,864 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 77.6MB. Free memory is still 55.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 03:34:40,865 INFO L158 Benchmark]: CACSL2BoogieTranslator took 585.16ms. Allocated memory was 77.6MB in the beginning and 98.6MB in the end (delta: 21.0MB). Free memory was 37.9MB in the beginning and 66.6MB in the end (delta: -28.6MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2021-11-23 03:34:40,865 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.56ms. Allocated memory is still 98.6MB. Free memory was 66.6MB in the beginning and 63.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 03:34:40,866 INFO L158 Benchmark]: Boogie Preprocessor took 96.15ms. Allocated memory is still 98.6MB. Free memory was 63.1MB in the beginning and 60.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 03:34:40,866 INFO L158 Benchmark]: RCFGBuilder took 1323.53ms. Allocated memory is still 98.6MB. Free memory was 60.6MB in the beginning and 54.5MB in the end (delta: 6.1MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2021-11-23 03:34:40,866 INFO L158 Benchmark]: TraceAbstraction took 113631.18ms. Allocated memory was 98.6MB in the beginning and 503.3MB in the end (delta: 404.8MB). Free memory was 53.7MB in the beginning and 240.4MB in the end (delta: -186.7MB). Peak memory consumption was 219.0MB. Max. memory is 16.1GB. [2021-11-23 03:34:40,867 INFO L158 Benchmark]: Witness Printer took 140.89ms. Allocated memory is still 503.3MB. Free memory was 240.4MB in the beginning and 219.3MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-11-23 03:34:40,869 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 77.6MB. Free memory is still 55.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 585.16ms. Allocated memory was 77.6MB in the beginning and 98.6MB in the end (delta: 21.0MB). Free memory was 37.9MB in the beginning and 66.6MB in the end (delta: -28.6MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.56ms. Allocated memory is still 98.6MB. Free memory was 66.6MB in the beginning and 63.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.15ms. Allocated memory is still 98.6MB. Free memory was 63.1MB in the beginning and 60.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1323.53ms. Allocated memory is still 98.6MB. Free memory was 60.6MB in the beginning and 54.5MB in the end (delta: 6.1MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. * TraceAbstraction took 113631.18ms. Allocated memory was 98.6MB in the beginning and 503.3MB in the end (delta: 404.8MB). Free memory was 53.7MB in the beginning and 240.4MB in the end (delta: -186.7MB). Peak memory consumption was 219.0MB. Max. memory is 16.1GB. * Witness Printer took 140.89ms. Allocated memory is still 503.3MB. Free memory was 240.4MB in the beginning and 219.3MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 618]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [L563] CALL, EXPR init() [L197] COND FALSE !((int )side1Failed_History_0 != 0) [L200] COND FALSE !((int )side2Failed_History_0 != 0) [L203] COND FALSE !((int )active_side_History_0 != -2) [L206] COND FALSE !((int )manual_selection_History_0 != 0) [L209] COND FALSE !((int )side1Failed_History_1 != 0) [L212] COND FALSE !((int )side2Failed_History_1 != 0) [L215] COND FALSE !((int )active_side_History_1 != -2) [L218] COND FALSE !((int )manual_selection_History_1 != 0) [L221] COND FALSE !((int )side1Failed_History_2 != 0) [L224] COND FALSE !((int )side2Failed_History_2 != 0) [L227] COND FALSE !((int )active_side_History_2 != -2) [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) [L564] RET assume_abort_if_not(i2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L582] COND TRUE 1 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val [L257] RET write_manual_selection_history(manual_selection) [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val [L276] RET write_side1_failed_history(side1Failed) [L277] COND FALSE !(\read(side1Failed)) [L284] side1 = s1s1_old [L285] s1s1_old = nomsg [L286] side2 = s2s1_old [L287] s2s1_old = nomsg [L288] manual_selection = cs1_old [L289] cs1_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L290] COND TRUE (int )side1 == (int )side2 [L291] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L314] EXPR next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] EXPR next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] EXPR next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, index=0, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=-2, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L408] COND TRUE (int )side1 == (int )nomsg [L409] COND FALSE !((int )side2 == 0) [L412] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; [L447] COND TRUE ! side1Failed [L448] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND TRUE ! tmp___0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L458] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=-256, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L458] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=-256, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L458] tmp___1 = read_side1_failed_history((unsigned char)1) [L459] COND TRUE ! tmp___1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L460] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=0, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L460] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND TRUE ! tmp___2 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L462] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=-256, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L462] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=-256, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L462] tmp___3 = read_side2_failed_history((unsigned char)1) [L463] COND TRUE ! tmp___3 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L464] CALL, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=0, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L464] RET, EXPR read_side2_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L464] tmp___4 = read_side2_failed_history((unsigned char)0) [L465] COND TRUE ! tmp___4 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L466] COND FALSE !(! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L471] COND FALSE !(! (! ((int )side1_written == 0))) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L476] COND TRUE ! (! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L477] COND TRUE ! ((int )side2_written == 0) [L478] return (0); VAL [\result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L616] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L618] reach_error() VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 149 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 113.4s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4443 SdHoareTripleChecker+Valid, 8.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4350 mSDsluCounter, 23463 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19404 mSDsCounter, 752 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5510 IncrementalHoareTripleChecker+Invalid, 6262 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 752 mSolverCounterUnsat, 4848 mSDtfsCounter, 5510 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 816 GetRequests, 539 SyntacticMatches, 27 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3148 ImplicationChecksByTransitivity, 49.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1453occurred in iteration=18, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 1964 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1306 NumberOfCodeBlocks, 1306 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1400 ConstructedInterpolants, 0 QuantifiedInterpolants, 4597 SizeOfPredicates, 52 NumberOfNonLiveVariables, 1598 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 25 InterpolantComputations, 15 PerfectInterpolantSequences, 157/169 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: 5.2s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 4, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 34, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 33, TOOLS_POST_TIME: 1.8s, TOOLS_POST_CALL_APPLICATIONS: 12, TOOLS_POST_CALL_TIME: 1.5s, TOOLS_POST_RETURN_APPLICATIONS: 8, TOOLS_POST_RETURN_TIME: 0.8s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 53, TOOLS_QUANTIFIERELIM_TIME: 4.1s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 87, FLUID_YES_ANSWERS: 2, DOMAIN_JOIN_APPLICATIONS: 11, DOMAIN_JOIN_TIME: 0.7s, DOMAIN_ALPHA_APPLICATIONS: 2, DOMAIN_ALPHA_TIME: 0.1s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 34, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 8, CALL_SUMMARIZER_CACHE_MISSES: 3, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 996, DAG_COMPRESSION_RETAINED_NODES: 116, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-23 03:34:40,906 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_942406a7-d51c-4088-b0a4-02eaa10573f2/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE