./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d6ca85bd-c32f-4d88-888a-401a1b046081/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d6ca85bd-c32f-4d88-888a-401a1b046081/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d6ca85bd-c32f-4d88-888a-401a1b046081/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d6ca85bd-c32f-4d88-888a-401a1b046081/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d6ca85bd-c32f-4d88-888a-401a1b046081/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d6ca85bd-c32f-4d88-888a-401a1b046081/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 51b120a585d23a491f06d4bb80c2a463453987ac ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.25-f470102 [2019-12-07 20:10:40,109 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:10:40,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:10:40,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:10:40,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:10:40,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:10:40,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:10:40,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:10:40,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:10:40,123 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:10:40,124 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:10:40,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:10:40,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:10:40,126 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:10:40,126 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:10:40,127 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:10:40,127 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:10:40,128 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:10:40,129 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:10:40,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:10:40,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:10:40,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:10:40,133 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:10:40,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:10:40,136 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:10:40,136 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:10:40,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:10:40,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:10:40,137 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:10:40,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:10:40,137 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:10:40,138 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:10:40,139 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:10:40,139 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:10:40,140 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:10:40,140 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:10:40,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:10:40,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:10:40,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:10:40,142 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:10:40,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:10:40,143 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d6ca85bd-c32f-4d88-888a-401a1b046081/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:10:40,156 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:10:40,156 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:10:40,157 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:10:40,157 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:10:40,157 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:10:40,157 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:10:40,157 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:10:40,158 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:10:40,158 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:10:40,158 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:10:40,158 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:10:40,158 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:10:40,158 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:10:40,159 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:10:40,159 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:10:40,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:10:40,160 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:10:40,160 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:10:40,160 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:10:40,160 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:10:40,160 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:10:40,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:10:40,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:10:40,161 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:10:40,161 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:10:40,161 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:10:40,161 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:10:40,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:10:40,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:10:40,162 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:10:40,162 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:10:40,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:10:40,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:10:40,163 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:10:40,163 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:10:40,163 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:10:40,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:10:40,163 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:10:40,164 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:10:40,164 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:10:40,164 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_d6ca85bd-c32f-4d88-888a-401a1b046081/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 -> 51b120a585d23a491f06d4bb80c2a463453987ac [2019-12-07 20:10:40,269 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:10:40,277 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:10:40,279 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:10:40,280 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:10:40,280 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:10:40,281 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d6ca85bd-c32f-4d88-888a-401a1b046081/bin/utaipan/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2019-12-07 20:10:40,316 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d6ca85bd-c32f-4d88-888a-401a1b046081/bin/utaipan/data/a65350b1f/12395ed4431f4dd0a065c2340d0fa4bd/FLAGbf5a2701b [2019-12-07 20:10:40,756 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:10:40,757 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d6ca85bd-c32f-4d88-888a-401a1b046081/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2019-12-07 20:10:40,764 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d6ca85bd-c32f-4d88-888a-401a1b046081/bin/utaipan/data/a65350b1f/12395ed4431f4dd0a065c2340d0fa4bd/FLAGbf5a2701b [2019-12-07 20:10:40,773 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d6ca85bd-c32f-4d88-888a-401a1b046081/bin/utaipan/data/a65350b1f/12395ed4431f4dd0a065c2340d0fa4bd [2019-12-07 20:10:40,774 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:10:40,775 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:10:40,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:10:40,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:10:40,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:10:40,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:10:40" (1/1) ... [2019-12-07 20:10:40,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7762f741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:10:40, skipping insertion in model container [2019-12-07 20:10:40,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:10:40" (1/1) ... [2019-12-07 20:10:40,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:10:40,821 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:10:41,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:10:41,020 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:10:41,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:10:41,072 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:10:41,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:10:41 WrapperNode [2019-12-07 20:10:41,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:10:41,073 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:10:41,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:10:41,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:10:41,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:10:41" (1/1) ... [2019-12-07 20:10:41,087 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:10:41" (1/1) ... [2019-12-07 20:10:41,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:10:41,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:10:41,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:10:41,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:10:41,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:10:41" (1/1) ... [2019-12-07 20:10:41,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:10:41" (1/1) ... [2019-12-07 20:10:41,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:10:41" (1/1) ... [2019-12-07 20:10:41,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:10:41" (1/1) ... [2019-12-07 20:10:41,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:10:41" (1/1) ... [2019-12-07 20:10:41,147 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:10:41" (1/1) ... [2019-12-07 20:10:41,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:10:41" (1/1) ... [2019-12-07 20:10:41,155 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:10:41,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:10:41,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:10:41,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:10:41,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:10:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d6ca85bd-c32f-4d88-888a-401a1b046081/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-12-07 20:10:41,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:10:41,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:10:42,118 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:10:42,118 INFO L287 CfgBuilder]: Removed 119 assume(true) statements. [2019-12-07 20:10:42,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:10:42 BoogieIcfgContainer [2019-12-07 20:10:42,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:10:42,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:10:42,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:10:42,123 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:10:42,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:10:40" (1/3) ... [2019-12-07 20:10:42,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8fa8ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:10:42, skipping insertion in model container [2019-12-07 20:10:42,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:10:41" (2/3) ... [2019-12-07 20:10:42,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8fa8ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:10:42, skipping insertion in model container [2019-12-07 20:10:42,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:10:42" (3/3) ... [2019-12-07 20:10:42,125 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2019-12-07 20:10:42,131 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:10:42,137 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-12-07 20:10:42,144 INFO L249 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-12-07 20:10:42,163 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:10:42,163 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:10:42,164 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:10:42,164 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:10:42,164 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:10:42,164 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:10:42,164 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:10:42,164 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:10:42,183 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states. [2019-12-07 20:10:42,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:10:42,187 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:42,187 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:42,188 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-12-07 20:10:42,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:42,192 INFO L82 PathProgramCache]: Analyzing trace with hash -404213796, now seen corresponding path program 1 times [2019-12-07 20:10:42,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:42,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121628482] [2019-12-07 20:10:42,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:42,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:42,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121628482] [2019-12-07 20:10:42,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:42,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:10:42,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030170612] [2019-12-07 20:10:42,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:10:42,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:42,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:10:42,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:10:42,413 INFO L87 Difference]: Start difference. First operand 231 states. Second operand 3 states. [2019-12-07 20:10:42,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:42,479 INFO L93 Difference]: Finished difference Result 460 states and 717 transitions. [2019-12-07 20:10:42,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:10:42,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 20:10:42,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:42,490 INFO L225 Difference]: With dead ends: 460 [2019-12-07 20:10:42,491 INFO L226 Difference]: Without dead ends: 230 [2019-12-07 20:10:42,494 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-12-07 20:10:42,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-12-07 20:10:42,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 206. [2019-12-07 20:10:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-12-07 20:10:42,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 298 transitions. [2019-12-07 20:10:42,532 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 298 transitions. Word has length 11 [2019-12-07 20:10:42,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:42,533 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 298 transitions. [2019-12-07 20:10:42,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:10:42,533 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 298 transitions. [2019-12-07 20:10:42,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 20:10:42,533 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:42,534 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:42,534 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-12-07 20:10:42,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:42,534 INFO L82 PathProgramCache]: Analyzing trace with hash -163693681, now seen corresponding path program 1 times [2019-12-07 20:10:42,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:42,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16779444] [2019-12-07 20:10:42,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:42,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:42,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16779444] [2019-12-07 20:10:42,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:42,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:10:42,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499086950] [2019-12-07 20:10:42,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:10:42,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:42,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:10:42,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:10:42,606 INFO L87 Difference]: Start difference. First operand 206 states and 298 transitions. Second operand 4 states. [2019-12-07 20:10:42,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:42,650 INFO L93 Difference]: Finished difference Result 611 states and 881 transitions. [2019-12-07 20:10:42,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:10:42,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 20:10:42,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:42,655 INFO L225 Difference]: With dead ends: 611 [2019-12-07 20:10:42,655 INFO L226 Difference]: Without dead ends: 403 [2019-12-07 20:10:42,657 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-12-07 20:10:42,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2019-12-07 20:10:42,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 208. [2019-12-07 20:10:42,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-12-07 20:10:42,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 300 transitions. [2019-12-07 20:10:42,673 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 300 transitions. Word has length 13 [2019-12-07 20:10:42,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:42,674 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 300 transitions. [2019-12-07 20:10:42,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:10:42,674 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 300 transitions. [2019-12-07 20:10:42,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 20:10:42,675 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:42,675 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:42,675 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-12-07 20:10:42,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:42,675 INFO L82 PathProgramCache]: Analyzing trace with hash 271745383, now seen corresponding path program 1 times [2019-12-07 20:10:42,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:42,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517341942] [2019-12-07 20:10:42,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:42,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517341942] [2019-12-07 20:10:42,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:42,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:10:42,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525311356] [2019-12-07 20:10:42,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:10:42,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:42,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:10:42,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:10:42,728 INFO L87 Difference]: Start difference. First operand 208 states and 300 transitions. Second operand 3 states. [2019-12-07 20:10:42,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:42,748 INFO L93 Difference]: Finished difference Result 438 states and 633 transitions. [2019-12-07 20:10:42,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:10:42,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 20:10:42,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:42,750 INFO L225 Difference]: With dead ends: 438 [2019-12-07 20:10:42,750 INFO L226 Difference]: Without dead ends: 231 [2019-12-07 20:10:42,751 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-12-07 20:10:42,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-12-07 20:10:42,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 203. [2019-12-07 20:10:42,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-12-07 20:10:42,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 292 transitions. [2019-12-07 20:10:42,776 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 292 transitions. Word has length 15 [2019-12-07 20:10:42,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:42,777 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 292 transitions. [2019-12-07 20:10:42,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:10:42,777 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 292 transitions. [2019-12-07 20:10:42,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 20:10:42,778 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:42,778 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:42,778 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-12-07 20:10:42,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:42,779 INFO L82 PathProgramCache]: Analyzing trace with hash -2017499457, now seen corresponding path program 1 times [2019-12-07 20:10:42,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:42,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674580725] [2019-12-07 20:10:42,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:42,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:42,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674580725] [2019-12-07 20:10:42,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:42,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:10:42,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272084071] [2019-12-07 20:10:42,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:10:42,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:42,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:10:42,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:10:42,886 INFO L87 Difference]: Start difference. First operand 203 states and 292 transitions. Second operand 5 states. [2019-12-07 20:10:42,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:42,986 INFO L93 Difference]: Finished difference Result 540 states and 787 transitions. [2019-12-07 20:10:42,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:10:42,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 20:10:42,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:42,989 INFO L225 Difference]: With dead ends: 540 [2019-12-07 20:10:42,989 INFO L226 Difference]: Without dead ends: 338 [2019-12-07 20:10:42,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:10:42,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-12-07 20:10:42,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 173. [2019-12-07 20:10:42,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-12-07 20:10:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 246 transitions. [2019-12-07 20:10:42,998 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 246 transitions. Word has length 19 [2019-12-07 20:10:42,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:42,999 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 246 transitions. [2019-12-07 20:10:42,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:10:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 246 transitions. [2019-12-07 20:10:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 20:10:42,999 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:43,000 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-12-07 20:10:43,000 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-12-07 20:10:43,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:43,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1053665165, now seen corresponding path program 1 times [2019-12-07 20:10:43,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:43,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209615663] [2019-12-07 20:10:43,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:43,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:43,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209615663] [2019-12-07 20:10:43,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:43,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:10:43,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504547933] [2019-12-07 20:10:43,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:10:43,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:43,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:10:43,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:10:43,091 INFO L87 Difference]: Start difference. First operand 173 states and 246 transitions. Second operand 5 states. [2019-12-07 20:10:43,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:43,185 INFO L93 Difference]: Finished difference Result 572 states and 817 transitions. [2019-12-07 20:10:43,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:10:43,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 20:10:43,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:43,187 INFO L225 Difference]: With dead ends: 572 [2019-12-07 20:10:43,188 INFO L226 Difference]: Without dead ends: 400 [2019-12-07 20:10:43,188 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:10:43,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-12-07 20:10:43,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 143. [2019-12-07 20:10:43,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 20:10:43,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 200 transitions. [2019-12-07 20:10:43,195 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 200 transitions. Word has length 24 [2019-12-07 20:10:43,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:43,195 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 200 transitions. [2019-12-07 20:10:43,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:10:43,195 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 200 transitions. [2019-12-07 20:10:43,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 20:10:43,196 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:43,196 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-12-07 20:10:43,196 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-12-07 20:10:43,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:43,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1309423147, now seen corresponding path program 1 times [2019-12-07 20:10:43,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:43,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606803754] [2019-12-07 20:10:43,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:43,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606803754] [2019-12-07 20:10:43,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:43,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:10:43,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098908811] [2019-12-07 20:10:43,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:10:43,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:43,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:10:43,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:10:43,277 INFO L87 Difference]: Start difference. First operand 143 states and 200 transitions. Second operand 6 states. [2019-12-07 20:10:43,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:43,416 INFO L93 Difference]: Finished difference Result 622 states and 871 transitions. [2019-12-07 20:10:43,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:10:43,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-07 20:10:43,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:43,420 INFO L225 Difference]: With dead ends: 622 [2019-12-07 20:10:43,420 INFO L226 Difference]: Without dead ends: 480 [2019-12-07 20:10:43,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:10:43,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-12-07 20:10:43,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 197. [2019-12-07 20:10:43,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-12-07 20:10:43,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 279 transitions. [2019-12-07 20:10:43,434 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 279 transitions. Word has length 29 [2019-12-07 20:10:43,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:43,435 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 279 transitions. [2019-12-07 20:10:43,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:10:43,435 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 279 transitions. [2019-12-07 20:10:43,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 20:10:43,436 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:43,436 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] [2019-12-07 20:10:43,436 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-12-07 20:10:43,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:43,437 INFO L82 PathProgramCache]: Analyzing trace with hash -799724898, now seen corresponding path program 1 times [2019-12-07 20:10:43,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:43,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644284204] [2019-12-07 20:10:43,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:43,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:43,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644284204] [2019-12-07 20:10:43,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:43,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:10:43,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988609146] [2019-12-07 20:10:43,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:10:43,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:43,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:10:43,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:10:43,486 INFO L87 Difference]: Start difference. First operand 197 states and 279 transitions. Second operand 3 states. [2019-12-07 20:10:43,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:43,513 INFO L93 Difference]: Finished difference Result 361 states and 512 transitions. [2019-12-07 20:10:43,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:10:43,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 20:10:43,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:43,514 INFO L225 Difference]: With dead ends: 361 [2019-12-07 20:10:43,514 INFO L226 Difference]: Without dead ends: 219 [2019-12-07 20:10:43,514 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-12-07 20:10:43,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-12-07 20:10:43,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 193. [2019-12-07 20:10:43,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-12-07 20:10:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 272 transitions. [2019-12-07 20:10:43,522 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 272 transitions. Word has length 30 [2019-12-07 20:10:43,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:43,522 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 272 transitions. [2019-12-07 20:10:43,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:10:43,522 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 272 transitions. [2019-12-07 20:10:43,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 20:10:43,523 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:43,523 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] [2019-12-07 20:10:43,524 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-12-07 20:10:43,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:43,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1237783543, now seen corresponding path program 1 times [2019-12-07 20:10:43,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:43,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471072360] [2019-12-07 20:10:43,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:43,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:43,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471072360] [2019-12-07 20:10:43,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:43,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:10:43,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210870793] [2019-12-07 20:10:43,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:10:43,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:43,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:10:43,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:10:43,598 INFO L87 Difference]: Start difference. First operand 193 states and 272 transitions. Second operand 7 states. [2019-12-07 20:10:43,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:43,845 INFO L93 Difference]: Finished difference Result 869 states and 1203 transitions. [2019-12-07 20:10:43,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:10:43,845 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 20:10:43,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:43,848 INFO L225 Difference]: With dead ends: 869 [2019-12-07 20:10:43,848 INFO L226 Difference]: Without dead ends: 712 [2019-12-07 20:10:43,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:10:43,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-12-07 20:10:43,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 235. [2019-12-07 20:10:43,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-07 20:10:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 330 transitions. [2019-12-07 20:10:43,862 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 330 transitions. Word has length 33 [2019-12-07 20:10:43,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:43,862 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 330 transitions. [2019-12-07 20:10:43,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:10:43,862 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 330 transitions. [2019-12-07 20:10:43,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 20:10:43,863 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:43,863 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] [2019-12-07 20:10:43,864 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-12-07 20:10:43,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:43,864 INFO L82 PathProgramCache]: Analyzing trace with hash 850669721, now seen corresponding path program 1 times [2019-12-07 20:10:43,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:43,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564106286] [2019-12-07 20:10:43,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:43,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:43,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564106286] [2019-12-07 20:10:43,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:43,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:10:43,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821385268] [2019-12-07 20:10:43,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:10:43,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:43,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:10:43,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:10:43,897 INFO L87 Difference]: Start difference. First operand 235 states and 330 transitions. Second operand 4 states. [2019-12-07 20:10:43,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:43,977 INFO L93 Difference]: Finished difference Result 681 states and 945 transitions. [2019-12-07 20:10:43,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:10:43,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 20:10:43,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:43,979 INFO L225 Difference]: With dead ends: 681 [2019-12-07 20:10:43,979 INFO L226 Difference]: Without dead ends: 512 [2019-12-07 20:10:43,980 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-12-07 20:10:43,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-12-07 20:10:43,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 346. [2019-12-07 20:10:43,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-12-07 20:10:43,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 478 transitions. [2019-12-07 20:10:43,997 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 478 transitions. Word has length 33 [2019-12-07 20:10:43,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:43,997 INFO L462 AbstractCegarLoop]: Abstraction has 346 states and 478 transitions. [2019-12-07 20:10:43,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:10:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 478 transitions. [2019-12-07 20:10:43,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 20:10:43,998 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:43,998 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-12-07 20:10:43,998 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-12-07 20:10:43,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:43,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1161394234, now seen corresponding path program 1 times [2019-12-07 20:10:43,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:43,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179701698] [2019-12-07 20:10:43,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:44,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:44,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179701698] [2019-12-07 20:10:44,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:44,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:10:44,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426511675] [2019-12-07 20:10:44,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:10:44,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:44,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:10:44,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:10:44,029 INFO L87 Difference]: Start difference. First operand 346 states and 478 transitions. Second operand 3 states. [2019-12-07 20:10:44,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:44,070 INFO L93 Difference]: Finished difference Result 692 states and 955 transitions. [2019-12-07 20:10:44,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:10:44,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 20:10:44,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:44,073 INFO L225 Difference]: With dead ends: 692 [2019-12-07 20:10:44,073 INFO L226 Difference]: Without dead ends: 422 [2019-12-07 20:10:44,073 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-12-07 20:10:44,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-12-07 20:10:44,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 340. [2019-12-07 20:10:44,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-07 20:10:44,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 464 transitions. [2019-12-07 20:10:44,089 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 464 transitions. Word has length 34 [2019-12-07 20:10:44,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:44,089 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 464 transitions. [2019-12-07 20:10:44,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:10:44,089 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 464 transitions. [2019-12-07 20:10:44,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 20:10:44,090 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:44,090 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-12-07 20:10:44,090 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-12-07 20:10:44,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:44,091 INFO L82 PathProgramCache]: Analyzing trace with hash 741574768, now seen corresponding path program 1 times [2019-12-07 20:10:44,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:44,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552478133] [2019-12-07 20:10:44,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:44,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:44,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552478133] [2019-12-07 20:10:44,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:44,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:10:44,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557240153] [2019-12-07 20:10:44,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:10:44,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:44,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:10:44,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:10:44,167 INFO L87 Difference]: Start difference. First operand 340 states and 464 transitions. Second operand 6 states. [2019-12-07 20:10:44,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:44,350 INFO L93 Difference]: Finished difference Result 1066 states and 1447 transitions. [2019-12-07 20:10:44,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:10:44,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 20:10:44,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:44,354 INFO L225 Difference]: With dead ends: 1066 [2019-12-07 20:10:44,354 INFO L226 Difference]: Without dead ends: 841 [2019-12-07 20:10:44,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:10:44,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-12-07 20:10:44,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 344. [2019-12-07 20:10:44,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-07 20:10:44,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 469 transitions. [2019-12-07 20:10:44,372 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 469 transitions. Word has length 34 [2019-12-07 20:10:44,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:44,372 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 469 transitions. [2019-12-07 20:10:44,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:10:44,372 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 469 transitions. [2019-12-07 20:10:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 20:10:44,373 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:44,373 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-12-07 20:10:44,373 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-12-07 20:10:44,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:44,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1439087305, now seen corresponding path program 1 times [2019-12-07 20:10:44,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:44,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273925577] [2019-12-07 20:10:44,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:44,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:44,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273925577] [2019-12-07 20:10:44,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:44,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:10:44,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654843497] [2019-12-07 20:10:44,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:10:44,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:44,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:10:44,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:10:44,423 INFO L87 Difference]: Start difference. First operand 344 states and 469 transitions. Second operand 5 states. [2019-12-07 20:10:44,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:44,538 INFO L93 Difference]: Finished difference Result 657 states and 910 transitions. [2019-12-07 20:10:44,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:10:44,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 20:10:44,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:44,542 INFO L225 Difference]: With dead ends: 657 [2019-12-07 20:10:44,542 INFO L226 Difference]: Without dead ends: 655 [2019-12-07 20:10:44,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:10:44,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-12-07 20:10:44,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 346. [2019-12-07 20:10:44,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-12-07 20:10:44,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 471 transitions. [2019-12-07 20:10:44,569 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 471 transitions. Word has length 34 [2019-12-07 20:10:44,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:44,569 INFO L462 AbstractCegarLoop]: Abstraction has 346 states and 471 transitions. [2019-12-07 20:10:44,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:10:44,569 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 471 transitions. [2019-12-07 20:10:44,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 20:10:44,570 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:44,570 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-12-07 20:10:44,570 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-12-07 20:10:44,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:44,571 INFO L82 PathProgramCache]: Analyzing trace with hash 599999869, now seen corresponding path program 1 times [2019-12-07 20:10:44,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:44,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812458080] [2019-12-07 20:10:44,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:44,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:44,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812458080] [2019-12-07 20:10:44,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:44,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:10:44,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73941081] [2019-12-07 20:10:44,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:10:44,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:44,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:10:44,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:10:44,626 INFO L87 Difference]: Start difference. First operand 346 states and 471 transitions. Second operand 6 states. [2019-12-07 20:10:44,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:44,712 INFO L93 Difference]: Finished difference Result 728 states and 1004 transitions. [2019-12-07 20:10:44,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:10:44,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-07 20:10:44,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:44,715 INFO L225 Difference]: With dead ends: 728 [2019-12-07 20:10:44,716 INFO L226 Difference]: Without dead ends: 501 [2019-12-07 20:10:44,716 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-12-07 20:10:44,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-12-07 20:10:44,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 352. [2019-12-07 20:10:44,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-12-07 20:10:44,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 477 transitions. [2019-12-07 20:10:44,743 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 477 transitions. Word has length 35 [2019-12-07 20:10:44,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:44,743 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 477 transitions. [2019-12-07 20:10:44,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:10:44,744 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 477 transitions. [2019-12-07 20:10:44,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 20:10:44,744 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:44,744 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-12-07 20:10:44,745 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-12-07 20:10:44,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:44,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1018634930, now seen corresponding path program 1 times [2019-12-07 20:10:44,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:44,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115054074] [2019-12-07 20:10:44,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:44,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115054074] [2019-12-07 20:10:44,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:44,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:10:44,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432888783] [2019-12-07 20:10:44,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:10:44,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:44,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:10:44,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:10:44,814 INFO L87 Difference]: Start difference. First operand 352 states and 477 transitions. Second operand 7 states. [2019-12-07 20:10:45,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:45,144 INFO L93 Difference]: Finished difference Result 1589 states and 2108 transitions. [2019-12-07 20:10:45,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:10:45,145 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-07 20:10:45,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:45,149 INFO L225 Difference]: With dead ends: 1589 [2019-12-07 20:10:45,150 INFO L226 Difference]: Without dead ends: 1333 [2019-12-07 20:10:45,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:10:45,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2019-12-07 20:10:45,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 434. [2019-12-07 20:10:45,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-12-07 20:10:45,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 579 transitions. [2019-12-07 20:10:45,180 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 579 transitions. Word has length 35 [2019-12-07 20:10:45,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:45,180 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 579 transitions. [2019-12-07 20:10:45,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:10:45,180 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 579 transitions. [2019-12-07 20:10:45,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 20:10:45,180 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:45,180 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] [2019-12-07 20:10:45,181 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-12-07 20:10:45,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:45,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1799967409, now seen corresponding path program 1 times [2019-12-07 20:10:45,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:45,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107047677] [2019-12-07 20:10:45,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:45,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:45,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107047677] [2019-12-07 20:10:45,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:45,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:10:45,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809872639] [2019-12-07 20:10:45,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:10:45,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:45,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:10:45,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:10:45,213 INFO L87 Difference]: Start difference. First operand 434 states and 579 transitions. Second operand 3 states. [2019-12-07 20:10:45,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:45,277 INFO L93 Difference]: Finished difference Result 909 states and 1205 transitions. [2019-12-07 20:10:45,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:10:45,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-07 20:10:45,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:45,280 INFO L225 Difference]: With dead ends: 909 [2019-12-07 20:10:45,281 INFO L226 Difference]: Without dead ends: 605 [2019-12-07 20:10:45,281 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-12-07 20:10:45,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-12-07 20:10:45,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 409. [2019-12-07 20:10:45,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-12-07 20:10:45,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 540 transitions. [2019-12-07 20:10:45,310 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 540 transitions. Word has length 36 [2019-12-07 20:10:45,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:45,310 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 540 transitions. [2019-12-07 20:10:45,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:10:45,310 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 540 transitions. [2019-12-07 20:10:45,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 20:10:45,310 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:45,310 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] [2019-12-07 20:10:45,310 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-12-07 20:10:45,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:45,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1758383398, now seen corresponding path program 1 times [2019-12-07 20:10:45,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:45,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672354481] [2019-12-07 20:10:45,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:45,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:45,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672354481] [2019-12-07 20:10:45,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:45,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:10:45,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638073647] [2019-12-07 20:10:45,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:10:45,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:45,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:10:45,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:10:45,340 INFO L87 Difference]: Start difference. First operand 409 states and 540 transitions. Second operand 4 states. [2019-12-07 20:10:45,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:45,438 INFO L93 Difference]: Finished difference Result 1135 states and 1483 transitions. [2019-12-07 20:10:45,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:10:45,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 20:10:45,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:45,443 INFO L225 Difference]: With dead ends: 1135 [2019-12-07 20:10:45,443 INFO L226 Difference]: Without dead ends: 848 [2019-12-07 20:10:45,444 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-12-07 20:10:45,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-12-07 20:10:45,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 560. [2019-12-07 20:10:45,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-12-07 20:10:45,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 729 transitions. [2019-12-07 20:10:45,491 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 729 transitions. Word has length 37 [2019-12-07 20:10:45,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:45,491 INFO L462 AbstractCegarLoop]: Abstraction has 560 states and 729 transitions. [2019-12-07 20:10:45,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:10:45,491 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 729 transitions. [2019-12-07 20:10:45,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 20:10:45,492 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:45,492 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] [2019-12-07 20:10:45,492 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-12-07 20:10:45,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:45,492 INFO L82 PathProgramCache]: Analyzing trace with hash -341222932, now seen corresponding path program 1 times [2019-12-07 20:10:45,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:45,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734457811] [2019-12-07 20:10:45,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:45,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:45,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734457811] [2019-12-07 20:10:45,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:45,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:10:45,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079350393] [2019-12-07 20:10:45,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:10:45,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:45,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:10:45,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:10:45,511 INFO L87 Difference]: Start difference. First operand 560 states and 729 transitions. Second operand 4 states. [2019-12-07 20:10:45,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:45,604 INFO L93 Difference]: Finished difference Result 1261 states and 1626 transitions. [2019-12-07 20:10:45,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:10:45,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 20:10:45,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:45,607 INFO L225 Difference]: With dead ends: 1261 [2019-12-07 20:10:45,607 INFO L226 Difference]: Without dead ends: 728 [2019-12-07 20:10:45,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-07 20:10:45,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-12-07 20:10:45,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 493. [2019-12-07 20:10:45,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-12-07 20:10:45,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 632 transitions. [2019-12-07 20:10:45,640 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 632 transitions. Word has length 37 [2019-12-07 20:10:45,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:45,640 INFO L462 AbstractCegarLoop]: Abstraction has 493 states and 632 transitions. [2019-12-07 20:10:45,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:10:45,640 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 632 transitions. [2019-12-07 20:10:45,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 20:10:45,640 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:45,641 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-12-07 20:10:45,641 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-12-07 20:10:45,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:45,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1580115624, now seen corresponding path program 1 times [2019-12-07 20:10:45,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:45,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966270660] [2019-12-07 20:10:45,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:45,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:45,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966270660] [2019-12-07 20:10:45,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:45,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:10:45,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362483260] [2019-12-07 20:10:45,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:10:45,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:45,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:10:45,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:10:45,661 INFO L87 Difference]: Start difference. First operand 493 states and 632 transitions. Second operand 4 states. [2019-12-07 20:10:45,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:45,726 INFO L93 Difference]: Finished difference Result 1151 states and 1473 transitions. [2019-12-07 20:10:45,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:10:45,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-07 20:10:45,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:45,729 INFO L225 Difference]: With dead ends: 1151 [2019-12-07 20:10:45,729 INFO L226 Difference]: Without dead ends: 690 [2019-12-07 20:10:45,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-07 20:10:45,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-12-07 20:10:45,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 457. [2019-12-07 20:10:45,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-12-07 20:10:45,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 580 transitions. [2019-12-07 20:10:45,771 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 580 transitions. Word has length 40 [2019-12-07 20:10:45,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:45,771 INFO L462 AbstractCegarLoop]: Abstraction has 457 states and 580 transitions. [2019-12-07 20:10:45,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:10:45,771 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 580 transitions. [2019-12-07 20:10:45,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 20:10:45,772 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:45,772 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:45,772 INFO L410 AbstractCegarLoop]: === Iteration 19 === [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-12-07 20:10:45,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:45,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1977763537, now seen corresponding path program 1 times [2019-12-07 20:10:45,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:45,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445152153] [2019-12-07 20:10:45,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:45,854 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:45,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445152153] [2019-12-07 20:10:45,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070023251] [2019-12-07 20:10:45,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d6ca85bd-c32f-4d88-888a-401a1b046081/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:10:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:45,968 INFO L264 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 20:10:45,976 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:10:45,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:10:45,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:10:45,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:10:45,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:10:46,033 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:10:46,033 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:10:46,040 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:10:46,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:10:46,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2019-12-07 20:10:46,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949660562] [2019-12-07 20:10:46,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:10:46,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:46,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:10:46,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:10:46,041 INFO L87 Difference]: Start difference. First operand 457 states and 580 transitions. Second operand 6 states. [2019-12-07 20:10:46,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:46,202 INFO L93 Difference]: Finished difference Result 1277 states and 1649 transitions. [2019-12-07 20:10:46,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:10:46,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-07 20:10:46,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:46,205 INFO L225 Difference]: With dead ends: 1277 [2019-12-07 20:10:46,205 INFO L226 Difference]: Without dead ends: 893 [2019-12-07 20:10:46,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-07 20:10:46,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-12-07 20:10:46,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 457. [2019-12-07 20:10:46,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-12-07 20:10:46,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 577 transitions. [2019-12-07 20:10:46,247 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 577 transitions. Word has length 61 [2019-12-07 20:10:46,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:46,247 INFO L462 AbstractCegarLoop]: Abstraction has 457 states and 577 transitions. [2019-12-07 20:10:46,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:10:46,248 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 577 transitions. [2019-12-07 20:10:46,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 20:10:46,248 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:46,248 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:46,449 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:10:46,449 INFO L410 AbstractCegarLoop]: === Iteration 20 === [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-12-07 20:10:46,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:46,450 INFO L82 PathProgramCache]: Analyzing trace with hash 460303146, now seen corresponding path program 1 times [2019-12-07 20:10:46,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:46,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269855446] [2019-12-07 20:10:46,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:46,535 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:46,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269855446] [2019-12-07 20:10:46,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567583259] [2019-12-07 20:10:46,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d6ca85bd-c32f-4d88-888a-401a1b046081/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:10:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:46,647 INFO L264 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 20:10:46,649 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:10:46,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:10:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:10:46,694 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:10:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:10:46,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:10:46,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2019-12-07 20:10:46,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547919339] [2019-12-07 20:10:46,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:10:46,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:46,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:10:46,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:10:46,701 INFO L87 Difference]: Start difference. First operand 457 states and 577 transitions. Second operand 6 states. [2019-12-07 20:10:46,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:46,900 INFO L93 Difference]: Finished difference Result 1162 states and 1490 transitions. [2019-12-07 20:10:46,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:10:46,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-07 20:10:46,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:46,903 INFO L225 Difference]: With dead ends: 1162 [2019-12-07 20:10:46,903 INFO L226 Difference]: Without dead ends: 778 [2019-12-07 20:10:46,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-07 20:10:46,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-12-07 20:10:46,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 457. [2019-12-07 20:10:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-12-07 20:10:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 574 transitions. [2019-12-07 20:10:46,943 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 574 transitions. Word has length 65 [2019-12-07 20:10:46,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:46,943 INFO L462 AbstractCegarLoop]: Abstraction has 457 states and 574 transitions. [2019-12-07 20:10:46,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:10:46,943 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 574 transitions. [2019-12-07 20:10:46,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 20:10:46,944 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:46,944 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:47,144 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:10:47,145 INFO L410 AbstractCegarLoop]: === Iteration 21 === [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-12-07 20:10:47,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:47,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1242823294, now seen corresponding path program 1 times [2019-12-07 20:10:47,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:47,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372205252] [2019-12-07 20:10:47,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:47,252 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:47,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372205252] [2019-12-07 20:10:47,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526850084] [2019-12-07 20:10:47,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d6ca85bd-c32f-4d88-888a-401a1b046081/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:10:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:47,364 INFO L264 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 20:10:47,368 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:10:47,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:10:47,413 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 20:10:47,413 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:10:47,419 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 20:10:47,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:10:47,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2019-12-07 20:10:47,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535784122] [2019-12-07 20:10:47,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:10:47,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:10:47,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:10:47,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:10:47,421 INFO L87 Difference]: Start difference. First operand 457 states and 574 transitions. Second operand 6 states. [2019-12-07 20:10:47,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:47,582 INFO L93 Difference]: Finished difference Result 1053 states and 1350 transitions. [2019-12-07 20:10:47,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:10:47,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-07 20:10:47,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:47,585 INFO L225 Difference]: With dead ends: 1053 [2019-12-07 20:10:47,585 INFO L226 Difference]: Without dead ends: 683 [2019-12-07 20:10:47,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-07 20:10:47,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-12-07 20:10:47,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 457. [2019-12-07 20:10:47,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-12-07 20:10:47,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 573 transitions. [2019-12-07 20:10:47,618 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 573 transitions. Word has length 68 [2019-12-07 20:10:47,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:47,618 INFO L462 AbstractCegarLoop]: Abstraction has 457 states and 573 transitions. [2019-12-07 20:10:47,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:10:47,618 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 573 transitions. [2019-12-07 20:10:47,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 20:10:47,619 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:47,619 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:47,819 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:10:47,820 INFO L410 AbstractCegarLoop]: === Iteration 22 === [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-12-07 20:10:47,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:47,820 INFO L82 PathProgramCache]: Analyzing trace with hash 134957885, now seen corresponding path program 1 times [2019-12-07 20:10:47,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:10:47,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906616126] [2019-12-07 20:10:47,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:10:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:47,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906616126] [2019-12-07 20:10:47,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22276652] [2019-12-07 20:10:47,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d6ca85bd-c32f-4d88-888a-401a1b046081/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:10:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:48,030 INFO L264 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 20:10:48,034 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:10:48,114 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:48,115 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:10:48,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:10:48,277 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:48,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [116270867] [2019-12-07 20:10:48,295 INFO L159 IcfgInterpreter]: Started Sifa with 53 locations of interest [2019-12-07 20:10:48,295 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:10:48,299 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:10:48,303 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:10:48,303 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:10:56,719 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:10:57,118 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 101 [2019-12-07 20:10:57,471 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-12-07 20:10:57,788 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-12-07 20:10:58,078 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-12-07 20:10:58,386 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2019-12-07 20:10:58,775 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 96 [2019-12-07 20:10:59,145 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 98 [2019-12-07 20:10:59,494 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 98 [2019-12-07 20:11:00,147 WARN L192 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2019-12-07 20:11:00,891 WARN L192 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-12-07 20:11:01,170 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-12-07 20:11:01,516 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-12-07 20:11:02,030 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-12-07 20:11:02,229 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-12-07 20:11:02,414 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-12-07 20:11:02,583 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-12-07 20:11:02,916 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-12-07 20:11:03,139 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-12-07 20:11:03,436 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-12-07 20:11:03,624 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-12-07 20:11:03,826 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-12-07 20:11:04,001 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-12-07 20:11:04,304 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-12-07 20:11:04,504 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-12-07 20:11:04,724 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-12-07 20:11:05,325 WARN L192 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 114 [2019-12-07 20:11:05,976 WARN L192 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 122 [2019-12-07 20:11:06,317 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-12-07 20:11:06,694 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-12-07 20:11:06,957 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-12-07 20:11:07,200 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-12-07 20:11:07,458 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-12-07 20:11:07,753 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-12-07 20:11:07,755 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:11:07,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:11:07,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 16 [2019-12-07 20:11:07,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957654962] [2019-12-07 20:11:07,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 20:11:07,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:11:07,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 20:11:07,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=2661, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 20:11:07,757 INFO L87 Difference]: Start difference. First operand 457 states and 573 transitions. Second operand 17 states. [2019-12-07 20:11:08,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:11:08,505 INFO L93 Difference]: Finished difference Result 1520 states and 1957 transitions. [2019-12-07 20:11:08,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 20:11:08,505 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2019-12-07 20:11:08,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:11:08,509 INFO L225 Difference]: With dead ends: 1520 [2019-12-07 20:11:08,509 INFO L226 Difference]: Without dead ends: 1156 [2019-12-07 20:11:08,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 155 SyntacticMatches, 13 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1625 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=357, Invalid=3425, Unknown=0, NotChecked=0, Total=3782 [2019-12-07 20:11:08,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2019-12-07 20:11:08,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 499. [2019-12-07 20:11:08,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-12-07 20:11:08,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 623 transitions. [2019-12-07 20:11:08,552 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 623 transitions. Word has length 72 [2019-12-07 20:11:08,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:11:08,552 INFO L462 AbstractCegarLoop]: Abstraction has 499 states and 623 transitions. [2019-12-07 20:11:08,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 20:11:08,552 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 623 transitions. [2019-12-07 20:11:08,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 20:11:08,553 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:11:08,553 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:11:08,753 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:11:08,754 INFO L410 AbstractCegarLoop]: === Iteration 23 === [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-12-07 20:11:08,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:11:08,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1384163379, now seen corresponding path program 1 times [2019-12-07 20:11:08,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:11:08,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47493811] [2019-12-07 20:11:08,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:11:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:11:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:11:08,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47493811] [2019-12-07 20:11:08,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450386690] [2019-12-07 20:11:08,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d6ca85bd-c32f-4d88-888a-401a1b046081/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:11:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:11:09,010 INFO L264 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 20:11:09,013 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:11:09,085 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:11:09,085 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:11:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:11:09,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1502412722] [2019-12-07 20:11:09,268 INFO L159 IcfgInterpreter]: Started Sifa with 55 locations of interest [2019-12-07 20:11:09,268 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:11:09,268 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:11:09,268 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:11:09,269 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:11:28,603 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:11:29,384 WARN L192 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 184 [2019-12-07 20:11:30,480 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 219 [2019-12-07 20:11:35,291 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-12-07 20:11:43,877 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 58 [2019-12-07 20:11:43,878 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:11:43,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:11:43,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 17 [2019-12-07 20:11:43,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509062292] [2019-12-07 20:11:43,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 20:11:43,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:11:43,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 20:11:43,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=3102, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 20:11:43,880 INFO L87 Difference]: Start difference. First operand 499 states and 623 transitions. Second operand 18 states. [2019-12-07 20:11:44,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:11:44,705 INFO L93 Difference]: Finished difference Result 1494 states and 1902 transitions. [2019-12-07 20:11:44,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 20:11:44,705 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2019-12-07 20:11:44,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:11:44,709 INFO L225 Difference]: With dead ends: 1494 [2019-12-07 20:11:44,709 INFO L226 Difference]: Without dead ends: 1126 [2019-12-07 20:11:44,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 154 SyntacticMatches, 10 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1553 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=368, Invalid=3922, Unknown=0, NotChecked=0, Total=4290 [2019-12-07 20:11:44,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2019-12-07 20:11:44,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 499. [2019-12-07 20:11:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-12-07 20:11:44,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 622 transitions. [2019-12-07 20:11:44,752 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 622 transitions. Word has length 72 [2019-12-07 20:11:44,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:11:44,752 INFO L462 AbstractCegarLoop]: Abstraction has 499 states and 622 transitions. [2019-12-07 20:11:44,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 20:11:44,752 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 622 transitions. [2019-12-07 20:11:44,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 20:11:44,753 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:11:44,753 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:11:44,954 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:11:44,954 INFO L410 AbstractCegarLoop]: === Iteration 24 === [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-12-07 20:11:44,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:11:44,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1140652883, now seen corresponding path program 2 times [2019-12-07 20:11:44,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:11:44,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204290365] [2019-12-07 20:11:44,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:11:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:11:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:11:45,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204290365] [2019-12-07 20:11:45,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8186180] [2019-12-07 20:11:45,067 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d6ca85bd-c32f-4d88-888a-401a1b046081/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:11:45,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 20:11:45,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:11:45,163 INFO L264 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 20:11:45,165 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:11:45,209 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:11:45,209 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:11:45,239 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:11:45,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [947753108] [2019-12-07 20:11:45,241 INFO L159 IcfgInterpreter]: Started Sifa with 55 locations of interest [2019-12-07 20:11:45,241 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:11:45,241 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:11:45,241 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:11:45,241 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:12:04,523 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:12:05,328 WARN L192 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 184 [2019-12-07 20:12:06,541 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 229 [2019-12-07 20:12:21,409 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 58 [2019-12-07 20:12:21,410 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:12:21,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:12:21,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2019-12-07 20:12:21,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738178241] [2019-12-07 20:12:21,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 20:12:21,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:12:21,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 20:12:21,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=2671, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 20:12:21,412 INFO L87 Difference]: Start difference. First operand 499 states and 622 transitions. Second operand 14 states. [2019-12-07 20:12:26,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:12:26,219 INFO L93 Difference]: Finished difference Result 3047 states and 3900 transitions. [2019-12-07 20:12:26,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-07 20:12:26,219 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2019-12-07 20:12:26,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:12:26,228 INFO L225 Difference]: With dead ends: 3047 [2019-12-07 20:12:26,228 INFO L226 Difference]: Without dead ends: 2683 [2019-12-07 20:12:26,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 158 SyntacticMatches, 10 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3007 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=818, Invalid=8302, Unknown=0, NotChecked=0, Total=9120 [2019-12-07 20:12:26,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2683 states. [2019-12-07 20:12:26,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2683 to 847. [2019-12-07 20:12:26,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-12-07 20:12:26,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1077 transitions. [2019-12-07 20:12:26,315 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1077 transitions. Word has length 72 [2019-12-07 20:12:26,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:12:26,315 INFO L462 AbstractCegarLoop]: Abstraction has 847 states and 1077 transitions. [2019-12-07 20:12:26,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 20:12:26,315 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1077 transitions. [2019-12-07 20:12:26,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 20:12:26,316 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:12:26,316 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:12:26,516 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:12:26,517 INFO L410 AbstractCegarLoop]: === Iteration 25 === [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-12-07 20:12:26,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:12:26,517 INFO L82 PathProgramCache]: Analyzing trace with hash 787778296, now seen corresponding path program 1 times [2019-12-07 20:12:26,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:12:26,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028293993] [2019-12-07 20:12:26,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:12:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:12:26,590 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:12:26,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028293993] [2019-12-07 20:12:26,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283772803] [2019-12-07 20:12:26,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d6ca85bd-c32f-4d88-888a-401a1b046081/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:12:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:12:26,674 INFO L264 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 20:12:26,676 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:12:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:12:26,723 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:12:26,836 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:12:26,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1886875680] [2019-12-07 20:12:26,838 INFO L159 IcfgInterpreter]: Started Sifa with 55 locations of interest [2019-12-07 20:12:26,838 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:12:26,838 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:12:26,838 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:12:26,838 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:12:36,363 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:12:36,704 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 101 [2019-12-07 20:12:37,102 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-12-07 20:12:37,418 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-12-07 20:12:37,714 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-12-07 20:12:38,028 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2019-12-07 20:12:38,415 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 96 [2019-12-07 20:12:38,772 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 98 [2019-12-07 20:12:39,116 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 98 [2019-12-07 20:12:39,478 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2019-12-07 20:12:39,842 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-12-07 20:12:40,121 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-12-07 20:12:40,448 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-12-07 20:12:40,693 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-12-07 20:12:40,965 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-12-07 20:12:41,224 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-12-07 20:12:41,598 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-12-07 20:12:41,803 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-12-07 20:12:42,116 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-12-07 20:12:42,303 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-12-07 20:12:42,514 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-12-07 20:12:42,684 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-12-07 20:12:43,035 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-12-07 20:12:43,233 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-12-07 20:12:43,458 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-12-07 20:12:44,164 WARN L192 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 114 [2019-12-07 20:12:44,934 WARN L192 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 122 [2019-12-07 20:12:45,350 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-12-07 20:12:45,725 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-12-07 20:12:46,015 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-12-07 20:12:46,258 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-12-07 20:12:46,551 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-12-07 20:12:46,838 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-12-07 20:12:46,839 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:12:46,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:12:46,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2019-12-07 20:12:46,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203445606] [2019-12-07 20:12:46,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 20:12:46,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:12:46,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 20:12:46,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=2563, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 20:12:46,841 INFO L87 Difference]: Start difference. First operand 847 states and 1077 transitions. Second operand 14 states. [2019-12-07 20:12:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:12:49,292 INFO L93 Difference]: Finished difference Result 4983 states and 6585 transitions. [2019-12-07 20:12:49,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-07 20:12:49,293 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2019-12-07 20:12:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:12:49,306 INFO L225 Difference]: With dead ends: 4983 [2019-12-07 20:12:49,306 INFO L226 Difference]: Without dead ends: 4313 [2019-12-07 20:12:49,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 163 SyntacticMatches, 11 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3545 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=784, Invalid=7958, Unknown=0, NotChecked=0, Total=8742 [2019-12-07 20:12:49,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2019-12-07 20:12:49,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 2301. [2019-12-07 20:12:49,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2301 states. [2019-12-07 20:12:49,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 2301 states and 3009 transitions. [2019-12-07 20:12:49,540 INFO L78 Accepts]: Start accepts. Automaton has 2301 states and 3009 transitions. Word has length 74 [2019-12-07 20:12:49,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:12:49,540 INFO L462 AbstractCegarLoop]: Abstraction has 2301 states and 3009 transitions. [2019-12-07 20:12:49,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 20:12:49,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 3009 transitions. [2019-12-07 20:12:49,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 20:12:49,542 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:12:49,542 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:12:49,743 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:12:49,743 INFO L410 AbstractCegarLoop]: === Iteration 26 === [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-12-07 20:12:49,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:12:49,743 INFO L82 PathProgramCache]: Analyzing trace with hash -416909560, now seen corresponding path program 1 times [2019-12-07 20:12:49,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:12:49,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678670754] [2019-12-07 20:12:49,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:12:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:12:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:12:49,854 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 20:12:49,854 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 20:12:49,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:12:49 BoogieIcfgContainer [2019-12-07 20:12:49,954 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:12:49,954 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:12:49,954 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:12:49,954 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:12:49,955 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:10:42" (3/4) ... [2019-12-07 20:12:49,956 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 20:12:50,047 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d6ca85bd-c32f-4d88-888a-401a1b046081/bin/utaipan/witness.graphml [2019-12-07 20:12:50,047 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:12:50,048 INFO L168 Benchmark]: Toolchain (without parser) took 129272.63 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 402.1 MB). Free memory was 943.5 MB in the beginning and 907.7 MB in the end (delta: 35.8 MB). Peak memory consumption was 437.9 MB. Max. memory is 11.5 GB. [2019-12-07 20:12:50,048 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:12:50,048 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 20:12:50,048 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:12:50,049 INFO L168 Benchmark]: Boogie Preprocessor took 38.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:12:50,049 INFO L168 Benchmark]: RCFGBuilder took 964.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 910.8 MB in the end (delta: 176.0 MB). Peak memory consumption was 176.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:12:50,049 INFO L168 Benchmark]: TraceAbstraction took 127833.36 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 294.1 MB). Free memory was 910.8 MB in the beginning and 933.8 MB in the end (delta: -23.1 MB). Peak memory consumption was 271.1 MB. Max. memory is 11.5 GB. [2019-12-07 20:12:50,049 INFO L168 Benchmark]: Witness Printer took 92.86 ms. Allocated memory is still 1.4 GB. Free memory was 933.8 MB in the beginning and 907.7 MB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-12-07 20:12:50,050 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 296.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 964.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 910.8 MB in the end (delta: 176.0 MB). Peak memory consumption was 176.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 127833.36 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 294.1 MB). Free memory was 910.8 MB in the beginning and 933.8 MB in the end (delta: -23.1 MB). Peak memory consumption was 271.1 MB. Max. memory is 11.5 GB. * Witness Printer took 92.86 ms. Allocated memory is still 1.4 GB. Free memory was 933.8 MB in the beginning and 907.7 MB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 653]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [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 ; [L96] _Bool side1Failed ; [L97] _Bool side2Failed ; [L98] msg_t side1_written ; [L99] msg_t side2_written ; [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 ; [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 ; [L455] 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}; [L577] int c1 ; [L578] int i2 ; [L581] c1 = 0 [L582] side1Failed = __VERIFIER_nondet_bool() [L583] side2Failed = __VERIFIER_nondet_bool() [L584] side1_written = __VERIFIER_nondet_char() [L585] side2_written = __VERIFIER_nondet_char() [L586] side1Failed_History_0 = __VERIFIER_nondet_bool() [L587] side1Failed_History_1 = __VERIFIER_nondet_bool() [L588] side1Failed_History_2 = __VERIFIER_nondet_bool() [L589] side2Failed_History_0 = __VERIFIER_nondet_bool() [L590] side2Failed_History_1 = __VERIFIER_nondet_bool() [L591] side2Failed_History_2 = __VERIFIER_nondet_bool() [L592] active_side_History_0 = __VERIFIER_nondet_char() [L593] active_side_History_1 = __VERIFIER_nondet_char() [L594] active_side_History_2 = __VERIFIER_nondet_char() [L595] manual_selection_History_0 = __VERIFIER_nondet_char() [L596] manual_selection_History_1 = __VERIFIER_nondet_char() [L597] 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); [L598] i2 = init() [L600] cs1_old = nomsg [L601] cs1_new = nomsg [L602] cs2_old = nomsg [L603] cs2_new = nomsg [L604] s1s2_old = nomsg [L605] s1s2_new = nomsg [L606] s1s1_old = nomsg [L607] s1s1_new = nomsg [L608] s2s1_old = nomsg [L609] s2s1_new = nomsg [L610] s2s2_old = nomsg [L611] s2s2_new = nomsg [L612] s1p_old = nomsg [L613] s1p_new = nomsg [L614] s2p_old = nomsg [L615] s2p_new = nomsg [L616] 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] [L617] COND TRUE 1 [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=-126, cs1_old=-1, cs2=0, cs2_new=-126, cs2_old=-1, manual_selection_History_0=-126, 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=1, side1Failed_History_0=1, 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 TRUE \read(side1Failed) [L320] EXPR nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L320] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L321] EXPR nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L321] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L322] EXPR nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L322] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L323] side1_written = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-126, cs1_old=-1, cs2=0, cs2_new=-126, cs2_old=-1, manual_selection_History_0=-126, 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=1, side1Failed_History_0=1, 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=-126, cs1_old=-1, cs2=0, cs2_new=-126, cs2_old=-1, manual_selection_History_0=-126, 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=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [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=-126, cs1_old=-1, cs2=0, cs2_new=-126, cs2_old=-1, manual_selection_History_0=-126, 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=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L389] COND TRUE (int )side1 == (int )side2 [L390] next_state = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-126, cs1_old=-1, cs2=0, cs2_new=-126, cs2_old=-1, manual_selection_History_0=-126, 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=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [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=-126, cs1_old=-1, cs2=0, cs2_new=-126, cs2_old=-1, manual_selection_History_0=-126, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [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=-126, cs1_old=-1, cs2=0, cs2_new=-126, cs2_old=-1, manual_selection_History_0=-126, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [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 [L436] COND FALSE !((int )side1 == 1) [L439] COND FALSE !((int )side2 == 1) [L442] COND FALSE !((int )side1 == 0) [L449] active_side = (int8_t )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 [L623] cs1_old = cs1_new [L624] cs1_new = nomsg [L625] cs2_old = cs2_new [L626] cs2_new = nomsg [L627] s1s2_old = s1s2_new [L628] s1s2_new = nomsg [L629] s1s1_old = s1s1_new [L630] s1s1_new = nomsg [L631] s2s1_old = s2s1_new [L632] s2s1_new = nomsg [L633] s2s2_old = s2s2_new [L634] s2s2_new = nomsg [L635] s1p_old = s1p_new [L636] s1p_new = nomsg [L637] s2p_old = s2p_new [L638] s2p_new = nomsg [L458] int tmp ; [L459] msg_t tmp___0 ; [L460] _Bool tmp___1 ; [L461] _Bool tmp___2 ; [L462] _Bool tmp___3 ; [L463] _Bool tmp___4 ; [L464] int8_t tmp___5 ; [L465] _Bool tmp___6 ; [L466] _Bool tmp___7 ; [L467] _Bool tmp___8 ; [L468] int8_t tmp___9 ; [L469] _Bool tmp___10 ; [L470] _Bool tmp___11 ; [L471] _Bool tmp___12 ; [L472] msg_t tmp___13 ; [L473] _Bool tmp___14 ; [L474] _Bool tmp___15 ; [L475] _Bool tmp___16 ; [L476] _Bool tmp___17 ; [L477] int8_t tmp___18 ; [L478] int8_t tmp___19 ; [L479] int8_t tmp___20 ; [L482] COND FALSE !(! side1Failed) [L485] COND TRUE ! side2Failed [L486] 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=-126, cs2=0, cs2_new=-1, cs2_old=-126, manual_selection_History_0=-126, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [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=-126, cs2=0, cs2_new=-1, cs2_old=-126, manual_selection_History_0=-126, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L491] tmp___0 = read_manual_selection_history((unsigned char)1) [L492] 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=-126, cs2=0, cs2_new=-1, cs2_old=-126, manual_selection_History_0=-126, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [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=-126, cs2=0, cs2_new=-1, cs2_old=-126, manual_selection_History_0=-126, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L493] tmp___1 = read_side1_failed_history((unsigned char)1) [L494] 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=-126, cs2=0, cs2_new=-1, cs2_old=-126, manual_selection_History_0=-126, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L495] tmp___2 = read_side1_failed_history((unsigned char)0) [L496] COND FALSE !(! tmp___2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-126, cs2=0, cs2_new=-1, cs2_old=-126, manual_selection_History_0=-126, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [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=-126, cs2=0, cs2_new=-1, cs2_old=-126, manual_selection_History_0=-126, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [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=-126, cs2=0, cs2_new=-1, cs2_old=-126, manual_selection_History_0=-126, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L521] tmp___7 = read_side1_failed_history((unsigned char)1) [L522] COND FALSE !(\read(tmp___7)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-126, cs2=0, cs2_new=-1, cs2_old=-126, manual_selection_History_0=-126, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [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=-126, cs2=0, cs2_new=-1, cs2_old=-126, manual_selection_History_0=-126, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [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=-126, cs2=0, cs2_new=-1, cs2_old=-126, manual_selection_History_0=-126, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L537] tmp___11 = read_side1_failed_history((unsigned char)1) [L538] COND TRUE ! tmp___11 [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=-126, cs2=0, cs2_new=-1, cs2_old=-126, manual_selection_History_0=-126, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [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=-126, cs2=0, cs2_new=-1, cs2_old=-126, manual_selection_History_0=-126, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L539] tmp___12 = read_side2_failed_history((unsigned char)1) [L540] COND FALSE !(\read(tmp___12)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-126, cs2=0, cs2_new=-1, cs2_old=-126, manual_selection_History_0=-126, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L190] 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=-126, cs2=0, cs2_new=-1, cs2_old=-126, manual_selection_History_0=-126, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L193] COND FALSE !((int )index == 1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-126, cs2=0, cs2_new=-1, cs2_old=-126, manual_selection_History_0=-126, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L196] COND TRUE (int )index == 2 [L197] return (active_side_History_2); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-126, cs2=0, cs2_new=-1, cs2_old=-126, manual_selection_History_0=-126, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L553] tmp___20 = read_active_side_history((unsigned char)2) [L554] COND FALSE !((int )tmp___20 > -2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-126, cs2=0, cs2_new=-1, cs2_old=-126, manual_selection_History_0=-126, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L572] return (1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-126, cs2=0, cs2_new=-1, cs2_old=-126, manual_selection_History_0=-126, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L639] c1 = check() [L651] COND FALSE !(! arg) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-126, cs2=0, cs2_new=-1, cs2_old=-126, manual_selection_History_0=-126, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L617] COND TRUE 1 [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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-126, cs2=0, cs2_new=0, cs2_old=-126, manual_selection_History_0=0, manual_selection_History_1=-126, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-126, manual_selection_History_0=0, manual_selection_History_1=-126, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L332] COND FALSE !((int )side1 == (int )side2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-126, manual_selection_History_0=0, manual_selection_History_1=-126, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L335] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-126, manual_selection_History_0=0, manual_selection_History_1=-126, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L336] COND TRUE (int )side2 != (int )nomsg [L337] next_state = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-126, manual_selection_History_0=0, manual_selection_History_1=-126, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-126, manual_selection_History_0=0, manual_selection_History_1=-126, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-126, manual_selection_History_0=0, manual_selection_History_1=-126, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L376] COND TRUE \read(side2Failed) [L377] EXPR nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new [L377] s2s1_new = nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new [L378] EXPR nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new [L378] s2s2_new = nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new [L379] EXPR nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new [L379] s2p_new = nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new [L380] side2_written = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-126, manual_selection_History_0=0, manual_selection_History_1=-126, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-126, manual_selection_History_0=0, manual_selection_History_1=-126, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [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 [L436] COND FALSE !((int )side1 == 1) [L439] COND FALSE !((int )side2 == 1) [L442] COND FALSE !((int )side1 == 0) [L449] active_side = (int8_t )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 [L623] cs1_old = cs1_new [L624] cs1_new = nomsg [L625] cs2_old = cs2_new [L626] cs2_new = nomsg [L627] s1s2_old = s1s2_new [L628] s1s2_new = nomsg [L629] s1s1_old = s1s1_new [L630] s1s1_new = nomsg [L631] s2s1_old = s2s1_new [L632] s2s1_new = nomsg [L633] s2s2_old = s2s2_new [L634] s2s2_new = nomsg [L635] s1p_old = s1p_new [L636] s1p_new = nomsg [L637] s2p_old = s2p_new [L638] s2p_new = nomsg [L458] int tmp ; [L459] msg_t tmp___0 ; [L460] _Bool tmp___1 ; [L461] _Bool tmp___2 ; [L462] _Bool tmp___3 ; [L463] _Bool tmp___4 ; [L464] int8_t tmp___5 ; [L465] _Bool tmp___6 ; [L466] _Bool tmp___7 ; [L467] _Bool tmp___8 ; [L468] int8_t tmp___9 ; [L469] _Bool tmp___10 ; [L470] _Bool tmp___11 ; [L471] _Bool tmp___12 ; [L472] msg_t tmp___13 ; [L473] _Bool tmp___14 ; [L474] _Bool tmp___15 ; [L475] _Bool tmp___16 ; [L476] _Bool tmp___17 ; [L477] int8_t tmp___18 ; [L478] int8_t tmp___19 ; [L479] int8_t tmp___20 ; [L482] COND TRUE ! side1Failed [L483] tmp = 1 [L220] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=-126, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L223] COND TRUE (int )index == 1 [L224] return (manual_selection_History_1); VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=-126, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L491] tmp___0 = read_manual_selection_history((unsigned char)1) [L492] COND FALSE !(! tmp___0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=-126, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L130] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=-126, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L133] COND TRUE (int )index == 1 [L134] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=-126, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L521] tmp___7 = read_side1_failed_history((unsigned char)1) [L522] COND TRUE \read(tmp___7) [L160] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=-126, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L163] COND TRUE (int )index == 1 [L164] return (side2Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=-126, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L523] tmp___8 = read_side2_failed_history((unsigned char)1) [L524] COND TRUE ! tmp___8 [L190] COND TRUE (int )index == 0 [L191] return (active_side_History_0); VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=-126, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L525] tmp___5 = read_active_side_history((unsigned char)0) [L526] COND TRUE ! ((int )tmp___5 == 2) [L527] return (0); VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=-126, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L639] c1 = check() [L651] COND TRUE ! arg VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=-126, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L653] __VERIFIER_error() VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=-126, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 231 locations, 23 error locations. Result: UNSAFE, OverallTime: 127.6s, OverallIterations: 26, TraceHistogramMax: 2, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8112 SDtfs, 16055 SDslu, 26138 SDs, 0 SdLazy, 4870 SolverSat, 337 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1540 GetRequests, 1050 SyntacticMatches, 53 SemanticMatches, 437 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9839 ImplicationChecksByTransitivity, 60.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2301occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 25 MinimizatonAttempts, 10624 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1571 NumberOfCodeBlocks, 1571 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1942 ConstructedInterpolants, 0 QuantifiedInterpolants, 473682 SizeOfPredicates, 69 NumberOfNonLiveVariables, 3794 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 39 InterpolantComputations, 24 PerfectInterpolantSequences, 323/408 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! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...