./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ab86ebf9-de2a-4a0f-881d-d61b881d5a00/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ab86ebf9-de2a-4a0f-881d-d61b881d5a00/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ab86ebf9-de2a-4a0f-881d-d61b881d5a00/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ab86ebf9-de2a-4a0f-881d-d61b881d5a00/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ab86ebf9-de2a-4a0f-881d-d61b881d5a00/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ab86ebf9-de2a-4a0f-881d-d61b881d5a00/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3b24d22acbd30abb2bd6c739c1741063240b31f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:32:48,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:32:48,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:32:48,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:32:48,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:32:48,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:32:48,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:32:48,093 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:32:48,098 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:32:48,102 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:32:48,103 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:32:48,105 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:32:48,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:32:48,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:32:48,108 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:32:48,109 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:32:48,110 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:32:48,111 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:32:48,114 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:32:48,117 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:32:48,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:32:48,124 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:32:48,126 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:32:48,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:32:48,128 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:32:48,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:32:48,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:32:48,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:32:48,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:32:48,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:32:48,132 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:32:48,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:32:48,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:32:48,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:32:48,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:32:48,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:32:48,136 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:32:48,136 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:32:48,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:32:48,137 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:32:48,139 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:32:48,139 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ab86ebf9-de2a-4a0f-881d-d61b881d5a00/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:32:48,164 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:32:48,165 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:32:48,165 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:32:48,166 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:32:48,166 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:32:48,166 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:32:48,166 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:32:48,166 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:32:48,167 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:32:48,167 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:32:48,167 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:32:48,167 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:32:48,168 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:32:48,168 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:32:48,168 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:32:48,169 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:32:48,169 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:32:48,169 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:32:48,169 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:32:48,169 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:32:48,170 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:32:48,170 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:32:48,170 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:32:48,170 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:32:48,170 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:32:48,171 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:32:48,171 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:32:48,171 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:32:48,171 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:32:48,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:32:48,172 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:32:48,172 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:32:48,172 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:32:48,172 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:32:48,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:32:48,173 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:32:48,173 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:32:48,173 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/run_dir_ab86ebf9-de2a-4a0f-881d-d61b881d5a00/bin/utaipan 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(__VERIFIER_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 -> b3b24d22acbd30abb2bd6c739c1741063240b31f [2019-11-26 02:32:48,319 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:32:48,333 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:32:48,336 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:32:48,337 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:32:48,338 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:32:48,338 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ab86ebf9-de2a-4a0f-881d-d61b881d5a00/bin/utaipan/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2019-11-26 02:32:48,395 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab86ebf9-de2a-4a0f-881d-d61b881d5a00/bin/utaipan/data/35f6123b6/9d8c261993be4c72af3db994e7cdf4a2/FLAG524cde816 [2019-11-26 02:32:48,860 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:32:48,861 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ab86ebf9-de2a-4a0f-881d-d61b881d5a00/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2019-11-26 02:32:48,875 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab86ebf9-de2a-4a0f-881d-d61b881d5a00/bin/utaipan/data/35f6123b6/9d8c261993be4c72af3db994e7cdf4a2/FLAG524cde816 [2019-11-26 02:32:49,211 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ab86ebf9-de2a-4a0f-881d-d61b881d5a00/bin/utaipan/data/35f6123b6/9d8c261993be4c72af3db994e7cdf4a2 [2019-11-26 02:32:49,215 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:32:49,222 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:32:49,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:32:49,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:32:49,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:32:49,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:32:49" (1/1) ... [2019-11-26 02:32:49,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142503a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:49, skipping insertion in model container [2019-11-26 02:32:49,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:32:49" (1/1) ... [2019-11-26 02:32:49,240 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:32:49,291 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:32:49,623 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:32:49,633 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:32:49,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:32:49,723 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:32:49,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:49 WrapperNode [2019-11-26 02:32:49,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:32:49,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:32:49,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:32:49,725 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:32:49,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:49" (1/1) ... [2019-11-26 02:32:49,753 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:49" (1/1) ... [2019-11-26 02:32:49,832 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:32:49,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:32:49,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:32:49,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:32:49,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:49" (1/1) ... [2019-11-26 02:32:49,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:49" (1/1) ... [2019-11-26 02:32:49,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:49" (1/1) ... [2019-11-26 02:32:49,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:49" (1/1) ... [2019-11-26 02:32:49,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:49" (1/1) ... [2019-11-26 02:32:49,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:49" (1/1) ... [2019-11-26 02:32:49,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:49" (1/1) ... [2019-11-26 02:32:49,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:32:49,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:32:49,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:32:49,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:32:49,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab86ebf9-de2a-4a0f-881d-d61b881d5a00/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:32:49,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:32:49,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:32:51,757 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:32:51,758 INFO L284 CfgBuilder]: Removed 119 assume(true) statements. [2019-11-26 02:32:51,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:32:51 BoogieIcfgContainer [2019-11-26 02:32:51,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:32:51,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:32:51,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:32:51,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:32:51,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:32:49" (1/3) ... [2019-11-26 02:32:51,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2476eb7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:32:51, skipping insertion in model container [2019-11-26 02:32:51,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:49" (2/3) ... [2019-11-26 02:32:51,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2476eb7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:32:51, skipping insertion in model container [2019-11-26 02:32:51,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:32:51" (3/3) ... [2019-11-26 02:32:51,767 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2019-11-26 02:32:51,776 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:32:51,783 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-11-26 02:32:51,793 INFO L249 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-11-26 02:32:51,831 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:32:51,831 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:32:51,831 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:32:51,831 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:32:51,832 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:32:51,832 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:32:51,832 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:32:51,832 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:32:51,855 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states. [2019-11-26 02:32:51,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-26 02:32:51,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:51,862 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:32:51,863 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:51,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:51,870 INFO L82 PathProgramCache]: Analyzing trace with hash -339087412, now seen corresponding path program 1 times [2019-11-26 02:32:51,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:51,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490772677] [2019-11-26 02:32:51,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:32:52,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490772677] [2019-11-26 02:32:52,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:52,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:32:52,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680562474] [2019-11-26 02:32:52,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:32:52,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:52,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:32:52,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:32:52,237 INFO L87 Difference]: Start difference. First operand 238 states. Second operand 3 states. [2019-11-26 02:32:52,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:52,363 INFO L93 Difference]: Finished difference Result 477 states and 740 transitions. [2019-11-26 02:32:52,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:32:52,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-26 02:32:52,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:52,382 INFO L225 Difference]: With dead ends: 477 [2019-11-26 02:32:52,383 INFO L226 Difference]: Without dead ends: 238 [2019-11-26 02:32:52,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:32:52,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-11-26 02:32:52,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 213. [2019-11-26 02:32:52,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-26 02:32:52,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 309 transitions. [2019-11-26 02:32:52,450 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 309 transitions. Word has length 11 [2019-11-26 02:32:52,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:52,451 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 309 transitions. [2019-11-26 02:32:52,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:32:52,451 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 309 transitions. [2019-11-26 02:32:52,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-26 02:32:52,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:52,452 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:32:52,453 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:52,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:52,453 INFO L82 PathProgramCache]: Analyzing trace with hash 2004755406, now seen corresponding path program 1 times [2019-11-26 02:32:52,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:52,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272884310] [2019-11-26 02:32:52,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:52,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:32:52,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272884310] [2019-11-26 02:32:52,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:52,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:32:52,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129459555] [2019-11-26 02:32:52,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:32:52,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:52,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:32:52,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:32:52,604 INFO L87 Difference]: Start difference. First operand 213 states and 309 transitions. Second operand 5 states. [2019-11-26 02:32:52,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:52,706 INFO L93 Difference]: Finished difference Result 652 states and 949 transitions. [2019-11-26 02:32:52,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:32:52,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-26 02:32:52,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:52,711 INFO L225 Difference]: With dead ends: 652 [2019-11-26 02:32:52,712 INFO L226 Difference]: Without dead ends: 440 [2019-11-26 02:32:52,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:32:52,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-11-26 02:32:52,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 235. [2019-11-26 02:32:52,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-26 02:32:52,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 343 transitions. [2019-11-26 02:32:52,737 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 343 transitions. Word has length 15 [2019-11-26 02:32:52,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:52,737 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 343 transitions. [2019-11-26 02:32:52,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:32:52,738 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 343 transitions. [2019-11-26 02:32:52,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-26 02:32:52,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:52,739 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:32:52,739 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:52,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:52,740 INFO L82 PathProgramCache]: Analyzing trace with hash 813991417, now seen corresponding path program 1 times [2019-11-26 02:32:52,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:52,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761015848] [2019-11-26 02:32:52,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:52,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:32:52,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761015848] [2019-11-26 02:32:52,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:52,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:32:52,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271067516] [2019-11-26 02:32:52,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:32:52,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:52,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:32:52,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:32:52,812 INFO L87 Difference]: Start difference. First operand 235 states and 343 transitions. Second operand 5 states. [2019-11-26 02:32:52,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:52,978 INFO L93 Difference]: Finished difference Result 861 states and 1252 transitions. [2019-11-26 02:32:52,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:32:52,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-26 02:32:52,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:52,983 INFO L225 Difference]: With dead ends: 861 [2019-11-26 02:32:52,983 INFO L226 Difference]: Without dead ends: 649 [2019-11-26 02:32:52,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-26 02:32:52,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-26 02:32:52,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 236. [2019-11-26 02:32:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-11-26 02:32:53,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 344 transitions. [2019-11-26 02:32:53,001 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 344 transitions. Word has length 16 [2019-11-26 02:32:53,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:53,001 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 344 transitions. [2019-11-26 02:32:53,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:32:53,001 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 344 transitions. [2019-11-26 02:32:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 02:32:53,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:53,003 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:32:53,003 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:53,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:53,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1768366250, now seen corresponding path program 1 times [2019-11-26 02:32:53,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:53,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594698689] [2019-11-26 02:32:53,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:53,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:32:53,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594698689] [2019-11-26 02:32:53,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:53,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:32:53,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485093968] [2019-11-26 02:32:53,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:32:53,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:53,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:32:53,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:32:53,080 INFO L87 Difference]: Start difference. First operand 236 states and 344 transitions. Second operand 4 states. [2019-11-26 02:32:53,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:53,124 INFO L93 Difference]: Finished difference Result 680 states and 984 transitions. [2019-11-26 02:32:53,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:32:53,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-26 02:32:53,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:53,128 INFO L225 Difference]: With dead ends: 680 [2019-11-26 02:32:53,128 INFO L226 Difference]: Without dead ends: 454 [2019-11-26 02:32:53,129 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:32:53,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-11-26 02:32:53,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 240. [2019-11-26 02:32:53,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-11-26 02:32:53,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 348 transitions. [2019-11-26 02:32:53,140 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 348 transitions. Word has length 18 [2019-11-26 02:32:53,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:53,141 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 348 transitions. [2019-11-26 02:32:53,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:32:53,141 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 348 transitions. [2019-11-26 02:32:53,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-26 02:32:53,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:53,142 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:32:53,143 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:53,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:53,143 INFO L82 PathProgramCache]: Analyzing trace with hash -513449963, now seen corresponding path program 1 times [2019-11-26 02:32:53,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:53,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600809725] [2019-11-26 02:32:53,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:53,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:32:53,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600809725] [2019-11-26 02:32:53,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:53,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:32:53,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982118483] [2019-11-26 02:32:53,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:32:53,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:53,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:32:53,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:32:53,221 INFO L87 Difference]: Start difference. First operand 240 states and 348 transitions. Second operand 3 states. [2019-11-26 02:32:53,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:53,249 INFO L93 Difference]: Finished difference Result 484 states and 703 transitions. [2019-11-26 02:32:53,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:32:53,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-26 02:32:53,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:53,252 INFO L225 Difference]: With dead ends: 484 [2019-11-26 02:32:53,252 INFO L226 Difference]: Without dead ends: 270 [2019-11-26 02:32:53,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:32:53,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-11-26 02:32:53,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 235. [2019-11-26 02:32:53,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-26 02:32:53,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 340 transitions. [2019-11-26 02:32:53,263 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 340 transitions. Word has length 20 [2019-11-26 02:32:53,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:53,263 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 340 transitions. [2019-11-26 02:32:53,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:32:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 340 transitions. [2019-11-26 02:32:53,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 02:32:53,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:53,265 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:32:53,265 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:53,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:53,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1309875859, now seen corresponding path program 1 times [2019-11-26 02:32:53,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:53,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174356353] [2019-11-26 02:32:53,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:53,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:32:53,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174356353] [2019-11-26 02:32:53,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:53,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:32:53,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523898590] [2019-11-26 02:32:53,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:32:53,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:53,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:32:53,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:32:53,342 INFO L87 Difference]: Start difference. First operand 235 states and 340 transitions. Second operand 3 states. [2019-11-26 02:32:53,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:53,431 INFO L93 Difference]: Finished difference Result 483 states and 702 transitions. [2019-11-26 02:32:53,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:32:53,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-26 02:32:53,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:53,434 INFO L225 Difference]: With dead ends: 483 [2019-11-26 02:32:53,434 INFO L226 Difference]: Without dead ends: 274 [2019-11-26 02:32:53,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:32:53,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-11-26 02:32:53,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 215. [2019-11-26 02:32:53,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-11-26 02:32:53,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 308 transitions. [2019-11-26 02:32:53,446 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 308 transitions. Word has length 24 [2019-11-26 02:32:53,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:53,449 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 308 transitions. [2019-11-26 02:32:53,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:32:53,450 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 308 transitions. [2019-11-26 02:32:53,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-26 02:32:53,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:53,452 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:32:53,453 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:53,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:53,453 INFO L82 PathProgramCache]: Analyzing trace with hash 95555141, now seen corresponding path program 1 times [2019-11-26 02:32:53,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:53,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953390365] [2019-11-26 02:32:53,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:53,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:32:53,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953390365] [2019-11-26 02:32:53,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:53,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:32:53,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495065340] [2019-11-26 02:32:53,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:32:53,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:53,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:32:53,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:32:53,540 INFO L87 Difference]: Start difference. First operand 215 states and 308 transitions. Second operand 3 states. [2019-11-26 02:32:53,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:53,593 INFO L93 Difference]: Finished difference Result 451 states and 646 transitions. [2019-11-26 02:32:53,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:32:53,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-26 02:32:53,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:53,596 INFO L225 Difference]: With dead ends: 451 [2019-11-26 02:32:53,596 INFO L226 Difference]: Without dead ends: 262 [2019-11-26 02:32:53,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:32:53,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-26 02:32:53,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 203. [2019-11-26 02:32:53,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-26 02:32:53,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 290 transitions. [2019-11-26 02:32:53,606 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 290 transitions. Word has length 28 [2019-11-26 02:32:53,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:53,607 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 290 transitions. [2019-11-26 02:32:53,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:32:53,607 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 290 transitions. [2019-11-26 02:32:53,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-26 02:32:53,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:53,613 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:32:53,613 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:53,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:53,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1047107925, now seen corresponding path program 1 times [2019-11-26 02:32:53,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:53,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152727396] [2019-11-26 02:32:53,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:53,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:32:53,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152727396] [2019-11-26 02:32:53,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:53,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:32:53,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195587085] [2019-11-26 02:32:53,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:32:53,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:53,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:32:53,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:32:53,685 INFO L87 Difference]: Start difference. First operand 203 states and 290 transitions. Second operand 3 states. [2019-11-26 02:32:53,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:53,772 INFO L93 Difference]: Finished difference Result 447 states and 638 transitions. [2019-11-26 02:32:53,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:32:53,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-26 02:32:53,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:53,775 INFO L225 Difference]: With dead ends: 447 [2019-11-26 02:32:53,775 INFO L226 Difference]: Without dead ends: 270 [2019-11-26 02:32:53,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:32:53,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-11-26 02:32:53,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 183. [2019-11-26 02:32:53,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-11-26 02:32:53,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 258 transitions. [2019-11-26 02:32:53,786 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 258 transitions. Word has length 29 [2019-11-26 02:32:53,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:53,786 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 258 transitions. [2019-11-26 02:32:53,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:32:53,786 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 258 transitions. [2019-11-26 02:32:53,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-26 02:32:53,787 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:53,788 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:32:53,788 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:53,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:53,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1774384857, now seen corresponding path program 1 times [2019-11-26 02:32:53,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:53,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957281527] [2019-11-26 02:32:53,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:53,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:32:53,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957281527] [2019-11-26 02:32:53,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:53,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:32:53,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293823894] [2019-11-26 02:32:53,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:32:53,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:53,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:32:53,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:32:53,901 INFO L87 Difference]: Start difference. First operand 183 states and 258 transitions. Second operand 6 states. [2019-11-26 02:32:54,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:54,123 INFO L93 Difference]: Finished difference Result 630 states and 876 transitions. [2019-11-26 02:32:54,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:32:54,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-26 02:32:54,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:54,127 INFO L225 Difference]: With dead ends: 630 [2019-11-26 02:32:54,127 INFO L226 Difference]: Without dead ends: 473 [2019-11-26 02:32:54,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-26 02:32:54,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-11-26 02:32:54,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 220. [2019-11-26 02:32:54,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-26 02:32:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 312 transitions. [2019-11-26 02:32:54,141 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 312 transitions. Word has length 34 [2019-11-26 02:32:54,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:54,142 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 312 transitions. [2019-11-26 02:32:54,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:32:54,142 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 312 transitions. [2019-11-26 02:32:54,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-26 02:32:54,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:54,143 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:32:54,143 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:54,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:54,144 INFO L82 PathProgramCache]: Analyzing trace with hash -150393982, now seen corresponding path program 1 times [2019-11-26 02:32:54,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:54,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587419054] [2019-11-26 02:32:54,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:54,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:32:54,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587419054] [2019-11-26 02:32:54,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:54,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:32:54,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748026298] [2019-11-26 02:32:54,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:32:54,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:54,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:32:54,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:32:54,189 INFO L87 Difference]: Start difference. First operand 220 states and 312 transitions. Second operand 3 states. [2019-11-26 02:32:54,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:54,254 INFO L93 Difference]: Finished difference Result 470 states and 661 transitions. [2019-11-26 02:32:54,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:32:54,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-26 02:32:54,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:54,257 INFO L225 Difference]: With dead ends: 470 [2019-11-26 02:32:54,257 INFO L226 Difference]: Without dead ends: 296 [2019-11-26 02:32:54,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:32:54,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-26 02:32:54,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 204. [2019-11-26 02:32:54,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-11-26 02:32:54,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 286 transitions. [2019-11-26 02:32:54,271 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 286 transitions. Word has length 35 [2019-11-26 02:32:54,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:54,271 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 286 transitions. [2019-11-26 02:32:54,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:32:54,271 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 286 transitions. [2019-11-26 02:32:54,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-26 02:32:54,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:54,272 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:32:54,273 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:54,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:54,273 INFO L82 PathProgramCache]: Analyzing trace with hash 729186236, now seen corresponding path program 1 times [2019-11-26 02:32:54,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:54,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125826545] [2019-11-26 02:32:54,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:54,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:32:54,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125826545] [2019-11-26 02:32:54,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:54,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:32:54,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206522669] [2019-11-26 02:32:54,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:32:54,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:54,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:32:54,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:32:54,374 INFO L87 Difference]: Start difference. First operand 204 states and 286 transitions. Second operand 3 states. [2019-11-26 02:32:54,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:54,419 INFO L93 Difference]: Finished difference Result 372 states and 523 transitions. [2019-11-26 02:32:54,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:32:54,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-26 02:32:54,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:54,421 INFO L225 Difference]: With dead ends: 372 [2019-11-26 02:32:54,422 INFO L226 Difference]: Without dead ends: 227 [2019-11-26 02:32:54,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:32:54,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-11-26 02:32:54,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 200. [2019-11-26 02:32:54,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-26 02:32:54,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 279 transitions. [2019-11-26 02:32:54,433 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 279 transitions. Word has length 35 [2019-11-26 02:32:54,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:54,434 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 279 transitions. [2019-11-26 02:32:54,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:32:54,434 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 279 transitions. [2019-11-26 02:32:54,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-26 02:32:54,435 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:54,435 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:32:54,436 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:54,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:54,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1574352713, now seen corresponding path program 1 times [2019-11-26 02:32:54,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:54,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247334778] [2019-11-26 02:32:54,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:54,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:32:54,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247334778] [2019-11-26 02:32:54,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:54,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 02:32:54,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389947976] [2019-11-26 02:32:54,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 02:32:54,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:54,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 02:32:54,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:32:54,585 INFO L87 Difference]: Start difference. First operand 200 states and 279 transitions. Second operand 7 states. [2019-11-26 02:32:54,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:54,983 INFO L93 Difference]: Finished difference Result 883 states and 1214 transitions. [2019-11-26 02:32:54,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:32:54,984 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-11-26 02:32:54,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:54,988 INFO L225 Difference]: With dead ends: 883 [2019-11-26 02:32:54,988 INFO L226 Difference]: Without dead ends: 724 [2019-11-26 02:32:54,989 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-26 02:32:54,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-11-26 02:32:55,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 254. [2019-11-26 02:32:55,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-26 02:32:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 353 transitions. [2019-11-26 02:32:55,009 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 353 transitions. Word has length 38 [2019-11-26 02:32:55,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:55,010 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 353 transitions. [2019-11-26 02:32:55,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 02:32:55,010 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 353 transitions. [2019-11-26 02:32:55,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-26 02:32:55,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:55,011 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:32:55,011 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:55,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:55,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1590994410, now seen corresponding path program 1 times [2019-11-26 02:32:55,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:55,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425198120] [2019-11-26 02:32:55,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:55,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:32:55,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425198120] [2019-11-26 02:32:55,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:55,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:32:55,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895828660] [2019-11-26 02:32:55,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:32:55,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:55,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:32:55,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:32:55,061 INFO L87 Difference]: Start difference. First operand 254 states and 353 transitions. Second operand 4 states. [2019-11-26 02:32:55,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:55,172 INFO L93 Difference]: Finished difference Result 715 states and 984 transitions. [2019-11-26 02:32:55,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:32:55,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-26 02:32:55,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:55,176 INFO L225 Difference]: With dead ends: 715 [2019-11-26 02:32:55,176 INFO L226 Difference]: Without dead ends: 537 [2019-11-26 02:32:55,177 INFO L630 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 [2019-11-26 02:32:55,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-11-26 02:32:55,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 371. [2019-11-26 02:32:55,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-11-26 02:32:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 507 transitions. [2019-11-26 02:32:55,203 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 507 transitions. Word has length 38 [2019-11-26 02:32:55,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:55,204 INFO L462 AbstractCegarLoop]: Abstraction has 371 states and 507 transitions. [2019-11-26 02:32:55,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:32:55,204 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 507 transitions. [2019-11-26 02:32:55,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-26 02:32:55,205 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:55,205 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:32:55,205 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:55,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:55,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1102134898, now seen corresponding path program 1 times [2019-11-26 02:32:55,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:55,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413356198] [2019-11-26 02:32:55,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:55,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:32:55,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413356198] [2019-11-26 02:32:55,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:55,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:32:55,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613538476] [2019-11-26 02:32:55,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:32:55,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:55,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:32:55,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:32:55,317 INFO L87 Difference]: Start difference. First operand 371 states and 507 transitions. Second operand 6 states. [2019-11-26 02:32:55,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:55,599 INFO L93 Difference]: Finished difference Result 1158 states and 1587 transitions. [2019-11-26 02:32:55,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:32:55,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-11-26 02:32:55,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:55,604 INFO L225 Difference]: With dead ends: 1158 [2019-11-26 02:32:55,605 INFO L226 Difference]: Without dead ends: 918 [2019-11-26 02:32:55,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-26 02:32:55,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-11-26 02:32:55,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 375. [2019-11-26 02:32:55,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-11-26 02:32:55,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 512 transitions. [2019-11-26 02:32:55,637 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 512 transitions. Word has length 39 [2019-11-26 02:32:55,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:55,637 INFO L462 AbstractCegarLoop]: Abstraction has 375 states and 512 transitions. [2019-11-26 02:32:55,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:32:55,638 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 512 transitions. [2019-11-26 02:32:55,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-26 02:32:55,638 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:55,638 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:32:55,639 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:55,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:55,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1012170325, now seen corresponding path program 1 times [2019-11-26 02:32:55,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:55,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924591505] [2019-11-26 02:32:55,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:55,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:32:55,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924591505] [2019-11-26 02:32:55,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:55,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:32:55,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75028380] [2019-11-26 02:32:55,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:32:55,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:55,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:32:55,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:32:55,709 INFO L87 Difference]: Start difference. First operand 375 states and 512 transitions. Second operand 4 states. [2019-11-26 02:32:55,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:55,829 INFO L93 Difference]: Finished difference Result 601 states and 827 transitions. [2019-11-26 02:32:55,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:32:55,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-26 02:32:55,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:55,833 INFO L225 Difference]: With dead ends: 601 [2019-11-26 02:32:55,833 INFO L226 Difference]: Without dead ends: 599 [2019-11-26 02:32:55,833 INFO L630 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 [2019-11-26 02:32:55,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-11-26 02:32:55,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 377. [2019-11-26 02:32:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-26 02:32:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 514 transitions. [2019-11-26 02:32:55,867 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 514 transitions. Word has length 39 [2019-11-26 02:32:55,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:55,868 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 514 transitions. [2019-11-26 02:32:55,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:32:55,868 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 514 transitions. [2019-11-26 02:32:55,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-26 02:32:55,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:55,869 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:32:55,869 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:55,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:55,869 INFO L82 PathProgramCache]: Analyzing trace with hash -720424917, now seen corresponding path program 1 times [2019-11-26 02:32:55,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:55,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199742331] [2019-11-26 02:32:55,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:55,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:32:55,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199742331] [2019-11-26 02:32:55,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:55,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:32:55,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732974618] [2019-11-26 02:32:55,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:32:55,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:55,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:32:55,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:32:55,940 INFO L87 Difference]: Start difference. First operand 377 states and 514 transitions. Second operand 6 states. [2019-11-26 02:32:56,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:56,105 INFO L93 Difference]: Finished difference Result 831 states and 1163 transitions. [2019-11-26 02:32:56,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 02:32:56,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-11-26 02:32:56,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:56,109 INFO L225 Difference]: With dead ends: 831 [2019-11-26 02:32:56,109 INFO L226 Difference]: Without dead ends: 589 [2019-11-26 02:32:56,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:32:56,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-11-26 02:32:56,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 383. [2019-11-26 02:32:56,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-26 02:32:56,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 520 transitions. [2019-11-26 02:32:56,142 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 520 transitions. Word has length 40 [2019-11-26 02:32:56,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:56,143 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 520 transitions. [2019-11-26 02:32:56,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:32:56,143 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 520 transitions. [2019-11-26 02:32:56,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-26 02:32:56,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:56,144 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:32:56,145 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:56,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:56,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1889246475, now seen corresponding path program 1 times [2019-11-26 02:32:56,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:56,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423354104] [2019-11-26 02:32:56,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:32:56,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423354104] [2019-11-26 02:32:56,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:56,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 02:32:56,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850728332] [2019-11-26 02:32:56,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 02:32:56,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:56,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 02:32:56,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:32:56,303 INFO L87 Difference]: Start difference. First operand 383 states and 520 transitions. Second operand 7 states. [2019-11-26 02:32:56,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:56,779 INFO L93 Difference]: Finished difference Result 1687 states and 2261 transitions. [2019-11-26 02:32:56,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:32:56,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-11-26 02:32:56,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:56,787 INFO L225 Difference]: With dead ends: 1687 [2019-11-26 02:32:56,787 INFO L226 Difference]: Without dead ends: 1416 [2019-11-26 02:32:56,788 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-26 02:32:56,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2019-11-26 02:32:56,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 464. [2019-11-26 02:32:56,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-11-26 02:32:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 623 transitions. [2019-11-26 02:32:56,834 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 623 transitions. Word has length 40 [2019-11-26 02:32:56,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:56,834 INFO L462 AbstractCegarLoop]: Abstraction has 464 states and 623 transitions. [2019-11-26 02:32:56,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 02:32:56,834 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 623 transitions. [2019-11-26 02:32:56,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-26 02:32:56,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:56,835 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:32:56,835 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:56,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:56,836 INFO L82 PathProgramCache]: Analyzing trace with hash -569210678, now seen corresponding path program 1 times [2019-11-26 02:32:56,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:56,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013391224] [2019-11-26 02:32:56,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:32:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:32:56,940 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-26 02:32:56,941 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 02:32:57,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:32:57 BoogieIcfgContainer [2019-11-26 02:32:57,083 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:32:57,084 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:32:57,084 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:32:57,084 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:32:57,084 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:32:51" (3/4) ... [2019-11-26 02:32:57,086 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-26 02:32:57,191 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ab86ebf9-de2a-4a0f-881d-d61b881d5a00/bin/utaipan/witness.graphml [2019-11-26 02:32:57,192 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:32:57,193 INFO L168 Benchmark]: Toolchain (without parser) took 7971.14 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 250.1 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 101.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:32:57,194 INFO L168 Benchmark]: CDTParser took 0.59 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:32:57,194 INFO L168 Benchmark]: CACSL2BoogieTranslator took 498.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.7 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -248.9 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:32:57,194 INFO L168 Benchmark]: Boogie Procedure Inliner took 119.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:32:57,195 INFO L168 Benchmark]: Boogie Preprocessor took 71.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:32:57,195 INFO L168 Benchmark]: RCFGBuilder took 1842.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 168.3 MB). Peak memory consumption was 168.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:32:57,195 INFO L168 Benchmark]: TraceAbstraction took 5322.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 51.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -105.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:32:57,196 INFO L168 Benchmark]: Witness Printer took 108.10 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:32:57,197 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.59 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 498.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.7 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -248.9 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 119.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1842.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 168.3 MB). Peak memory consumption was 168.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5322.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 51.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -105.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 108.10 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 662]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L96] _Bool side1Failed ; [L97] _Bool side2Failed ; [L102] static _Bool side1Failed_History_0 ; [L103] static _Bool side1Failed_History_1 ; [L104] static _Bool side1Failed_History_2 ; [L105] static _Bool side2Failed_History_0 ; [L106] static _Bool side2Failed_History_1 ; [L107] static _Bool side2Failed_History_2 ; [L69] msg_t nomsg = (msg_t )-1; [L70] port_t cs1 ; [L71] int8_t cs1_old ; [L72] int8_t cs1_new ; [L73] port_t cs2 ; [L74] int8_t cs2_old ; [L75] int8_t cs2_new ; [L76] port_t s1s2 ; [L77] int8_t s1s2_old ; [L78] int8_t s1s2_new ; [L79] port_t s1s1 ; [L80] int8_t s1s1_old ; [L81] int8_t s1s1_new ; [L82] port_t s2s1 ; [L83] int8_t s2s1_old ; [L84] int8_t s2s1_new ; [L85] port_t s2s2 ; [L86] int8_t s2s2_old ; [L87] int8_t s2s2_new ; [L88] port_t s1p ; [L89] int8_t s1p_old ; [L90] int8_t s1p_new ; [L91] port_t s2p ; [L92] int8_t s2p_old ; [L93] int8_t s2p_new ; [L98] msg_t side1_written ; [L99] msg_t side2_written ; [L108] static int8_t active_side_History_0 ; [L109] static int8_t active_side_History_1 ; [L110] static int8_t active_side_History_2 ; [L111] static msg_t manual_selection_History_0 ; [L112] static msg_t manual_selection_History_1 ; [L113] static msg_t manual_selection_History_2 ; [L463] void (*nodes[4])(void) = { & Console_task_each_pals_period, & Side1_activestandby_task_each_pals_period, & Side2_activestandby_task_each_pals_period, & Pendulum_prism_task_each_pals_period}; [L585] int c1 ; [L586] int i2 ; [L589] c1 = 0 [L590] side1Failed = __VERIFIER_nondet_bool() [L591] side2Failed = __VERIFIER_nondet_bool() [L592] side1_written = __VERIFIER_nondet_char() [L593] side2_written = __VERIFIER_nondet_char() [L594] side1Failed_History_0 = __VERIFIER_nondet_bool() [L595] side1Failed_History_1 = __VERIFIER_nondet_bool() [L596] side1Failed_History_2 = __VERIFIER_nondet_bool() [L597] side2Failed_History_0 = __VERIFIER_nondet_bool() [L598] side2Failed_History_1 = __VERIFIER_nondet_bool() [L599] side2Failed_History_2 = __VERIFIER_nondet_bool() [L600] active_side_History_0 = __VERIFIER_nondet_char() [L601] active_side_History_1 = __VERIFIER_nondet_char() [L602] active_side_History_2 = __VERIFIER_nondet_char() [L603] manual_selection_History_0 = __VERIFIER_nondet_char() [L604] manual_selection_History_1 = __VERIFIER_nondet_char() [L605] manual_selection_History_2 = __VERIFIER_nondet_char() [L239] COND FALSE !((int )side1Failed_History_0 != 0) [L242] COND FALSE !((int )side2Failed_History_0 != 0) [L245] COND FALSE !((int )active_side_History_0 != -2) [L248] COND FALSE !((int )manual_selection_History_0 != 0) [L251] COND FALSE !((int )side1Failed_History_1 != 0) [L254] COND FALSE !((int )side2Failed_History_1 != 0) [L257] COND FALSE !((int )active_side_History_1 != -2) [L260] COND FALSE !((int )manual_selection_History_1 != 0) [L263] COND FALSE !((int )side1Failed_History_2 != 0) [L266] COND FALSE !((int )side2Failed_History_2 != 0) [L269] COND FALSE !((int )active_side_History_2 != -2) [L272] COND FALSE !((int )manual_selection_History_2 != 0) [L275] return (1); [L606] i2 = init() [L608] cs1_old = nomsg [L609] cs1_new = nomsg [L610] cs2_old = nomsg [L611] cs2_new = nomsg [L612] s1s2_old = nomsg [L613] s1s2_new = nomsg [L614] s1s1_old = nomsg [L615] s1s1_new = nomsg [L616] s2s1_old = nomsg [L617] s2s1_new = nomsg [L618] s2s2_old = nomsg [L619] s2s2_new = nomsg [L620] s1p_old = nomsg [L621] s1p_new = nomsg [L622] s2p_old = nomsg [L623] s2p_new = nomsg [L624] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=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] [L625] COND TRUE i2 < 10 [L293] msg_t manual_selection ; [L294] char tmp ; [L297] tmp = __VERIFIER_nondet_char() [L298] manual_selection = tmp [L209] manual_selection_History_2 = manual_selection_History_1 [L210] manual_selection_History_1 = manual_selection_History_0 [L211] manual_selection_History_0 = val [L300] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L300] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L301] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L301] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L302] manual_selection = (msg_t )0 [L308] int8_t side1 ; [L309] int8_t side2 ; [L310] msg_t manual_selection ; [L311] int8_t next_state ; [L314] side1 = nomsg [L315] side2 = nomsg [L316] manual_selection = (msg_t )0 [L317] side1Failed = __VERIFIER_nondet_bool() [L119] side1Failed_History_2 = side1Failed_History_1 [L120] side1Failed_History_1 = side1Failed_History_0 [L121] side1Failed_History_0 = val VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L319] COND FALSE !(\read(side1Failed)) [L326] side1 = s1s1_old [L327] s1s1_old = nomsg [L328] side2 = s2s1_old [L329] s2s1_old = nomsg [L330] manual_selection = cs1_old [L331] cs1_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=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] [L332] COND TRUE (int )side1 == (int )side2 [L333] 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L356] EXPR next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L356] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L357] EXPR next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L357] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L358] EXPR next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L358] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L359] side1_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=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] [L365] int8_t side1 ; [L366] int8_t side2 ; [L367] msg_t manual_selection ; [L368] int8_t next_state ; [L371] side1 = nomsg [L372] side2 = nomsg [L373] manual_selection = (msg_t )0 [L374] side2Failed = __VERIFIER_nondet_bool() [L149] side2Failed_History_2 = side2Failed_History_1 [L150] side2Failed_History_1 = side2Failed_History_0 [L151] side2Failed_History_0 = val VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-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=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L376] COND FALSE !(\read(side2Failed)) [L383] side1 = s1s2_old [L384] s1s2_old = nomsg [L385] side2 = s2s2_old [L386] s2s2_old = nomsg [L387] manual_selection = cs2_old [L388] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L389] COND TRUE (int )side1 == (int )side2 [L390] 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-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=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L413] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L413] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L414] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L414] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L415] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L415] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L416] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_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] [L422] int8_t active_side ; [L423] int8_t tmp ; [L424] int8_t side1 ; [L425] int8_t side2 ; [L190] COND TRUE (int )index == 0 [L191] return (active_side_History_0); VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=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] [L428] tmp = read_active_side_history((unsigned char)0) [L429] active_side = tmp [L430] side1 = nomsg [L431] side2 = nomsg [L432] side1 = s1p_old [L433] s1p_old = nomsg [L434] side2 = s2p_old [L435] s2p_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_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] [L436] COND FALSE !((int )side1 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=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] [L439] COND FALSE !((int )side2 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=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] [L442] COND FALSE !((int )side1 == 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=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] [L450] COND TRUE (int )side1 == (int )nomsg [L451] COND FALSE !((int )side2 == 0) [L454] active_side = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_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] [L179] active_side_History_2 = active_side_History_1 [L180] active_side_History_1 = active_side_History_0 [L181] active_side_History_0 = val [L631] cs1_old = cs1_new [L632] cs1_new = nomsg [L633] cs2_old = cs2_new [L634] cs2_new = nomsg [L635] s1s2_old = s1s2_new [L636] s1s2_new = nomsg [L637] s1s1_old = s1s1_new [L638] s1s1_new = nomsg [L639] s2s1_old = s2s1_new [L640] s2s1_new = nomsg [L641] s2s2_old = s2s2_new [L642] s2s2_new = nomsg [L643] s1p_old = s1p_new [L644] s1p_new = nomsg [L645] s2p_old = s2p_new [L646] s2p_new = nomsg [L466] int tmp ; [L467] msg_t tmp___0 ; [L468] _Bool tmp___1 ; [L469] _Bool tmp___2 ; [L470] _Bool tmp___3 ; [L471] _Bool tmp___4 ; [L472] int8_t tmp___5 ; [L473] _Bool tmp___6 ; [L474] _Bool tmp___7 ; [L475] _Bool tmp___8 ; [L476] int8_t tmp___9 ; [L477] _Bool tmp___10 ; [L478] _Bool tmp___11 ; [L479] _Bool tmp___12 ; [L480] msg_t tmp___13 ; [L481] _Bool tmp___14 ; [L482] _Bool tmp___15 ; [L483] _Bool tmp___16 ; [L484] _Bool tmp___17 ; [L485] int8_t tmp___18 ; [L486] int8_t tmp___19 ; [L487] int8_t tmp___20 ; [L490] COND TRUE ! side1Failed [L491] tmp = 1 [L220] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=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] [L223] COND TRUE (int )index == 1 [L224] return (manual_selection_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=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] [L499] tmp___0 = read_manual_selection_history((unsigned char)1) [L500] COND TRUE ! tmp___0 [L130] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=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] [L133] COND TRUE (int )index == 1 [L134] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=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] [L501] tmp___1 = read_side1_failed_history((unsigned char)1) [L502] COND TRUE ! tmp___1 [L130] COND TRUE (int )index == 0 [L131] return (side1Failed_History_0); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=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] [L503] tmp___2 = read_side1_failed_history((unsigned char)0) [L504] COND TRUE ! tmp___2 [L160] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=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] [L163] COND TRUE (int )index == 1 [L164] return (side2Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=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] [L505] tmp___3 = read_side2_failed_history((unsigned char)1) [L506] COND TRUE ! tmp___3 [L160] COND TRUE (int )index == 0 [L161] return (side2Failed_History_0); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=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] [L507] tmp___4 = read_side2_failed_history((unsigned char)0) [L508] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=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] [L509] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=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] [L514] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=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] [L519] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=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] [L520] COND TRUE ! ((int )side2_written == 0) [L521] return (0); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=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] [L647] c1 = check() [L660] COND TRUE ! arg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=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] [L662] __VERIFIER_error() VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=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 1 procedures, 238 locations, 23 error locations. Result: UNSAFE, OverallTime: 5.2s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5708 SDtfs, 6844 SDslu, 10928 SDs, 0 SdLazy, 775 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 35 SyntacticMatches, 11 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=464occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 4028 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 541 NumberOfCodeBlocks, 541 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 482 ConstructedInterpolants, 0 QuantifiedInterpolants, 57883 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...