./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 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_cd9e035a-d0b4-420f-81f2-8e021d0f4345/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_cd9e035a-d0b4-420f-81f2-8e021d0f4345/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cd9e035a-d0b4-420f-81f2-8e021d0f4345/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cd9e035a-d0b4-420f-81f2-8e021d0f4345/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_cd9e035a-d0b4-420f-81f2-8e021d0f4345/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cd9e035a-d0b4-420f-81f2-8e021d0f4345/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-7b2dab5 [2020-12-03 12:30:53,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-03 12:30:53,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-03 12:30:53,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-03 12:30:53,551 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-03 12:30:53,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-03 12:30:53,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-03 12:30:53,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-03 12:30:53,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-03 12:30:53,561 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-03 12:30:53,563 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-03 12:30:53,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-03 12:30:53,565 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-03 12:30:53,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-03 12:30:53,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-03 12:30:53,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-03 12:30:53,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-03 12:30:53,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-03 12:30:53,575 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-03 12:30:53,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-03 12:30:53,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-03 12:30:53,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-03 12:30:53,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-03 12:30:53,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-03 12:30:53,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-03 12:30:53,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-03 12:30:53,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-03 12:30:53,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-03 12:30:53,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-03 12:30:53,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-03 12:30:53,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-03 12:30:53,611 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-03 12:30:53,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-03 12:30:53,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-03 12:30:53,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-03 12:30:53,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-03 12:30:53,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-03 12:30:53,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-03 12:30:53,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-03 12:30:53,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-03 12:30:53,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-03 12:30:53,621 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cd9e035a-d0b4-420f-81f2-8e021d0f4345/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-03 12:30:53,656 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-03 12:30:53,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-03 12:30:53,659 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-03 12:30:53,659 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-03 12:30:53,659 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-03 12:30:53,659 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-03 12:30:53,660 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-03 12:30:53,660 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-03 12:30:53,660 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-03 12:30:53,660 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-03 12:30:53,661 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-03 12:30:53,662 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-03 12:30:53,662 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-03 12:30:53,662 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-03 12:30:53,662 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-03 12:30:53,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-03 12:30:53,663 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-03 12:30:53,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-03 12:30:53,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-03 12:30:53,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-03 12:30:53,671 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-03 12:30:53,672 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-03 12:30:53,672 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-03 12:30:53,672 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-03 12:30:53,672 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-03 12:30:53,672 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-03 12:30:53,673 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-03 12:30:53,673 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-03 12:30:53,673 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-03 12:30:53,675 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-03 12:30:53,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-03 12:30:53,676 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-03 12:30:53,676 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-03 12:30:53,676 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-03 12:30:53,676 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-03 12:30:53,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-03 12:30:53,677 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-03 12:30:53,677 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-03 12:30:53,677 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-03 12:30:53,678 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_cd9e035a-d0b4-420f-81f2-8e021d0f4345/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_cd9e035a-d0b4-420f-81f2-8e021d0f4345/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-12-03 12:30:53,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-03 12:30:53,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-03 12:30:53,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-03 12:30:53,981 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-03 12:30:53,982 INFO L275 PluginConnector]: CDTParser initialized [2020-12-03 12:30:53,983 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cd9e035a-d0b4-420f-81f2-8e021d0f4345/bin/utaipan/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2020-12-03 12:30:54,060 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cd9e035a-d0b4-420f-81f2-8e021d0f4345/bin/utaipan/data/fad4e3afd/9b9ebce4e4e949b2b404fc71edf0faa1/FLAGea6d5d00c [2020-12-03 12:30:54,507 INFO L306 CDTParser]: Found 1 translation units. [2020-12-03 12:30:54,508 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cd9e035a-d0b4-420f-81f2-8e021d0f4345/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2020-12-03 12:30:54,531 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cd9e035a-d0b4-420f-81f2-8e021d0f4345/bin/utaipan/data/fad4e3afd/9b9ebce4e4e949b2b404fc71edf0faa1/FLAGea6d5d00c [2020-12-03 12:30:54,871 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cd9e035a-d0b4-420f-81f2-8e021d0f4345/bin/utaipan/data/fad4e3afd/9b9ebce4e4e949b2b404fc71edf0faa1 [2020-12-03 12:30:54,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-03 12:30:54,875 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-03 12:30:54,877 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-03 12:30:54,877 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-03 12:30:54,880 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-03 12:30:54,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:30:54" (1/1) ... [2020-12-03 12:30:54,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18acf1d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:54, skipping insertion in model container [2020-12-03 12:30:54,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:30:54" (1/1) ... [2020-12-03 12:30:54,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-03 12:30:54,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-03 12:30:55,203 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_cd9e035a-d0b4-420f-81f2-8e021d0f4345/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c[14682,14695] [2020-12-03 12:30:55,206 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 12:30:55,217 INFO L203 MainTranslator]: Completed pre-run [2020-12-03 12:30:55,286 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_cd9e035a-d0b4-420f-81f2-8e021d0f4345/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c[14682,14695] [2020-12-03 12:30:55,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 12:30:55,308 INFO L208 MainTranslator]: Completed translation [2020-12-03 12:30:55,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:55 WrapperNode [2020-12-03 12:30:55,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-03 12:30:55,310 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-03 12:30:55,310 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-03 12:30:55,310 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-03 12:30:55,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:55" (1/1) ... [2020-12-03 12:30:55,331 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:55" (1/1) ... [2020-12-03 12:30:55,390 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-03 12:30:55,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-03 12:30:55,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-03 12:30:55,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-03 12:30:55,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:55" (1/1) ... [2020-12-03 12:30:55,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:55" (1/1) ... [2020-12-03 12:30:55,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:55" (1/1) ... [2020-12-03 12:30:55,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:55" (1/1) ... [2020-12-03 12:30:55,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:55" (1/1) ... [2020-12-03 12:30:55,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:55" (1/1) ... [2020-12-03 12:30:55,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:55" (1/1) ... [2020-12-03 12:30:55,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-03 12:30:55,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-03 12:30:55,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-03 12:30:55,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-03 12:30:55,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd9e035a-d0b4-420f-81f2-8e021d0f4345/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-12-03 12:30:55,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-03 12:30:55,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-03 12:30:55,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-03 12:30:55,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-03 12:30:57,779 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-03 12:30:57,780 INFO L299 CfgBuilder]: Removed 123 assume(true) statements. [2020-12-03 12:30:57,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:30:57 BoogieIcfgContainer [2020-12-03 12:30:57,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-03 12:30:57,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-03 12:30:57,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-03 12:30:57,792 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-03 12:30:57,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 12:30:54" (1/3) ... [2020-12-03 12:30:57,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5563f66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 12:30:57, skipping insertion in model container [2020-12-03 12:30:57,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:30:55" (2/3) ... [2020-12-03 12:30:57,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5563f66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 12:30:57, skipping insertion in model container [2020-12-03 12:30:57,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:30:57" (3/3) ... [2020-12-03 12:30:57,796 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2020-12-03 12:30:57,813 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-03 12:30:57,818 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2020-12-03 12:30:57,830 INFO L253 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2020-12-03 12:30:57,873 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-03 12:30:57,873 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-03 12:30:57,873 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-03 12:30:57,873 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-03 12:30:57,873 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-03 12:30:57,874 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-03 12:30:57,874 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-03 12:30:57,874 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-03 12:30:57,898 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2020-12-03 12:30:57,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-03 12:30:57,907 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:30:57,907 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:30:57,908 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-12-03 12:30:57,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:30:57,914 INFO L82 PathProgramCache]: Analyzing trace with hash 247144618, now seen corresponding path program 1 times [2020-12-03 12:30:57,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:30:57,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951479681] [2020-12-03 12:30:57,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:30:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:30:58,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:30:58,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951479681] [2020-12-03 12:30:58,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:30:58,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-03 12:30:58,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482926834] [2020-12-03 12:30:58,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-03 12:30:58,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:30:58,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-03 12:30:58,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 12:30:58,370 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2020-12-03 12:30:58,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:30:58,510 INFO L93 Difference]: Finished difference Result 472 states and 737 transitions. [2020-12-03 12:30:58,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-03 12:30:58,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-03 12:30:58,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:30:58,525 INFO L225 Difference]: With dead ends: 472 [2020-12-03 12:30:58,525 INFO L226 Difference]: Without dead ends: 236 [2020-12-03 12:30:58,529 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-12-03 12:30:58,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-12-03 12:30:58,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 212. [2020-12-03 12:30:58,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-12-03 12:30:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 308 transitions. [2020-12-03 12:30:58,581 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 308 transitions. Word has length 11 [2020-12-03 12:30:58,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:30:58,581 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 308 transitions. [2020-12-03 12:30:58,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-03 12:30:58,581 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 308 transitions. [2020-12-03 12:30:58,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-03 12:30:58,583 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:30:58,583 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:30:58,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-03 12:30:58,583 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-12-03 12:30:58,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:30:58,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1670023242, now seen corresponding path program 1 times [2020-12-03 12:30:58,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:30:58,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600875668] [2020-12-03 12:30:58,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:30:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:30:58,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:30:58,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600875668] [2020-12-03 12:30:58,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:30:58,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 12:30:58,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103850933] [2020-12-03 12:30:58,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 12:30:58,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:30:58,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 12:30:58,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-03 12:30:58,778 INFO L87 Difference]: Start difference. First operand 212 states and 308 transitions. Second operand 6 states. [2020-12-03 12:30:58,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:30:58,909 INFO L93 Difference]: Finished difference Result 658 states and 961 transitions. [2020-12-03 12:30:58,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-03 12:30:58,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-03 12:30:58,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:30:58,918 INFO L225 Difference]: With dead ends: 658 [2020-12-03 12:30:58,918 INFO L226 Difference]: Without dead ends: 447 [2020-12-03 12:30:58,923 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-03 12:30:58,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2020-12-03 12:30:58,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 234. [2020-12-03 12:30:58,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-12-03 12:30:58,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 342 transitions. [2020-12-03 12:30:58,965 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 342 transitions. Word has length 15 [2020-12-03 12:30:58,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:30:58,966 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 342 transitions. [2020-12-03 12:30:58,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 12:30:58,966 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 342 transitions. [2020-12-03 12:30:58,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-03 12:30:58,968 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:30:58,968 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:30:58,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-03 12:30:58,969 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-12-03 12:30:58,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:30:58,969 INFO L82 PathProgramCache]: Analyzing trace with hash -772958612, now seen corresponding path program 1 times [2020-12-03 12:30:58,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:30:58,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090259437] [2020-12-03 12:30:58,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:30:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:30:59,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:30:59,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090259437] [2020-12-03 12:30:59,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:30:59,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 12:30:59,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576332058] [2020-12-03 12:30:59,092 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-03 12:30:59,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:30:59,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-03 12:30:59,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-03 12:30:59,095 INFO L87 Difference]: Start difference. First operand 234 states and 342 transitions. Second operand 5 states. [2020-12-03 12:30:59,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:30:59,237 INFO L93 Difference]: Finished difference Result 857 states and 1248 transitions. [2020-12-03 12:30:59,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-03 12:30:59,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-03 12:30:59,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:30:59,243 INFO L225 Difference]: With dead ends: 857 [2020-12-03 12:30:59,243 INFO L226 Difference]: Without dead ends: 646 [2020-12-03 12:30:59,244 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-12-03 12:30:59,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-12-03 12:30:59,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 235. [2020-12-03 12:30:59,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2020-12-03 12:30:59,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 343 transitions. [2020-12-03 12:30:59,273 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 343 transitions. Word has length 16 [2020-12-03 12:30:59,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:30:59,274 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 343 transitions. [2020-12-03 12:30:59,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-03 12:30:59,274 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 343 transitions. [2020-12-03 12:30:59,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-03 12:30:59,275 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:30:59,275 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:30:59,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-03 12:30:59,276 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-12-03 12:30:59,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:30:59,277 INFO L82 PathProgramCache]: Analyzing trace with hash -499517359, now seen corresponding path program 1 times [2020-12-03 12:30:59,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:30:59,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425352527] [2020-12-03 12:30:59,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:30:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:30:59,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:30:59,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425352527] [2020-12-03 12:30:59,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:30:59,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 12:30:59,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906745701] [2020-12-03 12:30:59,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 12:30:59,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:30:59,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 12:30:59,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-03 12:30:59,422 INFO L87 Difference]: Start difference. First operand 235 states and 343 transitions. Second operand 6 states. [2020-12-03 12:30:59,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:30:59,518 INFO L93 Difference]: Finished difference Result 661 states and 964 transitions. [2020-12-03 12:30:59,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-03 12:30:59,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-12-03 12:30:59,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:30:59,522 INFO L225 Difference]: With dead ends: 661 [2020-12-03 12:30:59,522 INFO L226 Difference]: Without dead ends: 450 [2020-12-03 12:30:59,524 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-03 12:30:59,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-12-03 12:30:59,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 236. [2020-12-03 12:30:59,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-12-03 12:30:59,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 344 transitions. [2020-12-03 12:30:59,535 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 344 transitions. Word has length 18 [2020-12-03 12:30:59,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:30:59,536 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 344 transitions. [2020-12-03 12:30:59,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 12:30:59,536 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 344 transitions. [2020-12-03 12:30:59,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-03 12:30:59,537 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:30:59,537 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 12:30:59,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-03 12:30:59,539 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-12-03 12:30:59,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:30:59,539 INFO L82 PathProgramCache]: Analyzing trace with hash -628555541, now seen corresponding path program 1 times [2020-12-03 12:30:59,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:30:59,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211718664] [2020-12-03 12:30:59,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:30:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:30:59,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:30:59,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211718664] [2020-12-03 12:30:59,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:30:59,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-03 12:30:59,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982347571] [2020-12-03 12:30:59,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-03 12:30:59,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:30:59,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-03 12:30:59,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 12:30:59,645 INFO L87 Difference]: Start difference. First operand 236 states and 344 transitions. Second operand 3 states. [2020-12-03 12:30:59,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:30:59,684 INFO L93 Difference]: Finished difference Result 474 states and 693 transitions. [2020-12-03 12:30:59,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-03 12:30:59,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-12-03 12:30:59,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:30:59,690 INFO L225 Difference]: With dead ends: 474 [2020-12-03 12:30:59,690 INFO L226 Difference]: Without dead ends: 263 [2020-12-03 12:30:59,690 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-12-03 12:30:59,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2020-12-03 12:30:59,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 231. [2020-12-03 12:30:59,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2020-12-03 12:30:59,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 336 transitions. [2020-12-03 12:30:59,710 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 336 transitions. Word has length 18 [2020-12-03 12:30:59,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:30:59,710 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 336 transitions. [2020-12-03 12:30:59,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-03 12:30:59,710 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 336 transitions. [2020-12-03 12:30:59,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-03 12:30:59,716 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:30:59,716 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-12-03 12:30:59,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-03 12:30:59,717 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-12-03 12:30:59,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:30:59,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1007598275, now seen corresponding path program 1 times [2020-12-03 12:30:59,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:30:59,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060301328] [2020-12-03 12:30:59,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:30:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:30:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:30:59,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060301328] [2020-12-03 12:30:59,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:30:59,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-03 12:30:59,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236106535] [2020-12-03 12:30:59,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-03 12:30:59,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:30:59,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-03 12:30:59,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 12:30:59,830 INFO L87 Difference]: Start difference. First operand 231 states and 336 transitions. Second operand 3 states. [2020-12-03 12:30:59,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:30:59,908 INFO L93 Difference]: Finished difference Result 473 states and 692 transitions. [2020-12-03 12:30:59,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-03 12:30:59,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-12-03 12:30:59,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:30:59,911 INFO L225 Difference]: With dead ends: 473 [2020-12-03 12:30:59,911 INFO L226 Difference]: Without dead ends: 267 [2020-12-03 12:30:59,912 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-12-03 12:30:59,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-12-03 12:30:59,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 211. [2020-12-03 12:30:59,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-12-03 12:30:59,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 304 transitions. [2020-12-03 12:30:59,932 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 304 transitions. Word has length 22 [2020-12-03 12:30:59,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:30:59,935 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 304 transitions. [2020-12-03 12:30:59,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-03 12:30:59,935 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 304 transitions. [2020-12-03 12:30:59,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-03 12:30:59,936 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:30:59,936 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-12-03 12:30:59,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-03 12:30:59,937 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-12-03 12:30:59,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:30:59,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1912479717, now seen corresponding path program 1 times [2020-12-03 12:30:59,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:30:59,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506156881] [2020-12-03 12:30:59,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:30:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:31:00,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:31:00,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506156881] [2020-12-03 12:31:00,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:31:00,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-03 12:31:00,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704320671] [2020-12-03 12:31:00,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-03 12:31:00,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:31:00,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-03 12:31:00,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 12:31:00,020 INFO L87 Difference]: Start difference. First operand 211 states and 304 transitions. Second operand 3 states. [2020-12-03 12:31:00,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:31:00,086 INFO L93 Difference]: Finished difference Result 441 states and 636 transitions. [2020-12-03 12:31:00,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-03 12:31:00,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-12-03 12:31:00,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:31:00,089 INFO L225 Difference]: With dead ends: 441 [2020-12-03 12:31:00,089 INFO L226 Difference]: Without dead ends: 255 [2020-12-03 12:31:00,091 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-12-03 12:31:00,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-12-03 12:31:00,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 199. [2020-12-03 12:31:00,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-12-03 12:31:00,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 286 transitions. [2020-12-03 12:31:00,101 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 286 transitions. Word has length 26 [2020-12-03 12:31:00,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:31:00,102 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 286 transitions. [2020-12-03 12:31:00,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-03 12:31:00,102 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 286 transitions. [2020-12-03 12:31:00,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-03 12:31:00,105 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:31:00,106 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-12-03 12:31:00,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-03 12:31:00,107 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-12-03 12:31:00,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:31:00,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1128320931, now seen corresponding path program 1 times [2020-12-03 12:31:00,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:31:00,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734494114] [2020-12-03 12:31:00,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:31:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:31:00,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:31:00,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734494114] [2020-12-03 12:31:00,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:31:00,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-03 12:31:00,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771238007] [2020-12-03 12:31:00,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-03 12:31:00,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:31:00,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-03 12:31:00,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 12:31:00,198 INFO L87 Difference]: Start difference. First operand 199 states and 286 transitions. Second operand 3 states. [2020-12-03 12:31:00,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:31:00,300 INFO L93 Difference]: Finished difference Result 437 states and 628 transitions. [2020-12-03 12:31:00,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-03 12:31:00,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-12-03 12:31:00,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:31:00,304 INFO L225 Difference]: With dead ends: 437 [2020-12-03 12:31:00,304 INFO L226 Difference]: Without dead ends: 263 [2020-12-03 12:31:00,305 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-12-03 12:31:00,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2020-12-03 12:31:00,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 179. [2020-12-03 12:31:00,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-12-03 12:31:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 254 transitions. [2020-12-03 12:31:00,315 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 254 transitions. Word has length 27 [2020-12-03 12:31:00,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:31:00,317 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 254 transitions. [2020-12-03 12:31:00,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-03 12:31:00,317 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 254 transitions. [2020-12-03 12:31:00,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-03 12:31:00,319 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:31:00,319 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-12-03 12:31:00,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-03 12:31:00,320 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-12-03 12:31:00,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:31:00,320 INFO L82 PathProgramCache]: Analyzing trace with hash -2108209809, now seen corresponding path program 1 times [2020-12-03 12:31:00,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:31:00,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909897577] [2020-12-03 12:31:00,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:31:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:31:00,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:31:00,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909897577] [2020-12-03 12:31:00,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:31:00,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 12:31:00,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376020600] [2020-12-03 12:31:00,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 12:31:00,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:31:00,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 12:31:00,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-03 12:31:00,475 INFO L87 Difference]: Start difference. First operand 179 states and 254 transitions. Second operand 4 states. [2020-12-03 12:31:00,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:31:00,529 INFO L93 Difference]: Finished difference Result 509 states and 714 transitions. [2020-12-03 12:31:00,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 12:31:00,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-12-03 12:31:00,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:31:00,532 INFO L225 Difference]: With dead ends: 509 [2020-12-03 12:31:00,532 INFO L226 Difference]: Without dead ends: 340 [2020-12-03 12:31:00,533 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-03 12:31:00,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-12-03 12:31:00,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 183. [2020-12-03 12:31:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-12-03 12:31:00,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 258 transitions. [2020-12-03 12:31:00,546 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 258 transitions. Word has length 32 [2020-12-03 12:31:00,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:31:00,547 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 258 transitions. [2020-12-03 12:31:00,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 12:31:00,551 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 258 transitions. [2020-12-03 12:31:00,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-03 12:31:00,553 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:31:00,553 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] [2020-12-03 12:31:00,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-03 12:31:00,554 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-12-03 12:31:00,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:31:00,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1461322552, now seen corresponding path program 1 times [2020-12-03 12:31:00,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:31:00,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164052267] [2020-12-03 12:31:00,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:31:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:31:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:31:00,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164052267] [2020-12-03 12:31:00,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:31:00,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 12:31:00,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685749383] [2020-12-03 12:31:00,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 12:31:00,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:31:00,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 12:31:00,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-03 12:31:00,744 INFO L87 Difference]: Start difference. First operand 183 states and 258 transitions. Second operand 6 states. [2020-12-03 12:31:00,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:31:00,960 INFO L93 Difference]: Finished difference Result 623 states and 867 transitions. [2020-12-03 12:31:00,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-03 12:31:00,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-12-03 12:31:00,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:31:00,964 INFO L225 Difference]: With dead ends: 623 [2020-12-03 12:31:00,965 INFO L226 Difference]: Without dead ends: 467 [2020-12-03 12:31:00,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-03 12:31:00,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2020-12-03 12:31:00,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 218. [2020-12-03 12:31:00,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-12-03 12:31:00,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 308 transitions. [2020-12-03 12:31:00,982 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 308 transitions. Word has length 34 [2020-12-03 12:31:00,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:31:00,982 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 308 transitions. [2020-12-03 12:31:00,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 12:31:00,982 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 308 transitions. [2020-12-03 12:31:00,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-03 12:31:00,983 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:31:00,983 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] [2020-12-03 12:31:00,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-03 12:31:00,983 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-12-03 12:31:00,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:31:00,984 INFO L82 PathProgramCache]: Analyzing trace with hash -385810613, now seen corresponding path program 1 times [2020-12-03 12:31:00,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:31:00,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160235672] [2020-12-03 12:31:00,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:31:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:31:01,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:31:01,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160235672] [2020-12-03 12:31:01,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:31:01,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-03 12:31:01,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879151556] [2020-12-03 12:31:01,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-03 12:31:01,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:31:01,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-03 12:31:01,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 12:31:01,074 INFO L87 Difference]: Start difference. First operand 218 states and 308 transitions. Second operand 3 states. [2020-12-03 12:31:01,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:31:01,136 INFO L93 Difference]: Finished difference Result 396 states and 561 transitions. [2020-12-03 12:31:01,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-03 12:31:01,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-12-03 12:31:01,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:31:01,139 INFO L225 Difference]: With dead ends: 396 [2020-12-03 12:31:01,139 INFO L226 Difference]: Without dead ends: 240 [2020-12-03 12:31:01,140 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-12-03 12:31:01,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2020-12-03 12:31:01,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 214. [2020-12-03 12:31:01,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-12-03 12:31:01,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 301 transitions. [2020-12-03 12:31:01,158 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 301 transitions. Word has length 35 [2020-12-03 12:31:01,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:31:01,160 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 301 transitions. [2020-12-03 12:31:01,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-03 12:31:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 301 transitions. [2020-12-03 12:31:01,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-03 12:31:01,162 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:31:01,162 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] [2020-12-03 12:31:01,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-03 12:31:01,164 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-12-03 12:31:01,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:31:01,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1265390831, now seen corresponding path program 1 times [2020-12-03 12:31:01,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:31:01,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091390072] [2020-12-03 12:31:01,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:31:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:31:01,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:31:01,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091390072] [2020-12-03 12:31:01,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:31:01,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-03 12:31:01,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75853788] [2020-12-03 12:31:01,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-03 12:31:01,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:31:01,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-03 12:31:01,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 12:31:01,232 INFO L87 Difference]: Start difference. First operand 214 states and 301 transitions. Second operand 3 states. [2020-12-03 12:31:01,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:31:01,288 INFO L93 Difference]: Finished difference Result 454 states and 634 transitions. [2020-12-03 12:31:01,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-03 12:31:01,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-12-03 12:31:01,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:31:01,290 INFO L225 Difference]: With dead ends: 454 [2020-12-03 12:31:01,291 INFO L226 Difference]: Without dead ends: 285 [2020-12-03 12:31:01,291 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-12-03 12:31:01,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-12-03 12:31:01,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 198. [2020-12-03 12:31:01,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-12-03 12:31:01,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 275 transitions. [2020-12-03 12:31:01,310 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 275 transitions. Word has length 35 [2020-12-03 12:31:01,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:31:01,310 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 275 transitions. [2020-12-03 12:31:01,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-03 12:31:01,310 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 275 transitions. [2020-12-03 12:31:01,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-03 12:31:01,311 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:31:01,311 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-12-03 12:31:01,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-03 12:31:01,312 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-12-03 12:31:01,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:31:01,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1168400106, now seen corresponding path program 1 times [2020-12-03 12:31:01,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:31:01,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712659891] [2020-12-03 12:31:01,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:31:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:31:01,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:31:01,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712659891] [2020-12-03 12:31:01,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:31:01,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 12:31:01,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60237206] [2020-12-03 12:31:01,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 12:31:01,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:31:01,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 12:31:01,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 12:31:01,398 INFO L87 Difference]: Start difference. First operand 198 states and 275 transitions. Second operand 4 states. [2020-12-03 12:31:01,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:31:01,497 INFO L93 Difference]: Finished difference Result 628 states and 862 transitions. [2020-12-03 12:31:01,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-03 12:31:01,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-12-03 12:31:01,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:31:01,501 INFO L225 Difference]: With dead ends: 628 [2020-12-03 12:31:01,501 INFO L226 Difference]: Without dead ends: 478 [2020-12-03 12:31:01,505 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-12-03 12:31:01,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2020-12-03 12:31:01,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 314. [2020-12-03 12:31:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2020-12-03 12:31:01,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 426 transitions. [2020-12-03 12:31:01,532 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 426 transitions. Word has length 38 [2020-12-03 12:31:01,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:31:01,532 INFO L481 AbstractCegarLoop]: Abstraction has 314 states and 426 transitions. [2020-12-03 12:31:01,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 12:31:01,533 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 426 transitions. [2020-12-03 12:31:01,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-03 12:31:01,533 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:31:01,534 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-12-03 12:31:01,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-03 12:31:01,534 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-12-03 12:31:01,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:31:01,535 INFO L82 PathProgramCache]: Analyzing trace with hash -362567121, now seen corresponding path program 1 times [2020-12-03 12:31:01,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:31:01,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489904677] [2020-12-03 12:31:01,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:31:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:31:01,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:31:01,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489904677] [2020-12-03 12:31:01,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:31:01,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-03 12:31:01,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590281103] [2020-12-03 12:31:01,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-03 12:31:01,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:31:01,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-03 12:31:01,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-03 12:31:01,697 INFO L87 Difference]: Start difference. First operand 314 states and 426 transitions. Second operand 7 states. [2020-12-03 12:31:02,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:31:02,174 INFO L93 Difference]: Finished difference Result 1168 states and 1594 transitions. [2020-12-03 12:31:02,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-03 12:31:02,175 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-12-03 12:31:02,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:31:02,180 INFO L225 Difference]: With dead ends: 1168 [2020-12-03 12:31:02,181 INFO L226 Difference]: Without dead ends: 931 [2020-12-03 12:31:02,182 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-03 12:31:02,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2020-12-03 12:31:02,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 367. [2020-12-03 12:31:02,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2020-12-03 12:31:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 497 transitions. [2020-12-03 12:31:02,229 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 497 transitions. Word has length 38 [2020-12-03 12:31:02,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:31:02,230 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 497 transitions. [2020-12-03 12:31:02,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-03 12:31:02,231 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 497 transitions. [2020-12-03 12:31:02,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-03 12:31:02,231 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:31:02,231 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] [2020-12-03 12:31:02,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-03 12:31:02,232 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-12-03 12:31:02,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:31:02,232 INFO L82 PathProgramCache]: Analyzing trace with hash 711799268, now seen corresponding path program 1 times [2020-12-03 12:31:02,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:31:02,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880302497] [2020-12-03 12:31:02,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:31:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:31:02,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:31:02,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880302497] [2020-12-03 12:31:02,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:31:02,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 12:31:02,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132071893] [2020-12-03 12:31:02,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 12:31:02,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:31:02,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 12:31:02,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 12:31:02,318 INFO L87 Difference]: Start difference. First operand 367 states and 497 transitions. Second operand 4 states. [2020-12-03 12:31:02,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:31:02,454 INFO L93 Difference]: Finished difference Result 592 states and 811 transitions. [2020-12-03 12:31:02,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-03 12:31:02,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-12-03 12:31:02,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:31:02,458 INFO L225 Difference]: With dead ends: 592 [2020-12-03 12:31:02,459 INFO L226 Difference]: Without dead ends: 590 [2020-12-03 12:31:02,461 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-12-03 12:31:02,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-12-03 12:31:02,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 369. [2020-12-03 12:31:02,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-12-03 12:31:02,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 499 transitions. [2020-12-03 12:31:02,500 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 499 transitions. Word has length 39 [2020-12-03 12:31:02,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:31:02,500 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 499 transitions. [2020-12-03 12:31:02,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 12:31:02,501 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 499 transitions. [2020-12-03 12:31:02,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-03 12:31:02,501 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:31:02,502 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] [2020-12-03 12:31:02,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-03 12:31:02,502 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-12-03 12:31:02,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:31:02,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1402505955, now seen corresponding path program 1 times [2020-12-03 12:31:02,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:31:02,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45310741] [2020-12-03 12:31:02,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:31:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:31:02,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:31:02,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45310741] [2020-12-03 12:31:02,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:31:02,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-03 12:31:02,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906083186] [2020-12-03 12:31:02,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-03 12:31:02,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:31:02,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-03 12:31:02,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-12-03 12:31:02,759 INFO L87 Difference]: Start difference. First operand 369 states and 499 transitions. Second operand 10 states. [2020-12-03 12:31:03,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:31:03,583 INFO L93 Difference]: Finished difference Result 1288 states and 1755 transitions. [2020-12-03 12:31:03,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-03 12:31:03,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2020-12-03 12:31:03,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:31:03,589 INFO L225 Difference]: With dead ends: 1288 [2020-12-03 12:31:03,590 INFO L226 Difference]: Without dead ends: 1047 [2020-12-03 12:31:03,591 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2020-12-03 12:31:03,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2020-12-03 12:31:03,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 373. [2020-12-03 12:31:03,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-12-03 12:31:03,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 504 transitions. [2020-12-03 12:31:03,636 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 504 transitions. Word has length 39 [2020-12-03 12:31:03,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:31:03,636 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 504 transitions. [2020-12-03 12:31:03,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-03 12:31:03,637 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 504 transitions. [2020-12-03 12:31:03,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-03 12:31:03,637 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:31:03,638 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-12-03 12:31:03,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-03 12:31:03,651 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-12-03 12:31:03,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:31:03,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1314136485, now seen corresponding path program 1 times [2020-12-03 12:31:03,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:31:03,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306116106] [2020-12-03 12:31:03,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:31:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:31:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:31:03,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306116106] [2020-12-03 12:31:03,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:31:03,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-03 12:31:03,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978914833] [2020-12-03 12:31:03,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 12:31:03,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:31:03,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 12:31:03,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 12:31:03,683 INFO L87 Difference]: Start difference. First operand 373 states and 504 transitions. Second operand 4 states. [2020-12-03 12:31:03,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:31:03,774 INFO L93 Difference]: Finished difference Result 831 states and 1116 transitions. [2020-12-03 12:31:03,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-03 12:31:03,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-12-03 12:31:03,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:31:03,778 INFO L225 Difference]: With dead ends: 831 [2020-12-03 12:31:03,778 INFO L226 Difference]: Without dead ends: 490 [2020-12-03 12:31:03,779 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-12-03 12:31:03,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2020-12-03 12:31:03,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 327. [2020-12-03 12:31:03,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2020-12-03 12:31:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 437 transitions. [2020-12-03 12:31:03,815 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 437 transitions. Word has length 40 [2020-12-03 12:31:03,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:31:03,815 INFO L481 AbstractCegarLoop]: Abstraction has 327 states and 437 transitions. [2020-12-03 12:31:03,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 12:31:03,815 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 437 transitions. [2020-12-03 12:31:03,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-03 12:31:03,816 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:31:03,816 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-12-03 12:31:03,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-03 12:31:03,816 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-12-03 12:31:03,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:31:03,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1441993078, now seen corresponding path program 1 times [2020-12-03 12:31:03,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:31:03,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461506795] [2020-12-03 12:31:03,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:31:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:31:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:31:03,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461506795] [2020-12-03 12:31:03,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:31:03,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-03 12:31:03,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708409601] [2020-12-03 12:31:03,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 12:31:03,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:31:03,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 12:31:03,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-03 12:31:03,944 INFO L87 Difference]: Start difference. First operand 327 states and 437 transitions. Second operand 6 states. [2020-12-03 12:31:04,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:31:04,106 INFO L93 Difference]: Finished difference Result 718 states and 998 transitions. [2020-12-03 12:31:04,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-03 12:31:04,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2020-12-03 12:31:04,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:31:04,110 INFO L225 Difference]: With dead ends: 718 [2020-12-03 12:31:04,110 INFO L226 Difference]: Without dead ends: 477 [2020-12-03 12:31:04,111 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-12-03 12:31:04,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2020-12-03 12:31:04,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 323. [2020-12-03 12:31:04,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-12-03 12:31:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 430 transitions. [2020-12-03 12:31:04,171 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 430 transitions. Word has length 40 [2020-12-03 12:31:04,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:31:04,171 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 430 transitions. [2020-12-03 12:31:04,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 12:31:04,172 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 430 transitions. [2020-12-03 12:31:04,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-03 12:31:04,172 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:31:04,172 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-12-03 12:31:04,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-03 12:31:04,173 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-12-03 12:31:04,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:31:04,173 INFO L82 PathProgramCache]: Analyzing trace with hash -19520053, now seen corresponding path program 1 times [2020-12-03 12:31:04,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:31:04,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690461809] [2020-12-03 12:31:04,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:31:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 12:31:04,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 12:31:04,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690461809] [2020-12-03 12:31:04,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 12:31:04,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-03 12:31:04,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637481148] [2020-12-03 12:31:04,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-03 12:31:04,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-03 12:31:04,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-03 12:31:04,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-03 12:31:04,279 INFO L87 Difference]: Start difference. First operand 323 states and 430 transitions. Second operand 7 states. [2020-12-03 12:31:04,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 12:31:04,760 INFO L93 Difference]: Finished difference Result 1529 states and 2038 transitions. [2020-12-03 12:31:04,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-03 12:31:04,761 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-12-03 12:31:04,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 12:31:04,768 INFO L225 Difference]: With dead ends: 1529 [2020-12-03 12:31:04,768 INFO L226 Difference]: Without dead ends: 1274 [2020-12-03 12:31:04,769 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-03 12:31:04,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2020-12-03 12:31:04,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 403. [2020-12-03 12:31:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-12-03 12:31:04,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 530 transitions. [2020-12-03 12:31:04,837 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 530 transitions. Word has length 40 [2020-12-03 12:31:04,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 12:31:04,837 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 530 transitions. [2020-12-03 12:31:04,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-03 12:31:04,838 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 530 transitions. [2020-12-03 12:31:04,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-03 12:31:04,838 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 12:31:04,838 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-12-03 12:31:04,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-03 12:31:04,839 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 12:31:04,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 12:31:04,839 INFO L82 PathProgramCache]: Analyzing trace with hash 795947373, now seen corresponding path program 1 times [2020-12-03 12:31:04,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-03 12:31:04,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952209050] [2020-12-03 12:31:04,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 12:31:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-03 12:31:04,886 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-03 12:31:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-03 12:31:04,962 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-03 12:31:05,013 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-03 12:31:05,014 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-03 12:31:05,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-03 12:31:05,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 12:31:05 BoogieIcfgContainer [2020-12-03 12:31:05,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-03 12:31:05,178 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-03 12:31:05,179 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-03 12:31:05,179 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-03 12:31:05,180 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:30:57" (3/4) ... [2020-12-03 12:31:05,182 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-03 12:31:05,332 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_cd9e035a-d0b4-420f-81f2-8e021d0f4345/bin/utaipan/witness.graphml [2020-12-03 12:31:05,333 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-03 12:31:05,335 INFO L168 Benchmark]: Toolchain (without parser) took 10458.39 ms. Allocated memory was 94.4 MB in the beginning and 226.5 MB in the end (delta: 132.1 MB). Free memory was 74.6 MB in the beginning and 91.0 MB in the end (delta: -16.5 MB). Peak memory consumption was 114.8 MB. Max. memory is 16.1 GB. [2020-12-03 12:31:05,335 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 77.6 MB. Free memory is still 53.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 12:31:05,336 INFO L168 Benchmark]: CACSL2BoogieTranslator took 432.32 ms. Allocated memory is still 94.4 MB. Free memory was 74.2 MB in the beginning and 59.0 MB in the end (delta: 15.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-03 12:31:05,336 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.27 ms. Allocated memory is still 94.4 MB. Free memory was 58.6 MB in the beginning and 54.1 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-03 12:31:05,337 INFO L168 Benchmark]: Boogie Preprocessor took 139.27 ms. Allocated memory is still 94.4 MB. Free memory was 54.1 MB in the beginning and 50.6 MB in the end (delta: 3.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-03 12:31:05,337 INFO L168 Benchmark]: RCFGBuilder took 2243.33 ms. Allocated memory was 94.4 MB in the beginning and 130.0 MB in the end (delta: 35.7 MB). Free memory was 50.6 MB in the beginning and 67.1 MB in the end (delta: -16.5 MB). Peak memory consumption was 42.2 MB. Max. memory is 16.1 GB. [2020-12-03 12:31:05,337 INFO L168 Benchmark]: TraceAbstraction took 7389.82 ms. Allocated memory was 130.0 MB in the beginning and 226.5 MB in the end (delta: 96.5 MB). Free memory was 66.1 MB in the beginning and 108.9 MB in the end (delta: -42.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 16.1 GB. [2020-12-03 12:31:05,338 INFO L168 Benchmark]: Witness Printer took 154.90 ms. Allocated memory is still 226.5 MB. Free memory was 108.9 MB in the beginning and 91.0 MB in the end (delta: 17.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-12-03 12:31:05,340 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.28 ms. Allocated memory is still 77.6 MB. Free memory is still 53.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 432.32 ms. Allocated memory is still 94.4 MB. Free memory was 74.2 MB in the beginning and 59.0 MB in the end (delta: 15.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 92.27 ms. Allocated memory is still 94.4 MB. Free memory was 58.6 MB in the beginning and 54.1 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 139.27 ms. Allocated memory is still 94.4 MB. Free memory was 54.1 MB in the beginning and 50.6 MB in the end (delta: 3.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2243.33 ms. Allocated memory was 94.4 MB in the beginning and 130.0 MB in the end (delta: 35.7 MB). Free memory was 50.6 MB in the beginning and 67.1 MB in the end (delta: -16.5 MB). Peak memory consumption was 42.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 7389.82 ms. Allocated memory was 130.0 MB in the beginning and 226.5 MB in the end (delta: 96.5 MB). Free memory was 66.1 MB in the beginning and 108.9 MB in the end (delta: -42.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 16.1 GB. * Witness Printer took 154.90 ms. Allocated memory is still 226.5 MB. Free memory was 108.9 MB in the beginning and 91.0 MB in the end (delta: 17.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: 618]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [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] [L618] 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: 7.1s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6226 SDtfs, 7745 SDslu, 13679 SDs, 0 SdLazy, 1092 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 41 SyntacticMatches, 11 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 4420 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 605 NumberOfCodeBlocks, 605 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 544 ConstructedInterpolants, 0 QuantifiedInterpolants, 70653 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...