./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3ce13bb5-a7bd-453d-94d6-da2e33505d43/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3ce13bb5-a7bd-453d-94d6-da2e33505d43/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3ce13bb5-a7bd-453d-94d6-da2e33505d43/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3ce13bb5-a7bd-453d-94d6-da2e33505d43/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3ce13bb5-a7bd-453d-94d6-da2e33505d43/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3ce13bb5-a7bd-453d-94d6-da2e33505d43/bin-2019/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 751def0588f132c393a8666a5acb62e8205c40a1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 03:31:05,015 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:31:05,016 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:31:05,025 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:31:05,025 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:31:05,026 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:31:05,027 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:31:05,028 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:31:05,029 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:31:05,030 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:31:05,030 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:31:05,031 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:31:05,031 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:31:05,032 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:31:05,033 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:31:05,033 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:31:05,034 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:31:05,035 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:31:05,037 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:31:05,038 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:31:05,039 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:31:05,040 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:31:05,041 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:31:05,041 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:31:05,042 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:31:05,042 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:31:05,043 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:31:05,044 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:31:05,045 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:31:05,045 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:31:05,046 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:31:05,046 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:31:05,046 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:31:05,046 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:31:05,047 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:31:05,048 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:31:05,048 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3ce13bb5-a7bd-453d-94d6-da2e33505d43/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 03:31:05,058 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:31:05,058 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:31:05,059 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 03:31:05,059 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 03:31:05,059 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 03:31:05,059 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 03:31:05,060 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 03:31:05,060 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 03:31:05,060 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 03:31:05,060 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 03:31:05,060 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 03:31:05,061 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:31:05,061 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:31:05,061 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:31:05,061 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:31:05,061 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:31:05,061 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 03:31:05,061 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 03:31:05,062 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 03:31:05,062 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:31:05,062 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:31:05,062 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 03:31:05,062 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:31:05,062 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:31:05,062 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 03:31:05,063 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 03:31:05,063 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 03:31:05,063 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:31:05,063 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 03:31:05,063 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 03:31:05,063 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 03:31:05,063 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 03:31:05,063 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 03:31:05,064 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 03:31:05,064 INFO L133 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/working_dir_3ce13bb5-a7bd-453d-94d6-da2e33505d43/bin-2019/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 -> 751def0588f132c393a8666a5acb62e8205c40a1 [2018-11-10 03:31:05,086 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:31:05,093 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:31:05,094 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:31:05,095 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:31:05,096 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:31:05,096 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3ce13bb5-a7bd-453d-94d6-da2e33505d43/bin-2019/utaipan/../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i [2018-11-10 03:31:05,139 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3ce13bb5-a7bd-453d-94d6-da2e33505d43/bin-2019/utaipan/data/7d04eb30e/5369d416fad54c29ae5ae3d58dad4294/FLAGd383269dd [2018-11-10 03:31:05,535 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:31:05,536 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3ce13bb5-a7bd-453d-94d6-da2e33505d43/sv-benchmarks/c/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i [2018-11-10 03:31:05,541 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3ce13bb5-a7bd-453d-94d6-da2e33505d43/bin-2019/utaipan/data/7d04eb30e/5369d416fad54c29ae5ae3d58dad4294/FLAGd383269dd [2018-11-10 03:31:05,552 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3ce13bb5-a7bd-453d-94d6-da2e33505d43/bin-2019/utaipan/data/7d04eb30e/5369d416fad54c29ae5ae3d58dad4294 [2018-11-10 03:31:05,554 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:31:05,555 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:31:05,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:31:05,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:31:05,558 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:31:05,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:31:05" (1/1) ... [2018-11-10 03:31:05,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d89bcad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:05, skipping insertion in model container [2018-11-10 03:31:05,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:31:05" (1/1) ... [2018-11-10 03:31:05,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:31:05,580 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:31:05,683 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:31:05,685 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:31:05,700 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:31:05,710 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:31:05,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:05 WrapperNode [2018-11-10 03:31:05,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:31:05,712 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:31:05,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:31:05,712 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:31:05,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:05" (1/1) ... [2018-11-10 03:31:05,721 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:05" (1/1) ... [2018-11-10 03:31:05,725 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:31:05,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:31:05,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:31:05,725 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:31:05,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:05" (1/1) ... [2018-11-10 03:31:05,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:05" (1/1) ... [2018-11-10 03:31:05,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:05" (1/1) ... [2018-11-10 03:31:05,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:05" (1/1) ... [2018-11-10 03:31:05,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:05" (1/1) ... [2018-11-10 03:31:05,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:05" (1/1) ... [2018-11-10 03:31:05,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:05" (1/1) ... [2018-11-10 03:31:05,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:31:05,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:31:05,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:31:05,740 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:31:05,741 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3ce13bb5-a7bd-453d-94d6-da2e33505d43/bin-2019/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 [2018-11-10 03:31:05,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 03:31:05,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 03:31:05,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:31:05,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:31:05,818 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 03:31:05,818 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 03:31:05,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 03:31:05,819 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 03:31:05,972 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:31:05,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:31:05 BoogieIcfgContainer [2018-11-10 03:31:05,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:31:05,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 03:31:05,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 03:31:05,975 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 03:31:05,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:31:05" (1/3) ... [2018-11-10 03:31:05,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f17cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:31:05, skipping insertion in model container [2018-11-10 03:31:05,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:05" (2/3) ... [2018-11-10 03:31:05,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f17cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:31:05, skipping insertion in model container [2018-11-10 03:31:05,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:31:05" (3/3) ... [2018-11-10 03:31:05,979 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop_true-unreach-call_false-termination.i [2018-11-10 03:31:05,986 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 03:31:05,991 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 03:31:06,001 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 03:31:06,028 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 03:31:06,029 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 03:31:06,029 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 03:31:06,029 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:31:06,029 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:31:06,029 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 03:31:06,029 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:31:06,029 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 03:31:06,042 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-10 03:31:06,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 03:31:06,046 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:31:06,046 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:31:06,048 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:31:06,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:06,052 INFO L82 PathProgramCache]: Analyzing trace with hash -372910930, now seen corresponding path program 1 times [2018-11-10 03:31:06,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:31:06,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:06,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:31:06,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:06,087 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:31:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:31:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:31:06,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:31:06,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:31:06,182 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:31:06,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 03:31:06,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:31:06,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:31:06,197 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 5 states. [2018-11-10 03:31:06,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:31:06,352 INFO L93 Difference]: Finished difference Result 90 states and 153 transitions. [2018-11-10 03:31:06,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:31:06,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-10 03:31:06,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:31:06,362 INFO L225 Difference]: With dead ends: 90 [2018-11-10 03:31:06,362 INFO L226 Difference]: Without dead ends: 47 [2018-11-10 03:31:06,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:31:06,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-10 03:31:06,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-11-10 03:31:06,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 03:31:06,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2018-11-10 03:31:06,401 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 15 [2018-11-10 03:31:06,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:31:06,402 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2018-11-10 03:31:06,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 03:31:06,402 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2018-11-10 03:31:06,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 03:31:06,403 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:31:06,403 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:31:06,404 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:31:06,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:06,404 INFO L82 PathProgramCache]: Analyzing trace with hash -394866897, now seen corresponding path program 1 times [2018-11-10 03:31:06,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:31:06,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:06,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:31:06,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:06,406 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:31:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:31:06,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:31:06,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:31:06,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:31:06,453 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:31:06,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 03:31:06,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:31:06,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:31:06,455 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand 5 states. [2018-11-10 03:31:06,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:31:06,561 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2018-11-10 03:31:06,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:31:06,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-10 03:31:06,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:31:06,563 INFO L225 Difference]: With dead ends: 58 [2018-11-10 03:31:06,563 INFO L226 Difference]: Without dead ends: 56 [2018-11-10 03:31:06,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:31:06,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-10 03:31:06,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-11-10 03:31:06,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 03:31:06,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 68 transitions. [2018-11-10 03:31:06,580 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 68 transitions. Word has length 15 [2018-11-10 03:31:06,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:31:06,580 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 68 transitions. [2018-11-10 03:31:06,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 03:31:06,581 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2018-11-10 03:31:06,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 03:31:06,581 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:31:06,582 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:31:06,582 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:31:06,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:06,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1825950327, now seen corresponding path program 1 times [2018-11-10 03:31:06,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:31:06,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:06,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:31:06,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:06,584 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:31:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:31:06,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:31:06,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:31:06,675 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:31:06,676 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-11-10 03:31:06,677 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [26], [52], [68], [71], [73], [76], [78], [79], [80], [81], [107], [108], [109] [2018-11-10 03:31:06,713 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:31:06,713 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:31:06,831 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:31:06,832 INFO L272 AbstractInterpreter]: Visited 18 different actions 22 times. Never merged. Never widened. Never found a fixpoint. Largest state had 7 variables. [2018-11-10 03:31:06,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:06,840 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:31:06,912 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 53.64% of their original sizes. [2018-11-10 03:31:06,912 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:31:07,010 INFO L415 sIntCurrentIteration]: We unified 19 AI predicates to 19 [2018-11-10 03:31:07,010 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:31:07,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:31:07,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-11-10 03:31:07,011 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:31:07,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 03:31:07,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 03:31:07,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-10 03:31:07,012 INFO L87 Difference]: Start difference. First operand 52 states and 68 transitions. Second operand 10 states. [2018-11-10 03:31:07,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:31:07,659 INFO L93 Difference]: Finished difference Result 92 states and 122 transitions. [2018-11-10 03:31:07,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 03:31:07,659 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-10 03:31:07,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:31:07,661 INFO L225 Difference]: With dead ends: 92 [2018-11-10 03:31:07,661 INFO L226 Difference]: Without dead ends: 90 [2018-11-10 03:31:07,662 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-10 03:31:07,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-10 03:31:07,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2018-11-10 03:31:07,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-10 03:31:07,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 109 transitions. [2018-11-10 03:31:07,682 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 109 transitions. Word has length 20 [2018-11-10 03:31:07,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:31:07,682 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 109 transitions. [2018-11-10 03:31:07,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 03:31:07,683 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 109 transitions. [2018-11-10 03:31:07,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 03:31:07,683 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:31:07,684 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:31:07,684 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:31:07,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:07,685 INFO L82 PathProgramCache]: Analyzing trace with hash -443407858, now seen corresponding path program 1 times [2018-11-10 03:31:07,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:31:07,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:07,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:31:07,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:07,686 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:31:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:31:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 03:31:07,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:31:07,769 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:31:07,769 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-11-10 03:31:07,769 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [26], [52], [68], [71], [73], [76], [78], [79], [80], [81], [107], [108], [109], [110], [111] [2018-11-10 03:31:07,770 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:31:07,771 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:31:07,786 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:31:07,786 INFO L272 AbstractInterpreter]: Visited 20 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 7 variables. [2018-11-10 03:31:07,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:07,788 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:31:07,815 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 62.73% of their original sizes. [2018-11-10 03:31:07,815 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:31:07,901 INFO L415 sIntCurrentIteration]: We unified 24 AI predicates to 24 [2018-11-10 03:31:07,901 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:31:07,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:31:07,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2018-11-10 03:31:07,901 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:31:07,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 03:31:07,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 03:31:07,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-11-10 03:31:07,902 INFO L87 Difference]: Start difference. First operand 82 states and 109 transitions. Second operand 11 states. [2018-11-10 03:31:08,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:31:08,628 INFO L93 Difference]: Finished difference Result 96 states and 125 transitions. [2018-11-10 03:31:08,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 03:31:08,629 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-11-10 03:31:08,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:31:08,630 INFO L225 Difference]: With dead ends: 96 [2018-11-10 03:31:08,630 INFO L226 Difference]: Without dead ends: 94 [2018-11-10 03:31:08,630 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2018-11-10 03:31:08,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-10 03:31:08,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2018-11-10 03:31:08,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-10 03:31:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2018-11-10 03:31:08,646 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 112 transitions. Word has length 25 [2018-11-10 03:31:08,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:31:08,646 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 112 transitions. [2018-11-10 03:31:08,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 03:31:08,646 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 112 transitions. [2018-11-10 03:31:08,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 03:31:08,647 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:31:08,647 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:31:08,648 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:31:08,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:08,648 INFO L82 PathProgramCache]: Analyzing trace with hash 2114615578, now seen corresponding path program 1 times [2018-11-10 03:31:08,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:31:08,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:08,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:31:08,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:08,649 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:31:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:31:08,713 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 03:31:08,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:31:08,714 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:31:08,714 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-11-10 03:31:08,714 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [26], [52], [58], [68], [71], [73], [76], [78], [79], [80], [81], [107], [108], [109], [110], [111], [112], [113], [114] [2018-11-10 03:31:08,715 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:31:08,715 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:31:08,730 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:31:08,730 INFO L272 AbstractInterpreter]: Visited 24 different actions 38 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 9 variables. [2018-11-10 03:31:08,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:08,732 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:31:08,768 INFO L227 lantSequenceWeakener]: Weakened 23 states. On average, predicates are now at 68.7% of their original sizes. [2018-11-10 03:31:08,768 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:31:08,925 INFO L415 sIntCurrentIteration]: We unified 43 AI predicates to 43 [2018-11-10 03:31:08,925 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:31:08,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:31:08,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [8] total 20 [2018-11-10 03:31:08,925 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:31:08,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 03:31:08,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 03:31:08,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-10 03:31:08,926 INFO L87 Difference]: Start difference. First operand 86 states and 112 transitions. Second operand 14 states. [2018-11-10 03:31:09,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:31:09,414 INFO L93 Difference]: Finished difference Result 133 states and 177 transitions. [2018-11-10 03:31:09,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 03:31:09,414 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-10 03:31:09,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:31:09,416 INFO L225 Difference]: With dead ends: 133 [2018-11-10 03:31:09,416 INFO L226 Difference]: Without dead ends: 131 [2018-11-10 03:31:09,416 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-11-10 03:31:09,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-10 03:31:09,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-11-10 03:31:09,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-10 03:31:09,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 166 transitions. [2018-11-10 03:31:09,439 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 166 transitions. Word has length 44 [2018-11-10 03:31:09,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:31:09,439 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 166 transitions. [2018-11-10 03:31:09,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 03:31:09,439 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 166 transitions. [2018-11-10 03:31:09,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 03:31:09,440 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:31:09,441 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:31:09,441 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:31:09,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:09,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1255310588, now seen corresponding path program 1 times [2018-11-10 03:31:09,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:31:09,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:09,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:31:09,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:09,442 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:31:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:31:09,496 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-10 03:31:09,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:31:09,496 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:31:09,496 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-11-10 03:31:09,496 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [26], [29], [32], [37], [42], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84], [85], [86], [87], [88], [89], [90], [91], [92], [93], [94], [95] [2018-11-10 03:31:09,498 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:31:09,498 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:31:09,514 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:31:09,514 INFO L272 AbstractInterpreter]: Visited 31 different actions 55 times. Never merged. Never widened. Never found a fixpoint. Largest state had 10 variables. [2018-11-10 03:31:09,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:09,527 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:31:09,554 INFO L227 lantSequenceWeakener]: Weakened 30 states. On average, predicates are now at 61.56% of their original sizes. [2018-11-10 03:31:09,554 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:31:09,643 INFO L415 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-11-10 03:31:09,644 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:31:09,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:31:09,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 17 [2018-11-10 03:31:09,644 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:31:09,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 03:31:09,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 03:31:09,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-10 03:31:09,645 INFO L87 Difference]: Start difference. First operand 123 states and 166 transitions. Second operand 12 states. [2018-11-10 03:31:10,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:31:10,597 INFO L93 Difference]: Finished difference Result 171 states and 228 transitions. [2018-11-10 03:31:10,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 03:31:10,597 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-11-10 03:31:10,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:31:10,599 INFO L225 Difference]: With dead ends: 171 [2018-11-10 03:31:10,599 INFO L226 Difference]: Without dead ends: 169 [2018-11-10 03:31:10,600 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-11-10 03:31:10,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-10 03:31:10,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 157. [2018-11-10 03:31:10,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-10 03:31:10,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 208 transitions. [2018-11-10 03:31:10,625 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 208 transitions. Word has length 48 [2018-11-10 03:31:10,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:31:10,626 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 208 transitions. [2018-11-10 03:31:10,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 03:31:10,626 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 208 transitions. [2018-11-10 03:31:10,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 03:31:10,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:31:10,628 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:31:10,628 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:31:10,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:10,628 INFO L82 PathProgramCache]: Analyzing trace with hash -979286812, now seen corresponding path program 1 times [2018-11-10 03:31:10,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:31:10,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:10,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:31:10,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:10,629 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:31:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:31:10,710 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-10 03:31:10,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:31:10,711 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:31:10,711 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-11-10 03:31:10,711 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [26], [29], [32], [37], [42], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84], [85], [86], [87], [88], [89], [90], [91], [92], [93], [94], [95], [96], [97], [98], [99] [2018-11-10 03:31:10,712 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:31:10,712 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:31:10,726 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:31:10,726 INFO L272 AbstractInterpreter]: Visited 35 different actions 67 times. Never merged. Never widened. Never found a fixpoint. Largest state had 10 variables. [2018-11-10 03:31:10,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:10,727 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:31:10,756 INFO L227 lantSequenceWeakener]: Weakened 38 states. On average, predicates are now at 62.28% of their original sizes. [2018-11-10 03:31:10,756 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:31:10,883 INFO L415 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-11-10 03:31:10,884 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:31:10,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:31:10,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 20 [2018-11-10 03:31:10,884 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:31:10,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 03:31:10,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 03:31:10,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-11-10 03:31:10,885 INFO L87 Difference]: Start difference. First operand 157 states and 208 transitions. Second operand 13 states. [2018-11-10 03:31:12,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:31:12,874 INFO L93 Difference]: Finished difference Result 229 states and 308 transitions. [2018-11-10 03:31:12,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 03:31:12,874 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 58 [2018-11-10 03:31:12,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:31:12,876 INFO L225 Difference]: With dead ends: 229 [2018-11-10 03:31:12,876 INFO L226 Difference]: Without dead ends: 227 [2018-11-10 03:31:12,876 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-11-10 03:31:12,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-10 03:31:12,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 191. [2018-11-10 03:31:12,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-10 03:31:12,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 254 transitions. [2018-11-10 03:31:12,915 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 254 transitions. Word has length 58 [2018-11-10 03:31:12,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:31:12,915 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 254 transitions. [2018-11-10 03:31:12,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 03:31:12,915 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 254 transitions. [2018-11-10 03:31:12,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 03:31:12,917 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:31:12,918 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:31:12,918 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:31:12,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:12,918 INFO L82 PathProgramCache]: Analyzing trace with hash 377935603, now seen corresponding path program 1 times [2018-11-10 03:31:12,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:31:12,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:12,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:31:12,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:12,921 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:31:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:31:12,977 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-10 03:31:12,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:31:12,977 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:31:12,977 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-11-10 03:31:12,977 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [24], [26], [29], [32], [35], [52], [58], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84], [85], [86], [107], [108], [109], [110], [111], [112], [113], [114] [2018-11-10 03:31:12,978 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:31:12,979 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:31:13,253 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:31:13,253 INFO L272 AbstractInterpreter]: Visited 32 different actions 1158 times. Merged at 16 different actions 301 times. Widened at 3 different actions 25 times. Found 38 fixpoints after 6 different actions. Largest state had 10 variables. [2018-11-10 03:31:13,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:13,262 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:31:13,296 INFO L227 lantSequenceWeakener]: Weakened 29 states. On average, predicates are now at 75.52% of their original sizes. [2018-11-10 03:31:13,296 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:31:13,428 INFO L415 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2018-11-10 03:31:13,428 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:31:13,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:31:13,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 19 [2018-11-10 03:31:13,428 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:31:13,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 03:31:13,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 03:31:13,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-11-10 03:31:13,429 INFO L87 Difference]: Start difference. First operand 191 states and 254 transitions. Second operand 13 states. [2018-11-10 03:31:13,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:31:13,909 INFO L93 Difference]: Finished difference Result 252 states and 334 transitions. [2018-11-10 03:31:13,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 03:31:13,910 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2018-11-10 03:31:13,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:31:13,911 INFO L225 Difference]: With dead ends: 252 [2018-11-10 03:31:13,911 INFO L226 Difference]: Without dead ends: 250 [2018-11-10 03:31:13,911 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-10 03:31:13,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-10 03:31:13,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 239. [2018-11-10 03:31:13,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-11-10 03:31:13,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 314 transitions. [2018-11-10 03:31:13,946 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 314 transitions. Word has length 65 [2018-11-10 03:31:13,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:31:13,947 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 314 transitions. [2018-11-10 03:31:13,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 03:31:13,947 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 314 transitions. [2018-11-10 03:31:13,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 03:31:13,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:31:13,949 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:31:13,949 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:31:13,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:13,949 INFO L82 PathProgramCache]: Analyzing trace with hash -2026132663, now seen corresponding path program 1 times [2018-11-10 03:31:13,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:31:13,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:13,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:31:13,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:13,950 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:31:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:31:14,032 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 19 proven. 28 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-10 03:31:14,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:31:14,033 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:31:14,033 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 70 with the following transitions: [2018-11-10 03:31:14,033 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [26], [29], [32], [37], [42], [47], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84], [85], [86], [87], [88], [89], [90], [91], [92], [93], [94], [95], [96], [97], [98], [99], [100], [101], [102], [103] [2018-11-10 03:31:14,034 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:31:14,035 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:31:14,050 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:31:14,050 INFO L272 AbstractInterpreter]: Visited 40 different actions 80 times. Never merged. Never widened. Never found a fixpoint. Largest state had 12 variables. [2018-11-10 03:31:14,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:14,055 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:31:14,085 INFO L227 lantSequenceWeakener]: Weakened 47 states. On average, predicates are now at 63.55% of their original sizes. [2018-11-10 03:31:14,085 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:31:14,199 INFO L415 sIntCurrentIteration]: We unified 68 AI predicates to 68 [2018-11-10 03:31:14,199 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:31:14,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:31:14,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 21 [2018-11-10 03:31:14,200 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:31:14,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 03:31:14,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 03:31:14,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-11-10 03:31:14,201 INFO L87 Difference]: Start difference. First operand 239 states and 314 transitions. Second operand 13 states. [2018-11-10 03:31:16,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:31:16,050 INFO L93 Difference]: Finished difference Result 335 states and 461 transitions. [2018-11-10 03:31:16,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 03:31:16,050 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-11-10 03:31:16,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:31:16,051 INFO L225 Difference]: With dead ends: 335 [2018-11-10 03:31:16,051 INFO L226 Difference]: Without dead ends: 333 [2018-11-10 03:31:16,052 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-11-10 03:31:16,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-11-10 03:31:16,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 316. [2018-11-10 03:31:16,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-11-10 03:31:16,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 442 transitions. [2018-11-10 03:31:16,105 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 442 transitions. Word has length 69 [2018-11-10 03:31:16,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:31:16,106 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 442 transitions. [2018-11-10 03:31:16,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 03:31:16,106 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 442 transitions. [2018-11-10 03:31:16,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 03:31:16,107 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:31:16,108 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:31:16,108 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:31:16,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:16,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1267705639, now seen corresponding path program 1 times [2018-11-10 03:31:16,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:31:16,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:16,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:31:16,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:16,110 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:31:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:31:16,171 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 35 proven. 15 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-10 03:31:16,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:31:16,171 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:31:16,172 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 73 with the following transitions: [2018-11-10 03:31:16,172 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [26], [29], [32], [37], [42], [52], [58], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84], [85], [86], [87], [88], [89], [90], [91], [92], [93], [94], [95], [107], [108], [109], [110], [111], [112], [113], [114] [2018-11-10 03:31:16,173 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:31:16,173 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:31:16,185 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:31:16,186 INFO L272 AbstractInterpreter]: Visited 41 different actions 83 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 12 variables. [2018-11-10 03:31:16,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:16,187 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:31:16,222 INFO L227 lantSequenceWeakener]: Weakened 42 states. On average, predicates are now at 67.78% of their original sizes. [2018-11-10 03:31:16,222 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:31:16,415 INFO L415 sIntCurrentIteration]: We unified 71 AI predicates to 71 [2018-11-10 03:31:16,415 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:31:16,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:31:16,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [8] total 20 [2018-11-10 03:31:16,416 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:31:16,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 03:31:16,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 03:31:16,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-11-10 03:31:16,416 INFO L87 Difference]: Start difference. First operand 316 states and 442 transitions. Second operand 14 states. [2018-11-10 03:31:17,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:31:17,675 INFO L93 Difference]: Finished difference Result 393 states and 551 transitions. [2018-11-10 03:31:17,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 03:31:17,675 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-11-10 03:31:17,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:31:17,677 INFO L225 Difference]: With dead ends: 393 [2018-11-10 03:31:17,677 INFO L226 Difference]: Without dead ends: 391 [2018-11-10 03:31:17,678 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-11-10 03:31:17,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-11-10 03:31:17,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 370. [2018-11-10 03:31:17,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-11-10 03:31:17,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 515 transitions. [2018-11-10 03:31:17,772 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 515 transitions. Word has length 72 [2018-11-10 03:31:17,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:31:17,772 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 515 transitions. [2018-11-10 03:31:17,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 03:31:17,772 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 515 transitions. [2018-11-10 03:31:17,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 03:31:17,774 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:31:17,774 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:31:17,774 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:31:17,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:17,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1889944727, now seen corresponding path program 1 times [2018-11-10 03:31:17,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:31:17,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:17,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:31:17,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:17,776 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:31:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:31:17,826 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 26 proven. 34 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-11-10 03:31:17,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:31:17,827 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:31:17,827 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2018-11-10 03:31:17,827 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [26], [29], [32], [35], [37], [42], [58], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84], [85], [86], [87], [88], [89], [90], [91], [92], [93], [94], [95], [107], [108], [109], [110], [111], [112], [113], [114] [2018-11-10 03:31:17,828 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:31:17,828 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:31:17,957 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:31:17,957 INFO L272 AbstractInterpreter]: Visited 41 different actions 592 times. Merged at 18 different actions 126 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 12 variables. [2018-11-10 03:31:17,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:17,959 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:31:18,025 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 69.72% of their original sizes. [2018-11-10 03:31:18,025 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:31:18,353 INFO L415 sIntCurrentIteration]: We unified 83 AI predicates to 83 [2018-11-10 03:31:18,353 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:31:18,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:31:18,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [7] total 20 [2018-11-10 03:31:18,353 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:31:18,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 03:31:18,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 03:31:18,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-11-10 03:31:18,354 INFO L87 Difference]: Start difference. First operand 370 states and 515 transitions. Second operand 15 states. [2018-11-10 03:31:20,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:31:20,220 INFO L93 Difference]: Finished difference Result 474 states and 670 transitions. [2018-11-10 03:31:20,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 03:31:20,220 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 84 [2018-11-10 03:31:20,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:31:20,223 INFO L225 Difference]: With dead ends: 474 [2018-11-10 03:31:20,223 INFO L226 Difference]: Without dead ends: 472 [2018-11-10 03:31:20,224 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 94 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2018-11-10 03:31:20,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2018-11-10 03:31:20,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 458. [2018-11-10 03:31:20,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-11-10 03:31:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 650 transitions. [2018-11-10 03:31:20,340 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 650 transitions. Word has length 84 [2018-11-10 03:31:20,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:31:20,340 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 650 transitions. [2018-11-10 03:31:20,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 03:31:20,341 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 650 transitions. [2018-11-10 03:31:20,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 03:31:20,342 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:31:20,342 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:31:20,342 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:31:20,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:20,343 INFO L82 PathProgramCache]: Analyzing trace with hash 532621103, now seen corresponding path program 1 times [2018-11-10 03:31:20,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:31:20,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:20,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:31:20,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:20,344 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:31:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:31:20,410 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 39 proven. 25 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2018-11-10 03:31:20,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:31:20,410 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:31:20,411 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 87 with the following transitions: [2018-11-10 03:31:20,411 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [24], [26], [29], [32], [37], [42], [52], [58], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84], [85], [86], [87], [88], [89], [90], [91], [92], [93], [94], [95], [96], [97], [98], [99], [107], [108], [109], [110], [111], [112], [113], [114] [2018-11-10 03:31:20,412 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:31:20,412 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:31:20,431 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:31:20,431 INFO L272 AbstractInterpreter]: Visited 46 different actions 99 times. Merged at 4 different actions 4 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 12 variables. [2018-11-10 03:31:20,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:20,443 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:31:20,497 INFO L227 lantSequenceWeakener]: Weakened 54 states. On average, predicates are now at 63.83% of their original sizes. [2018-11-10 03:31:20,498 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:31:20,705 INFO L415 sIntCurrentIteration]: We unified 85 AI predicates to 85 [2018-11-10 03:31:20,705 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:31:20,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:31:20,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 21 [2018-11-10 03:31:20,706 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:31:20,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 03:31:20,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 03:31:20,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-11-10 03:31:20,706 INFO L87 Difference]: Start difference. First operand 458 states and 650 transitions. Second operand 15 states. [2018-11-10 03:31:22,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:31:22,080 INFO L93 Difference]: Finished difference Result 562 states and 786 transitions. [2018-11-10 03:31:22,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 03:31:22,080 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 86 [2018-11-10 03:31:22,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:31:22,081 INFO L225 Difference]: With dead ends: 562 [2018-11-10 03:31:22,081 INFO L226 Difference]: Without dead ends: 320 [2018-11-10 03:31:22,083 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 90 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-11-10 03:31:22,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-11-10 03:31:22,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 316. [2018-11-10 03:31:22,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-11-10 03:31:22,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 436 transitions. [2018-11-10 03:31:22,155 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 436 transitions. Word has length 86 [2018-11-10 03:31:22,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:31:22,155 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 436 transitions. [2018-11-10 03:31:22,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 03:31:22,155 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 436 transitions. [2018-11-10 03:31:22,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 03:31:22,157 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:31:22,157 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:31:22,157 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:31:22,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:22,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1428285441, now seen corresponding path program 1 times [2018-11-10 03:31:22,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:31:22,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:22,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:31:22,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:22,158 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:31:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:31:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 45 proven. 50 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-11-10 03:31:22,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:31:22,212 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:31:22,212 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 89 with the following transitions: [2018-11-10 03:31:22,212 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [26], [29], [32], [37], [42], [47], [50], [52], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84], [85], [86], [87], [88], [89], [90], [91], [92], [93], [94], [95], [96], [97], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109] [2018-11-10 03:31:22,214 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:31:22,214 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:31:22,350 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:31:22,350 INFO L272 AbstractInterpreter]: Visited 48 different actions 652 times. Merged at 22 different actions 132 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 13 variables. [2018-11-10 03:31:22,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:22,354 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:31:22,409 INFO L227 lantSequenceWeakener]: Weakened 47 states. On average, predicates are now at 76.17% of their original sizes. [2018-11-10 03:31:22,409 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:31:22,681 INFO L415 sIntCurrentIteration]: We unified 87 AI predicates to 87 [2018-11-10 03:31:22,681 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:31:22,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:31:22,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [8] total 23 [2018-11-10 03:31:22,681 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:31:22,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 03:31:22,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 03:31:22,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-11-10 03:31:22,682 INFO L87 Difference]: Start difference. First operand 316 states and 436 transitions. Second operand 17 states. [2018-11-10 03:31:26,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:31:26,500 INFO L93 Difference]: Finished difference Result 502 states and 705 transitions. [2018-11-10 03:31:26,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 03:31:26,501 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2018-11-10 03:31:26,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:31:26,502 INFO L225 Difference]: With dead ends: 502 [2018-11-10 03:31:26,503 INFO L226 Difference]: Without dead ends: 500 [2018-11-10 03:31:26,503 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 106 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=287, Invalid=903, Unknown=0, NotChecked=0, Total=1190 [2018-11-10 03:31:26,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-11-10 03:31:26,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 382. [2018-11-10 03:31:26,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-10 03:31:26,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 522 transitions. [2018-11-10 03:31:26,574 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 522 transitions. Word has length 88 [2018-11-10 03:31:26,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:31:26,575 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 522 transitions. [2018-11-10 03:31:26,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 03:31:26,575 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 522 transitions. [2018-11-10 03:31:26,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 03:31:26,576 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:31:26,576 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:31:26,576 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:31:26,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:26,576 INFO L82 PathProgramCache]: Analyzing trace with hash 932385919, now seen corresponding path program 1 times [2018-11-10 03:31:26,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:31:26,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:26,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:31:26,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:26,577 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:31:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:31:26,629 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 26 proven. 34 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2018-11-10 03:31:26,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:31:26,629 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:31:26,630 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 89 with the following transitions: [2018-11-10 03:31:26,630 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [24], [26], [29], [32], [35], [37], [42], [58], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84], [85], [86], [87], [88], [89], [90], [91], [92], [93], [94], [95], [107], [108], [109], [110], [111], [112], [113], [114] [2018-11-10 03:31:26,631 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:31:26,631 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:31:26,785 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:31:26,786 INFO L272 AbstractInterpreter]: Visited 42 different actions 1368 times. Merged at 21 different actions 334 times. Widened at 3 different actions 23 times. Found 19 fixpoints after 3 different actions. Largest state had 12 variables. [2018-11-10 03:31:26,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:26,790 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:31:26,830 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 69.72% of their original sizes. [2018-11-10 03:31:26,830 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:31:26,994 INFO L415 sIntCurrentIteration]: We unified 87 AI predicates to 87 [2018-11-10 03:31:26,995 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:31:26,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:31:26,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [7] total 20 [2018-11-10 03:31:26,995 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:31:26,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 03:31:26,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 03:31:26,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-11-10 03:31:26,996 INFO L87 Difference]: Start difference. First operand 382 states and 522 transitions. Second operand 15 states. [2018-11-10 03:31:28,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:31:28,437 INFO L93 Difference]: Finished difference Result 504 states and 705 transitions. [2018-11-10 03:31:28,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 03:31:28,437 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 88 [2018-11-10 03:31:28,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:31:28,439 INFO L225 Difference]: With dead ends: 504 [2018-11-10 03:31:28,439 INFO L226 Difference]: Without dead ends: 502 [2018-11-10 03:31:28,440 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2018-11-10 03:31:28,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2018-11-10 03:31:28,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 460. [2018-11-10 03:31:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-11-10 03:31:28,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 636 transitions. [2018-11-10 03:31:28,525 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 636 transitions. Word has length 88 [2018-11-10 03:31:28,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:31:28,525 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 636 transitions. [2018-11-10 03:31:28,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 03:31:28,525 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 636 transitions. [2018-11-10 03:31:28,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 03:31:28,527 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:31:28,527 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:31:28,527 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:31:28,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:28,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1245277849, now seen corresponding path program 1 times [2018-11-10 03:31:28,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:31:28,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:28,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:31:28,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:31:28,528 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:31:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:31:28,597 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 49 proven. 50 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-11-10 03:31:28,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:31:28,598 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:31:28,598 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 93 with the following transitions: [2018-11-10 03:31:28,598 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [24], [26], [29], [32], [37], [42], [47], [50], [52], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84], [85], [86], [87], [88], [89], [90], [91], [92], [93], [94], [95], [96], [97], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109] [2018-11-10 03:31:28,599 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:31:28,599 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:31:28,804 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 03:31:28,805 INFO L272 AbstractInterpreter]: Visited 49 different actions 1521 times. Merged at 25 different actions 354 times. Widened at 3 different actions 18 times. Found 18 fixpoints after 4 different actions. Largest state had 13 variables. [2018-11-10 03:31:28,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:31:28,816 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 03:31:28,869 INFO L227 lantSequenceWeakener]: Weakened 51 states. On average, predicates are now at 71.96% of their original sizes. [2018-11-10 03:31:28,869 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 03:31:29,174 INFO L415 sIntCurrentIteration]: We unified 91 AI predicates to 91 [2018-11-10 03:31:29,174 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 03:31:29,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:31:29,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [8] total 24 [2018-11-10 03:31:29,175 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:31:29,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 03:31:29,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 03:31:29,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-11-10 03:31:29,176 INFO L87 Difference]: Start difference. First operand 460 states and 636 transitions. Second operand 18 states. [2018-11-10 03:31:31,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:31:31,686 INFO L93 Difference]: Finished difference Result 905 states and 1335 transitions. [2018-11-10 03:31:31,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 03:31:31,686 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 92 [2018-11-10 03:31:31,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:31:31,687 INFO L225 Difference]: With dead ends: 905 [2018-11-10 03:31:31,687 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 03:31:31,689 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 105 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=279, Invalid=651, Unknown=0, NotChecked=0, Total=930 [2018-11-10 03:31:31,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 03:31:31,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 03:31:31,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 03:31:31,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 03:31:31,690 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2018-11-10 03:31:31,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:31:31,691 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:31:31,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 03:31:31,691 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 03:31:31,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 03:31:31,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 03:31:32,937 WARN L179 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 399 DAG size of output: 231 [2018-11-10 03:31:33,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:33,102 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 119 [2018-11-10 03:31:34,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:34,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:34,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:34,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:34,923 WARN L179 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 406 DAG size of output: 353 [2018-11-10 03:31:35,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:35,045 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 119 [2018-11-10 03:31:35,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:35,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:36,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:36,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:36,232 WARN L179 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 406 DAG size of output: 353 [2018-11-10 03:31:36,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:36,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:36,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:36,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:36,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:36,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:36,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:36,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:36,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:36,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:36,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:36,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:36,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:36,942 WARN L179 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 406 DAG size of output: 348 [2018-11-10 03:31:37,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:37,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:37,176 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 362 DAG size of output: 293 [2018-11-10 03:31:37,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:31:37,458 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 377 DAG size of output: 222 [2018-11-10 03:31:37,745 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 37 [2018-11-10 03:31:38,816 WARN L179 SmtUtils]: Spent 953.00 ms on a formula simplification. DAG size of input: 351 DAG size of output: 37 [2018-11-10 03:31:39,870 WARN L179 SmtUtils]: Spent 926.00 ms on a formula simplification. DAG size of input: 351 DAG size of output: 37 [2018-11-10 03:31:40,303 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 27 [2018-11-10 03:31:41,180 WARN L179 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 343 DAG size of output: 40 [2018-11-10 03:31:41,429 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 27 [2018-11-10 03:31:41,770 WARN L179 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 292 DAG size of output: 30 [2018-11-10 03:31:42,057 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 37 [2018-11-10 03:31:42,119 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 03:31:42,119 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 03:31:42,119 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 03:31:42,119 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 03:31:42,119 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 03:31:42,119 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 03:31:42,119 INFO L421 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= (+ main_~i~0 2) main_~len~0) (<= 0 (* 2 main_~j~0)) (<= .cse0 main_~bufsize~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 0 (* 2 main_~i~0)) (<= main_~bufsize~0 .cse0))) [2018-11-10 03:31:42,119 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 53) no Hoare annotation was computed. [2018-11-10 03:31:42,119 INFO L421 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= (+ main_~i~0 2) main_~len~0) (<= 0 (* 2 main_~j~0)) (<= .cse0 main_~bufsize~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 0 (* 2 main_~i~0)) (<= main_~bufsize~0 .cse0))) [2018-11-10 03:31:42,119 INFO L421 ceAbstractionStarter]: At program point L23-1(line 23) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= (+ main_~i~0 2) main_~len~0) (<= 0 (* 2 main_~j~0)) (<= .cse0 main_~bufsize~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 0 (* 2 main_~i~0)) (<= main_~bufsize~0 .cse0))) [2018-11-10 03:31:42,120 INFO L421 ceAbstractionStarter]: At program point L44(line 44) the Hoare annotation is: (let ((.cse7 (+ main_~limit~0 4))) (let ((.cse0 (<= .cse7 main_~bufsize~0)) (.cse3 (<= 0 (* 2 main_~j~0))) (.cse4 (<= main_~bufsize~0 .cse7)) (.cse5 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse6 (<= (* 2 main_~limit~0) 4294967286))) (or (let ((.cse1 (+ main_~i~0 main_~len~0)) (.cse2 (+ main_~i~0 1))) (and .cse0 (<= 1 .cse1) (<= .cse1 4294967293) (<= main_~len~0 .cse2) (<= .cse2 main_~len~0) .cse3 .cse4 .cse5 .cse6)) (and .cse0 (<= (* 2 main_~len~0) 4294967294) (<= 0 (* 2 main_~i~0)) (<= (+ main_~i~0 2) main_~len~0) .cse3 .cse4 .cse5 .cse6)))) [2018-11-10 03:31:42,120 INFO L421 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= (+ main_~i~0 1) main_~len~0) (<= 2 (* 2 main_~i~0)) (<= (+ main_~j~0 4) main_~bufsize~0) (<= .cse0 main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 2 (* 2 main_~j~0)) (<= main_~bufsize~0 .cse0))) [2018-11-10 03:31:42,120 INFO L421 ceAbstractionStarter]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= (+ main_~i~0 1) main_~len~0) (<= 2 (* 2 main_~i~0)) (<= (+ main_~j~0 4) main_~bufsize~0) (<= .cse0 main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 2 (* 2 main_~j~0)) (<= main_~bufsize~0 .cse0))) [2018-11-10 03:31:42,120 INFO L421 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= (+ main_~i~0 2) main_~len~0) (<= 0 (* 2 main_~j~0)) (<= .cse0 main_~bufsize~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 0 (* 2 main_~i~0)) (<= main_~bufsize~0 .cse0))) [2018-11-10 03:31:42,120 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-10 03:31:42,120 INFO L425 ceAbstractionStarter]: For program point L20-1(lines 20 51) no Hoare annotation was computed. [2018-11-10 03:31:42,120 INFO L421 ceAbstractionStarter]: At program point L20-3(lines 20 51) the Hoare annotation is: (let ((.cse3 (* 2 main_~limit~0)) (.cse4 (+ main_~limit~0 4))) (let ((.cse0 (<= .cse4 main_~bufsize~0)) (.cse1 (<= main_~bufsize~0 .cse4)) (.cse2 (<= .cse3 4294967286))) (or (and .cse0 (<= (* 2 main_~len~0) 4294967294) (<= 0 (* 2 main_~i~0)) (<= main_~i~0 (+ main_~limit~0 2147483647)) (<= 0 (* 2 main_~j~0)) .cse1 (<= main_~i~0 main_~len~0) .cse2 (<= main_~j~0 main_~bufsize~0)) (and (and (and (<= (+ main_~i~0 main_~len~0) 2147483647) .cse0 (<= 0 (+ main_~i~0 main_~len~0 2147483648)) .cse1) (= main_~i~0 0)) .cse2 (<= 0 (+ .cse3 8)))))) [2018-11-10 03:31:42,120 INFO L425 ceAbstractionStarter]: For program point L20-4(lines 20 51) no Hoare annotation was computed. [2018-11-10 03:31:42,120 INFO L421 ceAbstractionStarter]: At program point L45(line 45) the Hoare annotation is: (let ((.cse7 (+ main_~limit~0 4))) (let ((.cse0 (<= .cse7 main_~bufsize~0)) (.cse3 (<= 0 (* 2 main_~j~0))) (.cse4 (<= main_~bufsize~0 .cse7)) (.cse5 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse6 (<= (* 2 main_~limit~0) 4294967286))) (or (let ((.cse1 (+ main_~i~0 main_~len~0)) (.cse2 (+ main_~i~0 1))) (and .cse0 (<= 1 .cse1) (<= .cse1 4294967293) (<= main_~len~0 .cse2) (<= .cse2 main_~len~0) .cse3 .cse4 .cse5 .cse6)) (and .cse0 (<= (* 2 main_~len~0) 4294967294) (<= 0 (* 2 main_~i~0)) (<= (+ main_~i~0 2) main_~len~0) .cse3 .cse4 .cse5 .cse6)))) [2018-11-10 03:31:42,120 INFO L421 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= (+ main_~i~0 1) main_~len~0) (<= 2 (* 2 main_~i~0)) (<= (+ main_~j~0 4) main_~bufsize~0) (<= .cse0 main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 2 (* 2 main_~j~0)) (<= main_~bufsize~0 .cse0))) [2018-11-10 03:31:42,120 INFO L425 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-11-10 03:31:42,120 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-10 03:31:42,120 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 21 50) no Hoare annotation was computed. [2018-11-10 03:31:42,120 INFO L421 ceAbstractionStarter]: At program point L21-3(lines 21 50) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= main_~i~0 main_~len~0) (<= 0 (* 2 main_~j~0)) (<= .cse0 main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 0 (* 2 main_~i~0)) (<= main_~j~0 main_~bufsize~0) (<= 1 (+ main_~i~0 main_~len~0)) (<= main_~i~0 (+ main_~limit~0 2147483647)) (<= main_~bufsize~0 .cse0))) [2018-11-10 03:31:42,121 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-10 03:31:42,121 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-10 03:31:42,121 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 53) no Hoare annotation was computed. [2018-11-10 03:31:42,121 INFO L421 ceAbstractionStarter]: At program point L42(lines 22 49) the Hoare annotation is: (let ((.cse7 (+ main_~limit~0 4))) (let ((.cse0 (<= .cse7 main_~bufsize~0)) (.cse3 (<= 0 (* 2 main_~j~0))) (.cse4 (<= main_~bufsize~0 .cse7)) (.cse5 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse6 (<= (* 2 main_~limit~0) 4294967286))) (or (let ((.cse1 (+ main_~i~0 main_~len~0)) (.cse2 (+ main_~i~0 1))) (and .cse0 (<= 1 .cse1) (<= .cse1 4294967293) (<= main_~len~0 .cse2) (<= .cse2 main_~len~0) .cse3 .cse4 .cse5 .cse6)) (and .cse0 (<= (* 2 main_~len~0) 4294967294) (<= 0 (* 2 main_~i~0)) (<= (+ main_~i~0 2) main_~len~0) .cse3 .cse4 .cse5 .cse6)))) [2018-11-10 03:31:42,121 INFO L421 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= 4 (* 2 main_~j~0)) (<= main_~i~0 main_~len~0) (<= .cse0 main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 4 (* 2 main_~i~0)) (<= main_~j~0 (+ main_~limit~0 1)) (<= main_~bufsize~0 .cse0))) [2018-11-10 03:31:42,121 INFO L421 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= 4 (* 2 main_~j~0)) (<= main_~i~0 main_~len~0) (<= .cse0 main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 4 (* 2 main_~i~0)) (<= main_~j~0 (+ main_~limit~0 1)) (<= main_~bufsize~0 .cse0))) [2018-11-10 03:31:42,121 INFO L421 ceAbstractionStarter]: At program point L34(line 34) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= (+ main_~i~0 1) main_~len~0) (<= 2 (* 2 main_~i~0)) (<= (+ main_~j~0 4) main_~bufsize~0) (<= .cse0 main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 2 (* 2 main_~j~0)) (<= main_~bufsize~0 .cse0))) [2018-11-10 03:31:42,121 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 53) the Hoare annotation is: true [2018-11-10 03:31:42,121 INFO L421 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= (+ main_~i~0 2) main_~len~0) (<= 0 (* 2 main_~j~0)) (<= .cse0 main_~bufsize~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 0 (* 2 main_~i~0)) (<= main_~bufsize~0 .cse0))) [2018-11-10 03:31:42,121 INFO L421 ceAbstractionStarter]: At program point L26-1(line 26) the Hoare annotation is: (let ((.cse0 (+ main_~limit~0 4))) (and (<= (* 2 main_~len~0) 4294967294) (<= (+ main_~i~0 2) main_~len~0) (<= 0 (* 2 main_~j~0)) (<= .cse0 main_~bufsize~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (* 2 main_~limit~0) 4294967286) (<= 0 (* 2 main_~i~0)) (<= main_~bufsize~0 .cse0))) [2018-11-10 03:31:42,121 INFO L425 ceAbstractionStarter]: For program point L22(lines 22 49) no Hoare annotation was computed. [2018-11-10 03:31:42,121 INFO L421 ceAbstractionStarter]: At program point L43(line 43) the Hoare annotation is: (let ((.cse7 (+ main_~limit~0 4))) (let ((.cse0 (<= .cse7 main_~bufsize~0)) (.cse3 (<= 0 (* 2 main_~j~0))) (.cse4 (<= main_~bufsize~0 .cse7)) (.cse5 (<= (+ main_~j~0 5) main_~bufsize~0)) (.cse6 (<= (* 2 main_~limit~0) 4294967286))) (or (let ((.cse1 (+ main_~i~0 main_~len~0)) (.cse2 (+ main_~i~0 1))) (and .cse0 (<= 1 .cse1) (<= .cse1 4294967293) (<= main_~len~0 .cse2) (<= .cse2 main_~len~0) .cse3 .cse4 .cse5 .cse6)) (and .cse0 (<= (* 2 main_~len~0) 4294967294) (<= 0 (* 2 main_~i~0)) (<= (+ main_~i~0 2) main_~len~0) .cse3 .cse4 .cse5 .cse6)))) [2018-11-10 03:31:42,121 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-10 03:31:42,121 INFO L425 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2018-11-10 03:31:42,121 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-10 03:31:42,122 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-10 03:31:42,122 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-10 03:31:42,122 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-10 03:31:42,122 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-10 03:31:42,122 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-10 03:31:42,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:31:42 BoogieIcfgContainer [2018-11-10 03:31:42,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 03:31:42,135 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:31:42,135 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:31:42,135 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:31:42,136 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:31:05" (3/4) ... [2018-11-10 03:31:42,138 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 03:31:42,143 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 03:31:42,143 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 03:31:42,143 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-10 03:31:42,146 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2018-11-10 03:31:42,146 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-10 03:31:42,146 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 03:31:42,178 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3ce13bb5-a7bd-453d-94d6-da2e33505d43/bin-2019/utaipan/witness.graphml [2018-11-10 03:31:42,178 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:31:42,179 INFO L168 Benchmark]: Toolchain (without parser) took 36624.88 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 944.8 MB). Free memory was 954.8 MB in the beginning and 870.3 MB in the end (delta: 84.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-11-10 03:31:42,179 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:31:42,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.13 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:31:42,180 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.32 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:31:42,180 INFO L168 Benchmark]: Boogie Preprocessor took 14.87 ms. Allocated memory is still 1.0 GB. Free memory was 944.1 MB in the beginning and 941.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:31:42,180 INFO L168 Benchmark]: RCFGBuilder took 232.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -204.2 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-11-10 03:31:42,180 INFO L168 Benchmark]: TraceAbstraction took 36161.32 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 782.2 MB). Free memory was 1.1 GB in the beginning and 870.3 MB in the end (delta: 275.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-10 03:31:42,181 INFO L168 Benchmark]: Witness Printer took 43.41 ms. Allocated memory is still 2.0 GB. Free memory is still 870.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:31:42,182 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 156.13 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.32 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.87 ms. Allocated memory is still 1.0 GB. Free memory was 944.1 MB in the beginning and 941.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 232.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -204.2 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36161.32 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 782.2 MB). Free memory was 1.1 GB in the beginning and 870.3 MB in the end (delta: 275.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 43.41 ms. Allocated memory is still 2.0 GB. Free memory is still 870.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((limit + 4 <= bufsize && 2 * len <= 4294967294) && 0 <= 2 * i) && i <= limit + 2147483647) && 0 <= 2 * j) && bufsize <= limit + 4) && i <= len) && 2 * limit <= 4294967286) && j <= bufsize) || ((((((i + len <= 2147483647 && limit + 4 <= bufsize) && 0 <= i + len + 2147483648) && bufsize <= limit + 4) && i == 0) && 2 * limit <= 4294967286) && 0 <= 2 * limit + 8) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((((((((2 * len <= 4294967294 && i <= len) && 0 <= 2 * j) && limit + 4 <= bufsize) && 2 * limit <= 4294967286) && 0 <= 2 * i) && j <= bufsize) && 1 <= i + len) && i <= limit + 2147483647) && bufsize <= limit + 4 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((((((limit + 4 <= bufsize && 1 <= i + len) && i + len <= 4294967293) && len <= i + 1) && i + 1 <= len) && 0 <= 2 * j) && bufsize <= limit + 4) && j + 5 <= bufsize) && 2 * limit <= 4294967286) || (((((((limit + 4 <= bufsize && 2 * len <= 4294967294) && 0 <= 2 * i) && i + 2 <= len) && 0 <= 2 * j) && bufsize <= limit + 4) && j + 5 <= bufsize) && 2 * limit <= 4294967286) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 44 locations, 1 error locations. SAFE Result, 36.1s OverallTime, 15 OverallIterations, 14 TraceHistogramMax, 19.7s AutomataDifference, 0.0s DeadEndRemovalTime, 10.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1034 SDtfs, 890 SDslu, 4407 SDs, 0 SdLazy, 2309 SolverSat, 1976 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 26 DeclaredPredicates, 929 GetRequests, 689 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=460occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.2s AbstIntTime, 13 AbstIntIterations, 13 AbstIntStrong, 0.9003762782818469 AbsIntWeakeningRatio, 0.4794188861985472 AbsIntAvgWeakeningVarsNumRemoved, 6.825665859564165 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 307 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 539 PreInvPairs, 923 NumberOfFragments, 974 HoareAnnotationTreeSize, 539 FomulaSimplifications, 4280871 FormulaSimplificationTreeSizeReduction, 5.7s HoareSimplificationTime, 23 FomulaSimplificationsInter, 276368 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 869 NumberOfCodeBlocks, 869 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 854 ConstructedInterpolants, 0 QuantifiedInterpolants, 114680 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 2 PerfectInterpolantSequences, 2067/2389 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...