./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_071194c5-4da3-4c1d-b905-5fb63919be01/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_071194c5-4da3-4c1d-b905-5fb63919be01/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_071194c5-4da3-4c1d-b905-5fb63919be01/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_071194c5-4da3-4c1d-b905-5fb63919be01/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_071194c5-4da3-4c1d-b905-5fb63919be01/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_071194c5-4da3-4c1d-b905-5fb63919be01/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5daa60820c0033439eb2fc136c4a16d466a909bc ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 20:36:52,607 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:36:52,608 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:36:52,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:36:52,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:36:52,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:36:52,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:36:52,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:36:52,620 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:36:52,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:36:52,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:36:52,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:36:52,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:36:52,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:36:52,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:36:52,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:36:52,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:36:52,626 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:36:52,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:36:52,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:36:52,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:36:52,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:36:52,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:36:52,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:36:52,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:36:52,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:36:52,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:36:52,635 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:36:52,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:36:52,636 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:36:52,636 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:36:52,637 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:36:52,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:36:52,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:36:52,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:36:52,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:36:52,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:36:52,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:36:52,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:36:52,640 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:36:52,640 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:36:52,641 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_071194c5-4da3-4c1d-b905-5fb63919be01/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:36:52,651 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:36:52,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:36:52,651 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:36:52,651 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:36:52,652 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:36:52,652 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:36:52,652 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:36:52,652 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:36:52,652 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:36:52,652 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:36:52,652 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:36:52,652 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:36:52,653 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:36:52,653 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:36:52,653 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:36:52,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:36:52,653 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:36:52,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:36:52,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:36:52,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:36:52,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:36:52,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:36:52,654 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:36:52,654 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:36:52,654 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:36:52,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:36:52,655 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:36:52,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:36:52,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:36:52,655 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:36:52,655 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:36:52,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:36:52,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:36:52,656 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:36:52,656 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:36:52,656 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:36:52,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:36:52,656 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:36:52,656 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:36:52,656 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:36:52,657 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_071194c5-4da3-4c1d-b905-5fb63919be01/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5daa60820c0033439eb2fc136c4a16d466a909bc [2019-12-07 20:36:52,761 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:36:52,771 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:36:52,774 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:36:52,775 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:36:52,776 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:36:52,776 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_071194c5-4da3-4c1d-b905-5fb63919be01/bin/utaipan/../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-12-07 20:36:52,817 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_071194c5-4da3-4c1d-b905-5fb63919be01/bin/utaipan/data/0e1111bf4/ed818cf53190483dba3de4f0189d599b/FLAGae58adb7f [2019-12-07 20:36:53,215 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:36:53,215 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_071194c5-4da3-4c1d-b905-5fb63919be01/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-12-07 20:36:53,220 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_071194c5-4da3-4c1d-b905-5fb63919be01/bin/utaipan/data/0e1111bf4/ed818cf53190483dba3de4f0189d599b/FLAGae58adb7f [2019-12-07 20:36:53,594 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_071194c5-4da3-4c1d-b905-5fb63919be01/bin/utaipan/data/0e1111bf4/ed818cf53190483dba3de4f0189d599b [2019-12-07 20:36:53,596 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:36:53,597 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:36:53,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:36:53,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:36:53,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:36:53,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:36:53" (1/1) ... [2019-12-07 20:36:53,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b0414ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:36:53, skipping insertion in model container [2019-12-07 20:36:53,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:36:53" (1/1) ... [2019-12-07 20:36:53,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:36:53,635 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:36:53,791 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:36:53,794 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:36:53,815 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:36:53,824 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:36:53,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:36:53 WrapperNode [2019-12-07 20:36:53,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:36:53,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:36:53,825 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:36:53,825 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:36:53,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:36:53" (1/1) ... [2019-12-07 20:36:53,835 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:36:53" (1/1) ... [2019-12-07 20:36:53,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:36:53,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:36:53,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:36:53,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:36:53,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:36:53" (1/1) ... [2019-12-07 20:36:53,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:36:53" (1/1) ... [2019-12-07 20:36:53,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:36:53" (1/1) ... [2019-12-07 20:36:53,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:36:53" (1/1) ... [2019-12-07 20:36:53,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:36:53" (1/1) ... [2019-12-07 20:36:53,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:36:53" (1/1) ... [2019-12-07 20:36:53,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:36:53" (1/1) ... [2019-12-07 20:36:53,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:36:53,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:36:53,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:36:53,869 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:36:53,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:36:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_071194c5-4da3-4c1d-b905-5fb63919be01/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:36:53,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:36:53,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:36:54,115 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:36:54,115 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 20:36:54,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:36:54 BoogieIcfgContainer [2019-12-07 20:36:54,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:36:54,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:36:54,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:36:54,119 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:36:54,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:36:53" (1/3) ... [2019-12-07 20:36:54,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43af4952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:36:54, skipping insertion in model container [2019-12-07 20:36:54,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:36:53" (2/3) ... [2019-12-07 20:36:54,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43af4952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:36:54, skipping insertion in model container [2019-12-07 20:36:54,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:36:54" (3/3) ... [2019-12-07 20:36:54,122 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2019-12-07 20:36:54,128 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:36:54,132 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-12-07 20:36:54,139 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-12-07 20:36:54,154 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:36:54,154 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:36:54,154 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:36:54,154 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:36:54,154 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:36:54,154 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:36:54,154 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:36:54,155 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:36:54,166 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2019-12-07 20:36:54,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 20:36:54,170 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:36:54,170 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:36:54,171 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:36:54,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:36:54,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1750713386, now seen corresponding path program 1 times [2019-12-07 20:36:54,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:36:54,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199859209] [2019-12-07 20:36:54,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:36:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:36:54,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:36:54,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199859209] [2019-12-07 20:36:54,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:36:54,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:36:54,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625511902] [2019-12-07 20:36:54,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:36:54,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:36:54,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:36:54,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:36:54,297 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 3 states. [2019-12-07 20:36:54,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:36:54,321 INFO L93 Difference]: Finished difference Result 79 states and 106 transitions. [2019-12-07 20:36:54,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:36:54,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-07 20:36:54,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:36:54,329 INFO L225 Difference]: With dead ends: 79 [2019-12-07 20:36:54,329 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 20:36:54,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:36:54,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 20:36:54,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2019-12-07 20:36:54,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 20:36:54,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-12-07 20:36:54,356 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 8 [2019-12-07 20:36:54,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:36:54,356 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-12-07 20:36:54,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:36:54,357 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-12-07 20:36:54,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 20:36:54,357 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:36:54,357 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:36:54,358 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:36:54,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:36:54,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1562463944, now seen corresponding path program 1 times [2019-12-07 20:36:54,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:36:54,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480905590] [2019-12-07 20:36:54,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:36:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:36:54,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:36:54,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480905590] [2019-12-07 20:36:54,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:36:54,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:36:54,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427844326] [2019-12-07 20:36:54,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:36:54,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:36:54,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:36:54,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:36:54,387 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 4 states. [2019-12-07 20:36:54,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:36:54,436 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2019-12-07 20:36:54,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:36:54,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 20:36:54,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:36:54,438 INFO L225 Difference]: With dead ends: 72 [2019-12-07 20:36:54,438 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 20:36:54,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:36:54,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 20:36:54,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-12-07 20:36:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 20:36:54,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-12-07 20:36:54,446 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 9 [2019-12-07 20:36:54,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:36:54,447 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-12-07 20:36:54,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:36:54,447 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-12-07 20:36:54,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 20:36:54,447 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:36:54,447 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:36:54,448 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:36:54,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:36:54,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1566110362, now seen corresponding path program 1 times [2019-12-07 20:36:54,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:36:54,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270490865] [2019-12-07 20:36:54,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:36:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:36:54,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:36:54,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270490865] [2019-12-07 20:36:54,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:36:54,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:36:54,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438615589] [2019-12-07 20:36:54,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:36:54,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:36:54,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:36:54,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:36:54,476 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 4 states. [2019-12-07 20:36:54,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:36:54,534 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2019-12-07 20:36:54,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:36:54,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 20:36:54,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:36:54,536 INFO L225 Difference]: With dead ends: 142 [2019-12-07 20:36:54,536 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 20:36:54,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:36:54,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 20:36:54,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 51. [2019-12-07 20:36:54,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-07 20:36:54,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-12-07 20:36:54,545 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 9 [2019-12-07 20:36:54,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:36:54,545 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-12-07 20:36:54,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:36:54,545 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-12-07 20:36:54,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 20:36:54,546 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:36:54,546 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:36:54,546 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:36:54,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:36:54,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1304785047, now seen corresponding path program 1 times [2019-12-07 20:36:54,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:36:54,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345546941] [2019-12-07 20:36:54,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:36:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:36:54,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:36:54,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345546941] [2019-12-07 20:36:54,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:36:54,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:36:54,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404488401] [2019-12-07 20:36:54,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:36:54,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:36:54,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:36:54,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:36:54,569 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 4 states. [2019-12-07 20:36:54,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:36:54,619 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2019-12-07 20:36:54,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:36:54,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 20:36:54,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:36:54,621 INFO L225 Difference]: With dead ends: 91 [2019-12-07 20:36:54,621 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 20:36:54,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:36:54,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 20:36:54,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 49. [2019-12-07 20:36:54,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 20:36:54,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-12-07 20:36:54,628 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 10 [2019-12-07 20:36:54,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:36:54,628 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-12-07 20:36:54,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:36:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-12-07 20:36:54,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:36:54,629 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:36:54,629 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:36:54,629 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:36:54,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:36:54,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1710544404, now seen corresponding path program 1 times [2019-12-07 20:36:54,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:36:54,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380601000] [2019-12-07 20:36:54,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:36:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:36:54,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:36:54,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380601000] [2019-12-07 20:36:54,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:36:54,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:36:54,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441317538] [2019-12-07 20:36:54,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:36:54,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:36:54,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:36:54,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:36:54,665 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 4 states. [2019-12-07 20:36:54,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:36:54,704 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2019-12-07 20:36:54,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:36:54,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 20:36:54,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:36:54,705 INFO L225 Difference]: With dead ends: 68 [2019-12-07 20:36:54,705 INFO L226 Difference]: Without dead ends: 66 [2019-12-07 20:36:54,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:36:54,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-07 20:36:54,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2019-12-07 20:36:54,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 20:36:54,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-12-07 20:36:54,710 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 11 [2019-12-07 20:36:54,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:36:54,711 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-12-07 20:36:54,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:36:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-12-07 20:36:54,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:36:54,711 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:36:54,712 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:36:54,712 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:36:54,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:36:54,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1793634881, now seen corresponding path program 1 times [2019-12-07 20:36:54,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:36:54,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184912450] [2019-12-07 20:36:54,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:36:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:36:54,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:36:54,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184912450] [2019-12-07 20:36:54,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:36:54,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:36:54,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800345199] [2019-12-07 20:36:54,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:36:54,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:36:54,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:36:54,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:36:54,743 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2019-12-07 20:36:54,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:36:54,798 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2019-12-07 20:36:54,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:36:54,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 20:36:54,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:36:54,799 INFO L225 Difference]: With dead ends: 86 [2019-12-07 20:36:54,800 INFO L226 Difference]: Without dead ends: 84 [2019-12-07 20:36:54,800 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:36:54,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-07 20:36:54,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 45. [2019-12-07 20:36:54,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 20:36:54,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-12-07 20:36:54,804 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 11 [2019-12-07 20:36:54,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:36:54,804 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-12-07 20:36:54,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:36:54,804 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-12-07 20:36:54,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 20:36:54,804 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:36:54,805 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:36:54,805 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:36:54,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:36:54,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1487264860, now seen corresponding path program 1 times [2019-12-07 20:36:54,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:36:54,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624987659] [2019-12-07 20:36:54,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:36:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:36:54,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:36:54,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624987659] [2019-12-07 20:36:54,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:36:54,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:36:54,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134370680] [2019-12-07 20:36:54,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:36:54,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:36:54,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:36:54,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:36:54,836 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2019-12-07 20:36:54,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:36:54,922 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2019-12-07 20:36:54,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:36:54,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-12-07 20:36:54,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:36:54,924 INFO L225 Difference]: With dead ends: 74 [2019-12-07 20:36:54,924 INFO L226 Difference]: Without dead ends: 72 [2019-12-07 20:36:54,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:36:54,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-07 20:36:54,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 43. [2019-12-07 20:36:54,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 20:36:54,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-12-07 20:36:54,929 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 12 [2019-12-07 20:36:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:36:54,930 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-12-07 20:36:54,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:36:54,930 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-12-07 20:36:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 20:36:54,930 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:36:54,930 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:36:54,931 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:36:54,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:36:54,931 INFO L82 PathProgramCache]: Analyzing trace with hash -231889442, now seen corresponding path program 1 times [2019-12-07 20:36:54,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:36:54,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432975569] [2019-12-07 20:36:54,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:36:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:36:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:36:54,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432975569] [2019-12-07 20:36:54,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:36:54,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:36:54,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354099682] [2019-12-07 20:36:54,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:36:54,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:36:54,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:36:54,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:36:54,957 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 4 states. [2019-12-07 20:36:54,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:36:54,999 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2019-12-07 20:36:54,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:36:54,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 20:36:55,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:36:55,000 INFO L225 Difference]: With dead ends: 82 [2019-12-07 20:36:55,000 INFO L226 Difference]: Without dead ends: 80 [2019-12-07 20:36:55,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:36:55,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-12-07 20:36:55,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 41. [2019-12-07 20:36:55,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 20:36:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-12-07 20:36:55,005 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 12 [2019-12-07 20:36:55,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:36:55,005 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-12-07 20:36:55,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:36:55,005 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-12-07 20:36:55,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 20:36:55,005 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:36:55,006 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:36:55,006 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:36:55,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:36:55,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1139433715, now seen corresponding path program 1 times [2019-12-07 20:36:55,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:36:55,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055959161] [2019-12-07 20:36:55,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:36:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:36:55,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:36:55,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055959161] [2019-12-07 20:36:55,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:36:55,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:36:55,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343914940] [2019-12-07 20:36:55,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:36:55,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:36:55,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:36:55,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:36:55,042 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2019-12-07 20:36:55,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:36:55,101 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2019-12-07 20:36:55,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:36:55,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 20:36:55,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:36:55,102 INFO L225 Difference]: With dead ends: 56 [2019-12-07 20:36:55,103 INFO L226 Difference]: Without dead ends: 54 [2019-12-07 20:36:55,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:36:55,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-12-07 20:36:55,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2019-12-07 20:36:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 20:36:55,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-12-07 20:36:55,106 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 13 [2019-12-07 20:36:55,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:36:55,107 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-12-07 20:36:55,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:36:55,107 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-12-07 20:36:55,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 20:36:55,107 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:36:55,107 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:36:55,107 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:36:55,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:36:55,108 INFO L82 PathProgramCache]: Analyzing trace with hash 962710923, now seen corresponding path program 1 times [2019-12-07 20:36:55,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:36:55,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479541491] [2019-12-07 20:36:55,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:36:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:36:55,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:36:55,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479541491] [2019-12-07 20:36:55,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:36:55,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:36:55,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084983989] [2019-12-07 20:36:55,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:36:55,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:36:55,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:36:55,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:36:55,145 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2019-12-07 20:36:55,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:36:55,177 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2019-12-07 20:36:55,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:36:55,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 20:36:55,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:36:55,178 INFO L225 Difference]: With dead ends: 56 [2019-12-07 20:36:55,178 INFO L226 Difference]: Without dead ends: 54 [2019-12-07 20:36:55,178 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:36:55,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-12-07 20:36:55,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 37. [2019-12-07 20:36:55,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 20:36:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-12-07 20:36:55,182 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 14 [2019-12-07 20:36:55,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:36:55,182 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-12-07 20:36:55,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:36:55,182 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-12-07 20:36:55,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 20:36:55,183 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:36:55,183 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:36:55,183 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:36:55,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:36:55,184 INFO L82 PathProgramCache]: Analyzing trace with hash -220728326, now seen corresponding path program 1 times [2019-12-07 20:36:55,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:36:55,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473320452] [2019-12-07 20:36:55,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:36:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:36:55,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:36:55,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473320452] [2019-12-07 20:36:55,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:36:55,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:36:55,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50282203] [2019-12-07 20:36:55,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:36:55,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:36:55,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:36:55,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:36:55,218 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 4 states. [2019-12-07 20:36:55,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:36:55,260 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2019-12-07 20:36:55,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:36:55,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 20:36:55,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:36:55,261 INFO L225 Difference]: With dead ends: 64 [2019-12-07 20:36:55,261 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 20:36:55,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:36:55,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 20:36:55,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 35. [2019-12-07 20:36:55,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 20:36:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-12-07 20:36:55,265 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 15 [2019-12-07 20:36:55,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:36:55,265 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-12-07 20:36:55,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:36:55,265 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-12-07 20:36:55,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 20:36:55,265 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:36:55,266 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:36:55,266 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:36:55,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:36:55,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1747360626, now seen corresponding path program 1 times [2019-12-07 20:36:55,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:36:55,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152401527] [2019-12-07 20:36:55,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:36:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:36:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:36:55,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152401527] [2019-12-07 20:36:55,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:36:55,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:36:55,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246277694] [2019-12-07 20:36:55,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:36:55,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:36:55,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:36:55,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:36:55,294 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2019-12-07 20:36:55,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:36:55,353 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2019-12-07 20:36:55,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:36:55,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 20:36:55,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:36:55,354 INFO L225 Difference]: With dead ends: 69 [2019-12-07 20:36:55,354 INFO L226 Difference]: Without dead ends: 67 [2019-12-07 20:36:55,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:36:55,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-12-07 20:36:55,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 33. [2019-12-07 20:36:55,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 20:36:55,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-12-07 20:36:55,358 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 16 [2019-12-07 20:36:55,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:36:55,358 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-12-07 20:36:55,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:36:55,358 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-12-07 20:36:55,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 20:36:55,359 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:36:55,359 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:36:55,359 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:36:55,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:36:55,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1666391295, now seen corresponding path program 1 times [2019-12-07 20:36:55,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:36:55,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598840158] [2019-12-07 20:36:55,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:36:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:36:55,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:36:55,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598840158] [2019-12-07 20:36:55,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:36:55,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:36:55,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456585870] [2019-12-07 20:36:55,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:36:55,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:36:55,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:36:55,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:36:55,405 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2019-12-07 20:36:55,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:36:55,489 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2019-12-07 20:36:55,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:36:55,490 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-07 20:36:55,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:36:55,490 INFO L225 Difference]: With dead ends: 57 [2019-12-07 20:36:55,490 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 20:36:55,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:36:55,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 20:36:55,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 31. [2019-12-07 20:36:55,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 20:36:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-12-07 20:36:55,494 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 17 [2019-12-07 20:36:55,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:36:55,495 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-12-07 20:36:55,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:36:55,495 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-12-07 20:36:55,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 20:36:55,495 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:36:55,495 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:36:55,496 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:36:55,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:36:55,496 INFO L82 PathProgramCache]: Analyzing trace with hash -118518439, now seen corresponding path program 1 times [2019-12-07 20:36:55,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:36:55,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478814521] [2019-12-07 20:36:55,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:36:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:36:55,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:36:55,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478814521] [2019-12-07 20:36:55,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:36:55,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:36:55,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563900914] [2019-12-07 20:36:55,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:36:55,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:36:55,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:36:55,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:36:55,531 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 5 states. [2019-12-07 20:36:55,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:36:55,597 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2019-12-07 20:36:55,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:36:55,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-07 20:36:55,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:36:55,598 INFO L225 Difference]: With dead ends: 82 [2019-12-07 20:36:55,598 INFO L226 Difference]: Without dead ends: 80 [2019-12-07 20:36:55,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:36:55,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-12-07 20:36:55,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 29. [2019-12-07 20:36:55,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 20:36:55,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-12-07 20:36:55,603 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 18 [2019-12-07 20:36:55,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:36:55,603 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-12-07 20:36:55,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:36:55,603 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-12-07 20:36:55,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 20:36:55,604 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:36:55,604 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:36:55,604 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:36:55,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:36:55,604 INFO L82 PathProgramCache]: Analyzing trace with hash 620899848, now seen corresponding path program 1 times [2019-12-07 20:36:55,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:36:55,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649400810] [2019-12-07 20:36:55,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:36:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:36:55,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:36:55,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649400810] [2019-12-07 20:36:55,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:36:55,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 20:36:55,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389290883] [2019-12-07 20:36:55,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:36:55,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:36:55,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:36:55,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:36:55,647 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 6 states. [2019-12-07 20:36:55,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:36:55,721 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2019-12-07 20:36:55,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:36:55,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-07 20:36:55,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:36:55,722 INFO L225 Difference]: With dead ends: 55 [2019-12-07 20:36:55,722 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 20:36:55,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:36:55,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 20:36:55,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 27. [2019-12-07 20:36:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 20:36:55,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-12-07 20:36:55,725 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2019-12-07 20:36:55,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:36:55,725 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-12-07 20:36:55,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:36:55,725 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-12-07 20:36:55,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 20:36:55,726 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:36:55,726 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:36:55,726 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:36:55,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:36:55,727 INFO L82 PathProgramCache]: Analyzing trace with hash 2068030272, now seen corresponding path program 1 times [2019-12-07 20:36:55,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:36:55,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007362790] [2019-12-07 20:36:55,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:36:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:36:55,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:36:55,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007362790] [2019-12-07 20:36:55,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:36:55,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 20:36:55,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057526387] [2019-12-07 20:36:55,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:36:55,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:36:55,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:36:55,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:36:55,762 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 6 states. [2019-12-07 20:36:55,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:36:55,857 INFO L93 Difference]: Finished difference Result 120 states and 142 transitions. [2019-12-07 20:36:55,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:36:55,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-12-07 20:36:55,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:36:55,858 INFO L225 Difference]: With dead ends: 120 [2019-12-07 20:36:55,858 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 20:36:55,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:36:55,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 20:36:55,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 20:36:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 20:36:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 20:36:55,859 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-12-07 20:36:55,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:36:55,859 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 20:36:55,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:36:55,859 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 20:36:55,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 20:36:55,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 20:36:56,187 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 20 [2019-12-07 20:36:56,448 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 34 [2019-12-07 20:36:56,450 INFO L246 CegarLoopResult]: For program point L93(lines 93 120) no Hoare annotation was computed. [2019-12-07 20:36:56,450 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-12-07 20:36:56,450 INFO L246 CegarLoopResult]: For program point L250(lines 250 260) no Hoare annotation was computed. [2019-12-07 20:36:56,450 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-12-07 20:36:56,450 INFO L246 CegarLoopResult]: For program point L52(lines 52 281) no Hoare annotation was computed. [2019-12-07 20:36:56,450 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 212) no Hoare annotation was computed. [2019-12-07 20:36:56,450 INFO L246 CegarLoopResult]: For program point L69(lines 69 124) no Hoare annotation was computed. [2019-12-07 20:36:56,450 INFO L242 CegarLoopResult]: At program point L259(lines 26 301) the Hoare annotation is: (let ((.cse1 (let ((.cse3 (<= 1 ULTIMATE.start_main_~main__i~0))) (or (and (< ULTIMATE.start_main_~main__j~0 ULTIMATE.start_main_~main__bufsize~0) .cse3) (and .cse3 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~12)))))) (.cse0 (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0)) (.cse2 (<= 1 ULTIMATE.start_main_~main__j~0))) (or (and (<= 0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__i~0 1) ULTIMATE.start_main_~main__len~0) .cse0 (<= 0 ULTIMATE.start_main_~main__j~0)) (and .cse1 .cse0 .cse2 (<= (+ ULTIMATE.start_main_~main__j~0 4) ULTIMATE.start_main_~main__bufsize~0)) (and .cse1 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~14)) .cse0 .cse2))) [2019-12-07 20:36:56,450 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-12-07 20:36:56,450 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 95) no Hoare annotation was computed. [2019-12-07 20:36:56,451 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 20:36:56,451 INFO L246 CegarLoopResult]: For program point L61(lines 61 280) no Hoare annotation was computed. [2019-12-07 20:36:56,451 INFO L246 CegarLoopResult]: For program point L210(lines 210 266) no Hoare annotation was computed. [2019-12-07 20:36:56,451 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2019-12-07 20:36:56,451 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-12-07 20:36:56,451 INFO L246 CegarLoopResult]: For program point L95(line 95) no Hoare annotation was computed. [2019-12-07 20:36:56,451 INFO L246 CegarLoopResult]: For program point L252(line 252) no Hoare annotation was computed. [2019-12-07 20:36:56,451 INFO L246 CegarLoopResult]: For program point L186(lines 186 270) no Hoare annotation was computed. [2019-12-07 20:36:56,451 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 200) no Hoare annotation was computed. [2019-12-07 20:36:56,451 INFO L246 CegarLoopResult]: For program point L54(line 54) no Hoare annotation was computed. [2019-12-07 20:36:56,451 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2019-12-07 20:36:56,451 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 240) no Hoare annotation was computed. [2019-12-07 20:36:56,451 INFO L246 CegarLoopResult]: For program point L170(lines 170 272) no Hoare annotation was computed. [2019-12-07 20:36:56,451 INFO L246 CegarLoopResult]: For program point L71(line 71) no Hoare annotation was computed. [2019-12-07 20:36:56,451 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 136) no Hoare annotation was computed. [2019-12-07 20:36:56,451 INFO L246 CegarLoopResult]: For program point L212(line 212) no Hoare annotation was computed. [2019-12-07 20:36:56,451 INFO L246 CegarLoopResult]: For program point L146(lines 146 276) no Hoare annotation was computed. [2019-12-07 20:36:56,451 INFO L246 CegarLoopResult]: For program point L105(lines 105 118) no Hoare annotation was computed. [2019-12-07 20:36:56,451 INFO L246 CegarLoopResult]: For program point L31(lines 31 295) no Hoare annotation was computed. [2019-12-07 20:36:56,452 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2019-12-07 20:36:56,452 INFO L246 CegarLoopResult]: For program point L188(line 188) no Hoare annotation was computed. [2019-12-07 20:36:56,452 INFO L246 CegarLoopResult]: For program point L81(lines 81 122) no Hoare annotation was computed. [2019-12-07 20:36:56,452 INFO L246 CegarLoopResult]: For program point L15(lines 15 307) no Hoare annotation was computed. [2019-12-07 20:36:56,452 INFO L246 CegarLoopResult]: For program point L238(lines 238 262) no Hoare annotation was computed. [2019-12-07 20:36:56,452 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-12-07 20:36:56,452 INFO L246 CegarLoopResult]: For program point L40(lines 40 283) no Hoare annotation was computed. [2019-12-07 20:36:56,452 INFO L242 CegarLoopResult]: At program point L288(lines 33 289) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__j~0 5) ULTIMATE.start_main_~main__bufsize~0) (<= 0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0) (<= (+ ULTIMATE.start_main_~main__i~0 1) ULTIMATE.start_main_~main__len~0) (<= 0 ULTIMATE.start_main_~main__j~0)) [2019-12-07 20:36:56,452 INFO L246 CegarLoopResult]: For program point L222(lines 222 264) no Hoare annotation was computed. [2019-12-07 20:36:56,452 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 160) no Hoare annotation was computed. [2019-12-07 20:36:56,453 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2019-12-07 20:36:56,453 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-12-07 20:36:56,453 INFO L249 CegarLoopResult]: At program point L305(lines 8 308) the Hoare annotation is: true [2019-12-07 20:36:56,453 INFO L246 CegarLoopResult]: For program point L107(line 107) no Hoare annotation was computed. [2019-12-07 20:36:56,453 INFO L246 CegarLoopResult]: For program point L198(lines 198 268) no Hoare annotation was computed. [2019-12-07 20:36:56,453 INFO L246 CegarLoopResult]: For program point L33(lines 33 289) no Hoare annotation was computed. [2019-12-07 20:36:56,453 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 20:36:56,453 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 148) no Hoare annotation was computed. [2019-12-07 20:36:56,453 INFO L246 CegarLoopResult]: For program point L83(line 83) no Hoare annotation was computed. [2019-12-07 20:36:56,453 INFO L246 CegarLoopResult]: For program point L240(line 240) no Hoare annotation was computed. [2019-12-07 20:36:56,453 INFO L246 CegarLoopResult]: For program point L42(line 42) no Hoare annotation was computed. [2019-12-07 20:36:56,453 INFO L246 CegarLoopResult]: For program point L224(line 224) no Hoare annotation was computed. [2019-12-07 20:36:56,454 INFO L246 CegarLoopResult]: For program point L158(lines 158 274) no Hoare annotation was computed. [2019-12-07 20:36:56,454 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2019-12-07 20:36:56,454 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2019-12-07 20:36:56,454 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2019-12-07 20:36:56,454 INFO L242 CegarLoopResult]: At program point L299(lines 20 307) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0)) [2019-12-07 20:36:56,454 INFO L246 CegarLoopResult]: For program point L200(line 200) no Hoare annotation was computed. [2019-12-07 20:36:56,454 INFO L246 CegarLoopResult]: For program point L134(lines 134 278) no Hoare annotation was computed. [2019-12-07 20:36:56,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:36:56 BoogieIcfgContainer [2019-12-07 20:36:56,471 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:36:56,471 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:36:56,471 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:36:56,471 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:36:56,472 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:36:54" (3/4) ... [2019-12-07 20:36:56,475 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 20:36:56,486 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 20:36:56,487 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 20:36:56,548 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_071194c5-4da3-4c1d-b905-5fb63919be01/bin/utaipan/witness.graphml [2019-12-07 20:36:56,548 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:36:56,549 INFO L168 Benchmark]: Toolchain (without parser) took 2951.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:36:56,549 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:36:56,550 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -131.0 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-12-07 20:36:56,550 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-12-07 20:36:56,550 INFO L168 Benchmark]: Boogie Preprocessor took 14.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:36:56,551 INFO L168 Benchmark]: RCFGBuilder took 247.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-12-07 20:36:56,551 INFO L168 Benchmark]: TraceAbstraction took 2353.98 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -82.9 MB). Peak memory consumption was 229.5 MB. Max. memory is 11.5 GB. [2019-12-07 20:36:56,551 INFO L168 Benchmark]: Witness Printer took 76.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2019-12-07 20:36:56,553 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 226.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -131.0 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 247.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2353.98 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -82.9 MB). Peak memory consumption was 229.5 MB. Max. memory is 11.5 GB. * Witness Printer took 76.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 160]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 148]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 107]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 188]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 240]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 224]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 200]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((main__j + 5 <= main__bufsize && 0 <= main__i) && main__limit + 4 <= main__bufsize) && main__i + 1 <= main__len) && 0 <= main__j - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 <= main__i && main__limit + 4 <= main__bufsize - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((((0 <= main__i && main__i + 1 <= main__len) && main__limit + 4 <= main__bufsize) && 0 <= main__j) || (((((main__j < main__bufsize && 1 <= main__i) || (1 <= main__i && !(0 == __VERIFIER_assert__cond))) && main__limit + 4 <= main__bufsize) && 1 <= main__j) && main__j + 4 <= main__bufsize)) || (((((main__j < main__bufsize && 1 <= main__i) || (1 <= main__i && !(0 == __VERIFIER_assert__cond))) && !(0 == __VERIFIER_assert__cond)) && main__limit + 4 <= main__bufsize) && 1 <= main__j) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 58 locations, 16 error locations. Result: SAFE, OverallTime: 1.7s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 843 SDtfs, 1296 SDslu, 596 SDs, 0 SdLazy, 801 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 436 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 25 NumberOfFragments, 109 HoareAnnotationTreeSize, 4 FomulaSimplifications, 247400221 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 4 FomulaSimplificationsInter, 159330 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 8869 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...