./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_13349c7a-0eee-413f-acd8-42ed9575ef62/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_13349c7a-0eee-413f-acd8-42ed9575ef62/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_13349c7a-0eee-413f-acd8-42ed9575ef62/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_13349c7a-0eee-413f-acd8-42ed9575ef62/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_13349c7a-0eee-413f-acd8-42ed9575ef62/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_13349c7a-0eee-413f-acd8-42ed9575ef62/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2df66fc9f4186897494a35ad1d7c8260a1cba0d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.2.0-a4ecdab [2020-11-30 02:32:30,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 02:32:30,620 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 02:32:30,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 02:32:30,691 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 02:32:30,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 02:32:30,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 02:32:30,717 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 02:32:30,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 02:32:30,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 02:32:30,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 02:32:30,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 02:32:30,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 02:32:30,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 02:32:30,740 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 02:32:30,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 02:32:30,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 02:32:30,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 02:32:30,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 02:32:30,764 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 02:32:30,767 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 02:32:30,769 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 02:32:30,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 02:32:30,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 02:32:30,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 02:32:30,787 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 02:32:30,787 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 02:32:30,790 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 02:32:30,791 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 02:32:30,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 02:32:30,794 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 02:32:30,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 02:32:30,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 02:32:30,800 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 02:32:30,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 02:32:30,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 02:32:30,803 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 02:32:30,804 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 02:32:30,804 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 02:32:30,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 02:32:30,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 02:32:30,810 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_13349c7a-0eee-413f-acd8-42ed9575ef62/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-30 02:32:30,869 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 02:32:30,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 02:32:30,872 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 02:32:30,872 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 02:32:30,872 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 02:32:30,873 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 02:32:30,873 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-30 02:32:30,873 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 02:32:30,874 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 02:32:30,874 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-30 02:32:30,875 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-30 02:32:30,876 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 02:32:30,876 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-30 02:32:30,876 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-30 02:32:30,877 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-30 02:32:30,878 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 02:32:30,878 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 02:32:30,878 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 02:32:30,879 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 02:32:30,879 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 02:32:30,879 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 02:32:30,880 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 02:32:30,880 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 02:32:30,880 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 02:32:30,880 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 02:32:30,881 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 02:32:30,881 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 02:32:30,881 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 02:32:30,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 02:32:30,882 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 02:32:30,882 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 02:32:30,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 02:32:30,883 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 02:32:30,884 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 02:32:30,884 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 02:32:30,884 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-30 02:32:30,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 02:32:30,885 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 02:32:30,885 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 02:32:30,885 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 02:32:30,886 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_13349c7a-0eee-413f-acd8-42ed9575ef62/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_13349c7a-0eee-413f-acd8-42ed9575ef62/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(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2df66fc9f4186897494a35ad1d7c8260a1cba0d [2020-11-30 02:32:31,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 02:32:31,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 02:32:31,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 02:32:31,303 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 02:32:31,304 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 02:32:31,305 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_13349c7a-0eee-413f-acd8-42ed9575ef62/bin/utaipan/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2020-11-30 02:32:31,404 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_13349c7a-0eee-413f-acd8-42ed9575ef62/bin/utaipan/data/aa1135904/90d93faaa5514adc9ecf781bd639670e/FLAGd210e569d [2020-11-30 02:32:32,199 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 02:32:32,202 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_13349c7a-0eee-413f-acd8-42ed9575ef62/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2020-11-30 02:32:32,229 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_13349c7a-0eee-413f-acd8-42ed9575ef62/bin/utaipan/data/aa1135904/90d93faaa5514adc9ecf781bd639670e/FLAGd210e569d [2020-11-30 02:32:32,450 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_13349c7a-0eee-413f-acd8-42ed9575ef62/bin/utaipan/data/aa1135904/90d93faaa5514adc9ecf781bd639670e [2020-11-30 02:32:32,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 02:32:32,460 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 02:32:32,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 02:32:32,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 02:32:32,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 02:32:32,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:32:32" (1/1) ... [2020-11-30 02:32:32,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bd01f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:32:32, skipping insertion in model container [2020-11-30 02:32:32,473 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:32:32" (1/1) ... [2020-11-30 02:32:32,482 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 02:32:32,529 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 02:32:32,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:32:32,909 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 02:32:33,057 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:32:33,088 INFO L208 MainTranslator]: Completed translation [2020-11-30 02:32:33,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:32:33 WrapperNode [2020-11-30 02:32:33,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 02:32:33,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 02:32:33,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 02:32:33,098 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 02:32:33,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:32:33" (1/1) ... [2020-11-30 02:32:33,143 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:32:33" (1/1) ... [2020-11-30 02:32:33,215 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 02:32:33,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 02:32:33,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 02:32:33,216 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 02:32:33,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:32:33" (1/1) ... [2020-11-30 02:32:33,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:32:33" (1/1) ... [2020-11-30 02:32:33,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:32:33" (1/1) ... [2020-11-30 02:32:33,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:32:33" (1/1) ... [2020-11-30 02:32:33,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:32:33" (1/1) ... [2020-11-30 02:32:33,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:32:33" (1/1) ... [2020-11-30 02:32:33,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:32:33" (1/1) ... [2020-11-30 02:32:33,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 02:32:33,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 02:32:33,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 02:32:33,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 02:32:33,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:32:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_13349c7a-0eee-413f-acd8-42ed9575ef62/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 [2020-11-30 02:32:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 02:32:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 02:32:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 02:32:33,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 02:32:36,244 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 02:32:36,244 INFO L298 CfgBuilder]: Removed 169 assume(true) statements. [2020-11-30 02:32:36,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:32:36 BoogieIcfgContainer [2020-11-30 02:32:36,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 02:32:36,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 02:32:36,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 02:32:36,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 02:32:36,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 02:32:32" (1/3) ... [2020-11-30 02:32:36,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626e655a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:32:36, skipping insertion in model container [2020-11-30 02:32:36,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:32:33" (2/3) ... [2020-11-30 02:32:36,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626e655a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:32:36, skipping insertion in model container [2020-11-30 02:32:36,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:32:36" (3/3) ... [2020-11-30 02:32:36,266 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2020-11-30 02:32:36,280 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 02:32:36,286 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2020-11-30 02:32:36,300 INFO L253 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2020-11-30 02:32:36,348 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 02:32:36,348 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 02:32:36,349 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 02:32:36,349 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 02:32:36,349 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 02:32:36,349 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 02:32:36,350 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 02:32:36,350 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 02:32:36,383 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2020-11-30 02:32:36,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-30 02:32:36,395 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:32:36,396 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:32:36,397 INFO L429 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]=== [2020-11-30 02:32:36,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:32:36,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1084927956, now seen corresponding path program 1 times [2020-11-30 02:32:36,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:32:36,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828611570] [2020-11-30 02:32:36,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:32:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:32:36,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:32:36,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828611570] [2020-11-30 02:32:36,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:32:36,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:32:36,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594986752] [2020-11-30 02:32:36,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:32:36,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:32:36,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:32:36,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:32:36,846 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2020-11-30 02:32:37,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:32:37,011 INFO L93 Difference]: Finished difference Result 472 states and 737 transitions. [2020-11-30 02:32:37,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:32:37,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-30 02:32:37,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:32:37,042 INFO L225 Difference]: With dead ends: 472 [2020-11-30 02:32:37,054 INFO L226 Difference]: Without dead ends: 236 [2020-11-30 02:32:37,059 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:32:37,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-11-30 02:32:37,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 212. [2020-11-30 02:32:37,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-11-30 02:32:37,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 308 transitions. [2020-11-30 02:32:37,154 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 308 transitions. Word has length 11 [2020-11-30 02:32:37,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:32:37,155 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 308 transitions. [2020-11-30 02:32:37,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:32:37,155 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 308 transitions. [2020-11-30 02:32:37,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-30 02:32:37,158 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:32:37,158 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:32:37,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 02:32:37,159 INFO L429 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]=== [2020-11-30 02:32:37,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:32:37,163 INFO L82 PathProgramCache]: Analyzing trace with hash -809520003, now seen corresponding path program 1 times [2020-11-30 02:32:37,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:32:37,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312872811] [2020-11-30 02:32:37,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:32:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:32:37,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:32:37,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312872811] [2020-11-30 02:32:37,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:32:37,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:32:37,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634599459] [2020-11-30 02:32:37,379 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:32:37,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:32:37,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:32:37,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:32:37,381 INFO L87 Difference]: Start difference. First operand 212 states and 308 transitions. Second operand 4 states. [2020-11-30 02:32:37,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:32:37,460 INFO L93 Difference]: Finished difference Result 649 states and 946 transitions. [2020-11-30 02:32:37,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:32:37,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-30 02:32:37,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:32:37,466 INFO L225 Difference]: With dead ends: 649 [2020-11-30 02:32:37,467 INFO L226 Difference]: Without dead ends: 438 [2020-11-30 02:32:37,469 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:32:37,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2020-11-30 02:32:37,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 234. [2020-11-30 02:32:37,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-11-30 02:32:37,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 342 transitions. [2020-11-30 02:32:37,493 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 342 transitions. Word has length 15 [2020-11-30 02:32:37,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:32:37,494 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 342 transitions. [2020-11-30 02:32:37,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:32:37,494 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 342 transitions. [2020-11-30 02:32:37,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-30 02:32:37,495 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:32:37,496 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:32:37,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 02:32:37,496 INFO L429 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]=== [2020-11-30 02:32:37,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:32:37,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1577180639, now seen corresponding path program 1 times [2020-11-30 02:32:37,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:32:37,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132285867] [2020-11-30 02:32:37,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:32:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:32:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:32:37,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132285867] [2020-11-30 02:32:37,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:32:37,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 02:32:37,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016308180] [2020-11-30 02:32:37,634 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:32:37,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:32:37,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:32:37,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:32:37,635 INFO L87 Difference]: Start difference. First operand 234 states and 342 transitions. Second operand 5 states. [2020-11-30 02:32:37,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:32:37,809 INFO L93 Difference]: Finished difference Result 857 states and 1248 transitions. [2020-11-30 02:32:37,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 02:32:37,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-11-30 02:32:37,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:32:37,818 INFO L225 Difference]: With dead ends: 857 [2020-11-30 02:32:37,819 INFO L226 Difference]: Without dead ends: 646 [2020-11-30 02:32:37,826 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-30 02:32:37,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-11-30 02:32:37,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 235. [2020-11-30 02:32:37,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2020-11-30 02:32:37,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 343 transitions. [2020-11-30 02:32:37,875 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 343 transitions. Word has length 16 [2020-11-30 02:32:37,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:32:37,876 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 343 transitions. [2020-11-30 02:32:37,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:32:37,876 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 343 transitions. [2020-11-30 02:32:37,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 02:32:37,877 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:32:37,877 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:32:37,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 02:32:37,878 INFO L429 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]=== [2020-11-30 02:32:37,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:32:37,878 INFO L82 PathProgramCache]: Analyzing trace with hash 851205702, now seen corresponding path program 1 times [2020-11-30 02:32:37,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:32:37,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706891686] [2020-11-30 02:32:37,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:32:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:32:38,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:32:38,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706891686] [2020-11-30 02:32:38,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:32:38,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:32:38,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127850658] [2020-11-30 02:32:38,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:32:38,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:32:38,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:32:38,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:32:38,030 INFO L87 Difference]: Start difference. First operand 235 states and 343 transitions. Second operand 4 states. [2020-11-30 02:32:38,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:32:38,109 INFO L93 Difference]: Finished difference Result 652 states and 949 transitions. [2020-11-30 02:32:38,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:32:38,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-11-30 02:32:38,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:32:38,115 INFO L225 Difference]: With dead ends: 652 [2020-11-30 02:32:38,116 INFO L226 Difference]: Without dead ends: 441 [2020-11-30 02:32:38,117 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:32:38,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2020-11-30 02:32:38,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 236. [2020-11-30 02:32:38,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-11-30 02:32:38,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 344 transitions. [2020-11-30 02:32:38,134 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 344 transitions. Word has length 18 [2020-11-30 02:32:38,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:32:38,135 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 344 transitions. [2020-11-30 02:32:38,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:32:38,135 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 344 transitions. [2020-11-30 02:32:38,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 02:32:38,137 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:32:38,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:32:38,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 02:32:38,137 INFO L429 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]=== [2020-11-30 02:32:38,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:32:38,139 INFO L82 PathProgramCache]: Analyzing trace with hash 55372003, now seen corresponding path program 1 times [2020-11-30 02:32:38,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:32:38,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123954750] [2020-11-30 02:32:38,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:32:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:32:38,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:32:38,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123954750] [2020-11-30 02:32:38,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:32:38,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:32:38,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751282130] [2020-11-30 02:32:38,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:32:38,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:32:38,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:32:38,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:32:38,260 INFO L87 Difference]: Start difference. First operand 236 states and 344 transitions. Second operand 3 states. [2020-11-30 02:32:38,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:32:38,313 INFO L93 Difference]: Finished difference Result 474 states and 693 transitions. [2020-11-30 02:32:38,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:32:38,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-11-30 02:32:38,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:32:38,319 INFO L225 Difference]: With dead ends: 474 [2020-11-30 02:32:38,319 INFO L226 Difference]: Without dead ends: 263 [2020-11-30 02:32:38,320 INFO L677 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 [2020-11-30 02:32:38,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2020-11-30 02:32:38,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 231. [2020-11-30 02:32:38,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2020-11-30 02:32:38,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 336 transitions. [2020-11-30 02:32:38,336 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 336 transitions. Word has length 18 [2020-11-30 02:32:38,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:32:38,337 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 336 transitions. [2020-11-30 02:32:38,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:32:38,337 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 336 transitions. [2020-11-30 02:32:38,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 02:32:38,345 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:32:38,346 INFO L422 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] [2020-11-30 02:32:38,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 02:32:38,346 INFO L429 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]=== [2020-11-30 02:32:38,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:32:38,348 INFO L82 PathProgramCache]: Analyzing trace with hash 2105679485, now seen corresponding path program 1 times [2020-11-30 02:32:38,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:32:38,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602753720] [2020-11-30 02:32:38,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:32:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:32:38,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:32:38,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602753720] [2020-11-30 02:32:38,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:32:38,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:32:38,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834649060] [2020-11-30 02:32:38,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:32:38,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:32:38,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:32:38,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:32:38,456 INFO L87 Difference]: Start difference. First operand 231 states and 336 transitions. Second operand 3 states. [2020-11-30 02:32:38,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:32:38,566 INFO L93 Difference]: Finished difference Result 473 states and 692 transitions. [2020-11-30 02:32:38,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:32:38,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-11-30 02:32:38,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:32:38,570 INFO L225 Difference]: With dead ends: 473 [2020-11-30 02:32:38,570 INFO L226 Difference]: Without dead ends: 267 [2020-11-30 02:32:38,571 INFO L677 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 [2020-11-30 02:32:38,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-11-30 02:32:38,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 211. [2020-11-30 02:32:38,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-11-30 02:32:38,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 304 transitions. [2020-11-30 02:32:38,583 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 304 transitions. Word has length 22 [2020-11-30 02:32:38,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:32:38,583 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 304 transitions. [2020-11-30 02:32:38,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:32:38,583 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 304 transitions. [2020-11-30 02:32:38,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-30 02:32:38,584 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:32:38,585 INFO L422 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] [2020-11-30 02:32:38,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 02:32:38,585 INFO L429 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]=== [2020-11-30 02:32:38,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:32:38,586 INFO L82 PathProgramCache]: Analyzing trace with hash -929169641, now seen corresponding path program 1 times [2020-11-30 02:32:38,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:32:38,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600898823] [2020-11-30 02:32:38,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:32:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:32:38,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:32:38,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600898823] [2020-11-30 02:32:38,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:32:38,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:32:38,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501254060] [2020-11-30 02:32:38,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:32:38,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:32:38,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:32:38,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:32:38,681 INFO L87 Difference]: Start difference. First operand 211 states and 304 transitions. Second operand 3 states. [2020-11-30 02:32:38,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:32:38,819 INFO L93 Difference]: Finished difference Result 441 states and 636 transitions. [2020-11-30 02:32:38,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:32:38,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-11-30 02:32:38,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:32:38,822 INFO L225 Difference]: With dead ends: 441 [2020-11-30 02:32:38,822 INFO L226 Difference]: Without dead ends: 255 [2020-11-30 02:32:38,824 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:32:38,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-11-30 02:32:38,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 199. [2020-11-30 02:32:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-11-30 02:32:38,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 286 transitions. [2020-11-30 02:32:38,838 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 286 transitions. Word has length 26 [2020-11-30 02:32:38,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:32:38,838 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 286 transitions. [2020-11-30 02:32:38,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:32:38,838 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 286 transitions. [2020-11-30 02:32:38,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-30 02:32:38,842 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:32:38,842 INFO L422 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] [2020-11-30 02:32:38,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 02:32:38,843 INFO L429 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]=== [2020-11-30 02:32:38,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:32:38,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1817268599, now seen corresponding path program 1 times [2020-11-30 02:32:38,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:32:38,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971748781] [2020-11-30 02:32:38,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:32:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:32:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:32:38,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971748781] [2020-11-30 02:32:38,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:32:38,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:32:38,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26382692] [2020-11-30 02:32:38,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:32:38,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:32:38,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:32:38,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:32:38,947 INFO L87 Difference]: Start difference. First operand 199 states and 286 transitions. Second operand 3 states. [2020-11-30 02:32:39,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:32:39,055 INFO L93 Difference]: Finished difference Result 437 states and 628 transitions. [2020-11-30 02:32:39,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:32:39,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-11-30 02:32:39,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:32:39,058 INFO L225 Difference]: With dead ends: 437 [2020-11-30 02:32:39,059 INFO L226 Difference]: Without dead ends: 263 [2020-11-30 02:32:39,059 INFO L677 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 [2020-11-30 02:32:39,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2020-11-30 02:32:39,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 179. [2020-11-30 02:32:39,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-11-30 02:32:39,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 254 transitions. [2020-11-30 02:32:39,072 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 254 transitions. Word has length 27 [2020-11-30 02:32:39,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:32:39,075 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 254 transitions. [2020-11-30 02:32:39,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:32:39,075 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 254 transitions. [2020-11-30 02:32:39,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-30 02:32:39,077 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:32:39,077 INFO L422 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] [2020-11-30 02:32:39,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 02:32:39,078 INFO L429 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]=== [2020-11-30 02:32:39,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:32:39,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1278331397, now seen corresponding path program 1 times [2020-11-30 02:32:39,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:32:39,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851032657] [2020-11-30 02:32:39,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:32:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:32:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:32:39,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851032657] [2020-11-30 02:32:39,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:32:39,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 02:32:39,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182310795] [2020-11-30 02:32:39,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:32:39,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:32:39,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:32:39,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:32:39,365 INFO L87 Difference]: Start difference. First operand 179 states and 254 transitions. Second operand 6 states. [2020-11-30 02:32:39,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:32:39,682 INFO L93 Difference]: Finished difference Result 613 states and 857 transitions. [2020-11-30 02:32:39,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 02:32:39,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2020-11-30 02:32:39,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:32:39,687 INFO L225 Difference]: With dead ends: 613 [2020-11-30 02:32:39,688 INFO L226 Difference]: Without dead ends: 459 [2020-11-30 02:32:39,689 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-30 02:32:39,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2020-11-30 02:32:39,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 214. [2020-11-30 02:32:39,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-11-30 02:32:39,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 304 transitions. [2020-11-30 02:32:39,728 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 304 transitions. Word has length 32 [2020-11-30 02:32:39,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:32:39,729 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 304 transitions. [2020-11-30 02:32:39,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:32:39,730 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 304 transitions. [2020-11-30 02:32:39,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-30 02:32:39,731 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:32:39,731 INFO L422 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] [2020-11-30 02:32:39,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 02:32:39,732 INFO L429 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]=== [2020-11-30 02:32:39,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:32:39,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1222260558, now seen corresponding path program 1 times [2020-11-30 02:32:39,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:32:39,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701133852] [2020-11-30 02:32:39,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:32:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:32:39,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:32:39,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701133852] [2020-11-30 02:32:39,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:32:39,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:32:39,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606321728] [2020-11-30 02:32:39,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:32:39,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:32:39,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:32:39,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:32:39,822 INFO L87 Difference]: Start difference. First operand 214 states and 304 transitions. Second operand 3 states. [2020-11-30 02:32:39,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:32:39,895 INFO L93 Difference]: Finished difference Result 388 states and 553 transitions. [2020-11-30 02:32:39,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:32:39,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-11-30 02:32:39,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:32:39,898 INFO L225 Difference]: With dead ends: 388 [2020-11-30 02:32:39,898 INFO L226 Difference]: Without dead ends: 234 [2020-11-30 02:32:39,899 INFO L677 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 [2020-11-30 02:32:39,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-11-30 02:32:39,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 210. [2020-11-30 02:32:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-11-30 02:32:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 297 transitions. [2020-11-30 02:32:39,918 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 297 transitions. Word has length 33 [2020-11-30 02:32:39,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:32:39,919 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 297 transitions. [2020-11-30 02:32:39,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:32:39,919 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 297 transitions. [2020-11-30 02:32:39,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-30 02:32:39,920 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:32:39,920 INFO L422 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] [2020-11-30 02:32:39,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 02:32:39,921 INFO L429 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]=== [2020-11-30 02:32:39,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:32:39,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1592467192, now seen corresponding path program 1 times [2020-11-30 02:32:39,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:32:39,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006773130] [2020-11-30 02:32:39,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:32:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:32:40,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:32:40,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006773130] [2020-11-30 02:32:40,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:32:40,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:32:40,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46423307] [2020-11-30 02:32:40,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:32:40,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:32:40,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:32:40,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:32:40,033 INFO L87 Difference]: Start difference. First operand 210 states and 297 transitions. Second operand 3 states. [2020-11-30 02:32:40,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:32:40,120 INFO L93 Difference]: Finished difference Result 446 states and 626 transitions. [2020-11-30 02:32:40,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:32:40,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-11-30 02:32:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:32:40,124 INFO L225 Difference]: With dead ends: 446 [2020-11-30 02:32:40,124 INFO L226 Difference]: Without dead ends: 279 [2020-11-30 02:32:40,125 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:32:40,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-11-30 02:32:40,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 194. [2020-11-30 02:32:40,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-11-30 02:32:40,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 271 transitions. [2020-11-30 02:32:40,144 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 271 transitions. Word has length 33 [2020-11-30 02:32:40,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:32:40,145 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 271 transitions. [2020-11-30 02:32:40,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:32:40,146 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 271 transitions. [2020-11-30 02:32:40,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-30 02:32:40,149 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:32:40,150 INFO L422 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] [2020-11-30 02:32:40,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 02:32:40,152 INFO L429 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]=== [2020-11-30 02:32:40,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:32:40,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2014739947, now seen corresponding path program 1 times [2020-11-30 02:32:40,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:32:40,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964800455] [2020-11-30 02:32:40,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:32:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:32:40,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:32:40,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964800455] [2020-11-30 02:32:40,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:32:40,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 02:32:40,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637286448] [2020-11-30 02:32:40,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:32:40,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:32:40,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:32:40,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:32:40,356 INFO L87 Difference]: Start difference. First operand 194 states and 271 transitions. Second operand 6 states. [2020-11-30 02:32:40,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:32:40,935 INFO L93 Difference]: Finished difference Result 872 states and 1204 transitions. [2020-11-30 02:32:40,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 02:32:40,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-11-30 02:32:40,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:32:40,941 INFO L225 Difference]: With dead ends: 872 [2020-11-30 02:32:40,941 INFO L226 Difference]: Without dead ends: 716 [2020-11-30 02:32:40,942 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-11-30 02:32:40,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2020-11-30 02:32:40,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 251. [2020-11-30 02:32:40,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2020-11-30 02:32:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 348 transitions. [2020-11-30 02:32:40,974 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 348 transitions. Word has length 36 [2020-11-30 02:32:40,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:32:40,974 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 348 transitions. [2020-11-30 02:32:40,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:32:40,974 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 348 transitions. [2020-11-30 02:32:40,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-30 02:32:40,975 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:32:40,975 INFO L422 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] [2020-11-30 02:32:40,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 02:32:40,976 INFO L429 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]=== [2020-11-30 02:32:40,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:32:40,977 INFO L82 PathProgramCache]: Analyzing trace with hash 259294389, now seen corresponding path program 1 times [2020-11-30 02:32:40,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:32:40,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699762329] [2020-11-30 02:32:40,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:32:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:32:41,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:32:41,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699762329] [2020-11-30 02:32:41,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:32:41,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 02:32:41,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488366725] [2020-11-30 02:32:41,092 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:32:41,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:32:41,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:32:41,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:32:41,094 INFO L87 Difference]: Start difference. First operand 251 states and 348 transitions. Second operand 4 states. [2020-11-30 02:32:41,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:32:41,251 INFO L93 Difference]: Finished difference Result 404 states and 567 transitions. [2020-11-30 02:32:41,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:32:41,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2020-11-30 02:32:41,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:32:41,255 INFO L225 Difference]: With dead ends: 404 [2020-11-30 02:32:41,256 INFO L226 Difference]: Without dead ends: 402 [2020-11-30 02:32:41,256 INFO L677 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 [2020-11-30 02:32:41,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2020-11-30 02:32:41,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 253. [2020-11-30 02:32:41,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-11-30 02:32:41,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 350 transitions. [2020-11-30 02:32:41,286 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 350 transitions. Word has length 37 [2020-11-30 02:32:41,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:32:41,286 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 350 transitions. [2020-11-30 02:32:41,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:32:41,287 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 350 transitions. [2020-11-30 02:32:41,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-30 02:32:41,287 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:32:41,288 INFO L422 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] [2020-11-30 02:32:41,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-30 02:32:41,288 INFO L429 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]=== [2020-11-30 02:32:41,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:32:41,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1650379950, now seen corresponding path program 1 times [2020-11-30 02:32:41,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:32:41,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214162655] [2020-11-30 02:32:41,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:32:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:32:41,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:32:41,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214162655] [2020-11-30 02:32:41,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:32:41,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-30 02:32:41,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669595643] [2020-11-30 02:32:41,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 02:32:41,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:32:41,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 02:32:41,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-30 02:32:41,699 INFO L87 Difference]: Start difference. First operand 253 states and 350 transitions. Second operand 10 states. [2020-11-30 02:32:42,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:32:42,818 INFO L93 Difference]: Finished difference Result 988 states and 1361 transitions. [2020-11-30 02:32:42,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-30 02:32:42,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2020-11-30 02:32:42,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:32:42,825 INFO L225 Difference]: With dead ends: 988 [2020-11-30 02:32:42,825 INFO L226 Difference]: Without dead ends: 819 [2020-11-30 02:32:42,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2020-11-30 02:32:42,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2020-11-30 02:32:42,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 262. [2020-11-30 02:32:42,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2020-11-30 02:32:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 360 transitions. [2020-11-30 02:32:42,874 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 360 transitions. Word has length 37 [2020-11-30 02:32:42,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:32:42,875 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 360 transitions. [2020-11-30 02:32:42,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 02:32:42,875 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 360 transitions. [2020-11-30 02:32:42,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-30 02:32:42,877 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:32:42,877 INFO L422 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] [2020-11-30 02:32:42,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-30 02:32:42,878 INFO L429 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]=== [2020-11-30 02:32:42,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:32:42,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1296056517, now seen corresponding path program 1 times [2020-11-30 02:32:42,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:32:42,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347008470] [2020-11-30 02:32:42,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:32:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:32:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:32:43,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347008470] [2020-11-30 02:32:43,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:32:43,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 02:32:43,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019611859] [2020-11-30 02:32:43,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:32:43,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:32:43,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:32:43,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:32:43,099 INFO L87 Difference]: Start difference. First operand 262 states and 360 transitions. Second operand 5 states. [2020-11-30 02:32:43,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:32:43,194 INFO L93 Difference]: Finished difference Result 479 states and 669 transitions. [2020-11-30 02:32:43,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:32:43,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-11-30 02:32:43,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:32:43,198 INFO L225 Difference]: With dead ends: 479 [2020-11-30 02:32:43,199 INFO L226 Difference]: Without dead ends: 310 [2020-11-30 02:32:43,200 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:32:43,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2020-11-30 02:32:43,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 258. [2020-11-30 02:32:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2020-11-30 02:32:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 353 transitions. [2020-11-30 02:32:43,238 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 353 transitions. Word has length 38 [2020-11-30 02:32:43,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:32:43,238 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 353 transitions. [2020-11-30 02:32:43,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:32:43,238 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 353 transitions. [2020-11-30 02:32:43,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-30 02:32:43,239 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:32:43,239 INFO L422 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] [2020-11-30 02:32:43,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 02:32:43,240 INFO L429 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]=== [2020-11-30 02:32:43,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:32:43,241 INFO L82 PathProgramCache]: Analyzing trace with hash 139298612, now seen corresponding path program 1 times [2020-11-30 02:32:43,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:32:43,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19548454] [2020-11-30 02:32:43,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:32:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:32:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:32:43,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19548454] [2020-11-30 02:32:43,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:32:43,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 02:32:43,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107276560] [2020-11-30 02:32:43,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:32:43,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:32:43,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:32:43,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:32:43,303 INFO L87 Difference]: Start difference. First operand 258 states and 353 transitions. Second operand 4 states. [2020-11-30 02:32:43,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:32:43,535 INFO L93 Difference]: Finished difference Result 736 states and 994 transitions. [2020-11-30 02:32:43,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:32:43,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-11-30 02:32:43,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:32:43,540 INFO L225 Difference]: With dead ends: 736 [2020-11-30 02:32:43,540 INFO L226 Difference]: Without dead ends: 552 [2020-11-30 02:32:43,541 INFO L677 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 [2020-11-30 02:32:43,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-11-30 02:32:43,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 369. [2020-11-30 02:32:43,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-11-30 02:32:43,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 499 transitions. [2020-11-30 02:32:43,613 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 499 transitions. Word has length 38 [2020-11-30 02:32:43,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:32:43,614 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 499 transitions. [2020-11-30 02:32:43,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:32:43,614 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 499 transitions. [2020-11-30 02:32:43,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-30 02:32:43,615 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:32:43,616 INFO L422 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] [2020-11-30 02:32:43,616 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-30 02:32:43,617 INFO L429 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]=== [2020-11-30 02:32:43,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:32:43,618 INFO L82 PathProgramCache]: Analyzing trace with hash 544349305, now seen corresponding path program 1 times [2020-11-30 02:32:43,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:32:43,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661317212] [2020-11-30 02:32:43,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:32:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:32:43,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:32:43,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661317212] [2020-11-30 02:32:43,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:32:43,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:32:43,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825645935] [2020-11-30 02:32:43,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:32:43,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:32:43,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:32:43,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:32:43,676 INFO L87 Difference]: Start difference. First operand 369 states and 499 transitions. Second operand 4 states. [2020-11-30 02:32:43,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:32:43,822 INFO L93 Difference]: Finished difference Result 819 states and 1098 transitions. [2020-11-30 02:32:43,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:32:43,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-11-30 02:32:43,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:32:43,826 INFO L225 Difference]: With dead ends: 819 [2020-11-30 02:32:43,827 INFO L226 Difference]: Without dead ends: 482 [2020-11-30 02:32:43,828 INFO L677 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 [2020-11-30 02:32:43,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-11-30 02:32:43,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 323. [2020-11-30 02:32:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-11-30 02:32:43,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 432 transitions. [2020-11-30 02:32:43,884 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 432 transitions. Word has length 40 [2020-11-30 02:32:43,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:32:43,884 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 432 transitions. [2020-11-30 02:32:43,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:32:43,885 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 432 transitions. [2020-11-30 02:32:43,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-30 02:32:43,886 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:32:43,886 INFO L422 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] [2020-11-30 02:32:43,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-30 02:32:43,886 INFO L429 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]=== [2020-11-30 02:32:43,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:32:43,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1776974359, now seen corresponding path program 1 times [2020-11-30 02:32:43,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:32:43,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334617402] [2020-11-30 02:32:43,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:32:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:32:44,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:32:44,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334617402] [2020-11-30 02:32:44,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:32:44,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 02:32:44,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924292452] [2020-11-30 02:32:44,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:32:44,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:32:44,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:32:44,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:32:44,033 INFO L87 Difference]: Start difference. First operand 323 states and 432 transitions. Second operand 6 states. [2020-11-30 02:32:44,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:32:44,699 INFO L93 Difference]: Finished difference Result 1606 states and 2143 transitions. [2020-11-30 02:32:44,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 02:32:44,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2020-11-30 02:32:44,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:32:44,708 INFO L225 Difference]: With dead ends: 1606 [2020-11-30 02:32:44,708 INFO L226 Difference]: Without dead ends: 1351 [2020-11-30 02:32:44,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-11-30 02:32:44,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-11-30 02:32:44,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 403. [2020-11-30 02:32:44,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-11-30 02:32:44,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 532 transitions. [2020-11-30 02:32:44,780 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 532 transitions. Word has length 40 [2020-11-30 02:32:44,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:32:44,781 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 532 transitions. [2020-11-30 02:32:44,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:32:44,781 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 532 transitions. [2020-11-30 02:32:44,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-30 02:32:44,782 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:32:44,782 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:32:44,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-30 02:32:44,782 INFO L429 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]=== [2020-11-30 02:32:44,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:32:44,783 INFO L82 PathProgramCache]: Analyzing trace with hash -368513333, now seen corresponding path program 1 times [2020-11-30 02:32:44,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:32:44,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581966453] [2020-11-30 02:32:44,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:32:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 02:32:44,910 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 02:32:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 02:32:45,059 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 02:32:45,150 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-30 02:32:45,150 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 02:32:45,151 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-30 02:32:45,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 02:32:45 BoogieIcfgContainer [2020-11-30 02:32:45,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 02:32:45,341 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 02:32:45,342 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 02:32:45,342 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 02:32:45,343 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:32:36" (3/4) ... [2020-11-30 02:32:45,346 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 02:32:45,553 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_13349c7a-0eee-413f-acd8-42ed9575ef62/bin/utaipan/witness.graphml [2020-11-30 02:32:45,553 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 02:32:45,556 INFO L168 Benchmark]: Toolchain (without parser) took 13094.95 ms. Allocated memory was 94.4 MB in the beginning and 230.7 MB in the end (delta: 136.3 MB). Free memory was 64.7 MB in the beginning and 156.7 MB in the end (delta: -91.9 MB). Peak memory consumption was 45.4 MB. Max. memory is 16.1 GB. [2020-11-30 02:32:45,557 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 94.4 MB. Free memory is still 51.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 02:32:45,557 INFO L168 Benchmark]: CACSL2BoogieTranslator took 626.38 ms. Allocated memory is still 94.4 MB. Free memory was 64.5 MB in the beginning and 63.4 MB in the end (delta: 1.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 02:32:45,558 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.98 ms. Allocated memory is still 94.4 MB. Free memory was 63.4 MB in the beginning and 58.6 MB in the end (delta: 4.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-30 02:32:45,558 INFO L168 Benchmark]: Boogie Preprocessor took 137.56 ms. Allocated memory is still 94.4 MB. Free memory was 58.6 MB in the beginning and 55.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 02:32:45,559 INFO L168 Benchmark]: RCFGBuilder took 2896.48 ms. Allocated memory was 94.4 MB in the beginning and 146.8 MB in the end (delta: 52.4 MB). Free memory was 55.1 MB in the beginning and 67.1 MB in the end (delta: -12.0 MB). Peak memory consumption was 43.1 MB. Max. memory is 16.1 GB. [2020-11-30 02:32:45,560 INFO L168 Benchmark]: TraceAbstraction took 9086.07 ms. Allocated memory was 146.8 MB in the beginning and 230.7 MB in the end (delta: 83.9 MB). Free memory was 66.0 MB in the beginning and 173.4 MB in the end (delta: -107.4 MB). Peak memory consumption was 85.5 MB. Max. memory is 16.1 GB. [2020-11-30 02:32:45,560 INFO L168 Benchmark]: Witness Printer took 211.91 ms. Allocated memory is still 230.7 MB. Free memory was 173.4 MB in the beginning and 156.7 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-30 02:32:45,563 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 94.4 MB. Free memory is still 51.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 626.38 ms. Allocated memory is still 94.4 MB. Free memory was 64.5 MB in the beginning and 63.4 MB in the end (delta: 1.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 122.98 ms. Allocated memory is still 94.4 MB. Free memory was 63.4 MB in the beginning and 58.6 MB in the end (delta: 4.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 137.56 ms. Allocated memory is still 94.4 MB. Free memory was 58.6 MB in the beginning and 55.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2896.48 ms. Allocated memory was 94.4 MB in the beginning and 146.8 MB in the end (delta: 52.4 MB). Free memory was 55.1 MB in the beginning and 67.1 MB in the end (delta: -12.0 MB). Peak memory consumption was 43.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9086.07 ms. Allocated memory was 146.8 MB in the beginning and 230.7 MB in the end (delta: 83.9 MB). Free memory was 66.0 MB in the beginning and 173.4 MB in the end (delta: -107.4 MB). Peak memory consumption was 85.5 MB. Max. memory is 16.1 GB. * Witness Printer took 211.91 ms. Allocated memory is still 230.7 MB. Free memory was 173.4 MB in the beginning and 156.7 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [L197] COND FALSE !((int )side1Failed_History_0 != 0) [L200] COND FALSE !((int )side2Failed_History_0 != 0) [L203] COND FALSE !((int )active_side_History_0 != -2) [L206] COND FALSE !((int )manual_selection_History_0 != 0) [L209] COND FALSE !((int )side1Failed_History_1 != 0) [L212] COND FALSE !((int )side2Failed_History_1 != 0) [L215] COND FALSE !((int )active_side_History_1 != -2) [L218] COND FALSE !((int )manual_selection_History_1 != 0) [L221] COND FALSE !((int )side1Failed_History_2 != 0) [L224] COND FALSE !((int )side2Failed_History_2 != 0) [L227] COND FALSE !((int )active_side_History_2 != -2) [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); [L563] i2 = init() [L58] COND FALSE !(!cond) [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, 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] [L582] COND TRUE 1 [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L277] COND FALSE !(\read(side1Failed)) [L284] side1 = s1s1_old [L285] s1s1_old = nomsg [L286] side2 = s2s1_old [L287] s2s1_old = nomsg [L288] manual_selection = cs1_old [L289] cs1_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L290] COND TRUE (int )side1 == (int )side2 [L291] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L314] EXPR next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] EXPR next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] EXPR next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; [L148] COND TRUE (int )index == 0 [L149] 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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L400] COND FALSE !((int )side1 == 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L408] COND TRUE (int )side1 == (int )nomsg [L409] COND FALSE !((int )side2 == 0) [L412] active_side = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; [L447] COND TRUE ! side1Failed [L448] tmp = 1 [L58] COND FALSE !(!cond) [L178] 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND TRUE ! tmp___0 [L88] 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L458] tmp___1 = read_side1_failed_history((unsigned char)1) [L459] COND TRUE ! tmp___1 [L88] COND TRUE (int )index == 0 [L89] 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND TRUE ! tmp___2 [L118] 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L462] tmp___3 = read_side2_failed_history((unsigned char)1) [L463] COND TRUE ! tmp___3 [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L464] tmp___4 = read_side2_failed_history((unsigned char)0) [L465] COND TRUE ! tmp___4 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L466] COND FALSE !(! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L471] COND FALSE !(! (! ((int )side1_written == 0))) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L476] COND TRUE ! (! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L477] COND TRUE ! ((int )side2_written == 0) [L478] return (0); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L604] c1 = check() [L616] COND TRUE ! arg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L3] __assert_fail("0", "pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c", 3, "reach_error") VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 237 locations, 23 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.8s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5686 SDtfs, 7756 SDslu, 10425 SDs, 0 SdLazy, 899 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 3939 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 559 NumberOfCodeBlocks, 559 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 499 ConstructedInterpolants, 0 QuantifiedInterpolants, 58926 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...