./Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i --full-output --rcfgbuilder.size.of.a.code.block LoopFreeBlock --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0210da8c Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/TaipanReach.xml -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i -s /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UTaipan-linux --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 --rcfgbuilder.size.of.a.code.block LoopFreeBlock ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0210da8 [2018-10-22 10:15:05,068 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-22 10:15:05,070 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-22 10:15:05,083 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-22 10:15:05,084 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-22 10:15:05,085 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-22 10:15:05,086 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-22 10:15:05,088 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-22 10:15:05,089 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-22 10:15:05,090 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-22 10:15:05,091 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-22 10:15:05,091 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-22 10:15:05,092 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-22 10:15:05,093 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-22 10:15:05,094 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-22 10:15:05,095 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-22 10:15:05,096 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-22 10:15:05,098 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-22 10:15:05,100 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-22 10:15:05,102 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-22 10:15:05,103 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-22 10:15:05,104 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-22 10:15:05,111 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-22 10:15:05,111 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-22 10:15:05,111 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-22 10:15:05,115 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-22 10:15:05,116 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-22 10:15:05,117 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-22 10:15:05,120 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-22 10:15:05,121 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-22 10:15:05,122 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-22 10:15:05,122 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-22 10:15:05,122 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-22 10:15:05,123 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-22 10:15:05,125 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-22 10:15:05,125 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-22 10:15:05,126 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-22 10:15:05,159 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-22 10:15:05,160 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-22 10:15:05,160 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-22 10:15:05,161 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-22 10:15:05,163 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-22 10:15:05,163 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-22 10:15:05,163 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-22 10:15:05,163 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-22 10:15:05,163 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-22 10:15:05,164 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-22 10:15:05,164 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-22 10:15:05,165 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-22 10:15:05,165 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-22 10:15:05,166 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-22 10:15:05,166 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-22 10:15:05,168 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-22 10:15:05,168 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-22 10:15:05,168 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-22 10:15:05,168 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-22 10:15:05,169 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-22 10:15:05,169 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-22 10:15:05,169 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-22 10:15:05,169 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-22 10:15:05,169 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-22 10:15:05,169 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-22 10:15:05,170 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-22 10:15:05,172 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-22 10:15:05,172 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-22 10:15:05,173 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-22 10:15:05,173 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-22 10:15:05,173 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-22 10:15:05,173 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-22 10:15:05,173 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-22 10:15:05,174 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-22 10:15:05,174 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 -> /storage/repos/ultimate/releaseScripts/default/UTaipan-linux 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock [2018-10-22 10:15:05,228 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-22 10:15:05,240 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-22 10:15:05,244 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-22 10:15:05,245 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-22 10:15:05,246 INFO L276 PluginConnector]: CDTParser initialized [2018-10-22 10:15:05,247 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i [2018-10-22 10:15:05,303 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/47f8f06f0/83842e8cb65d4437b4c7cf7bf8d96203/FLAGf78274397 [2018-10-22 10:15:05,761 INFO L298 CDTParser]: Found 1 translation units. [2018-10-22 10:15:05,761 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i [2018-10-22 10:15:05,768 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/47f8f06f0/83842e8cb65d4437b4c7cf7bf8d96203/FLAGf78274397 [2018-10-22 10:15:05,784 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/47f8f06f0/83842e8cb65d4437b4c7cf7bf8d96203 [2018-10-22 10:15:05,788 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-22 10:15:05,790 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-22 10:15:05,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-22 10:15:05,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-22 10:15:05,796 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-22 10:15:05,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 10:15:05" (1/1) ... [2018-10-22 10:15:05,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b29adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:15:05, skipping insertion in model container [2018-10-22 10:15:05,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 10:15:05" (1/1) ... [2018-10-22 10:15:05,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-22 10:15:05,834 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-22 10:15:06,079 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 10:15:06,083 INFO L189 MainTranslator]: Completed pre-run [2018-10-22 10:15:06,108 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 10:15:06,126 INFO L193 MainTranslator]: Completed translation [2018-10-22 10:15:06,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:15:06 WrapperNode [2018-10-22 10:15:06,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-22 10:15:06,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-22 10:15:06,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-22 10:15:06,128 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-22 10:15:06,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:15:06" (1/1) ... [2018-10-22 10:15:06,144 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:15:06" (1/1) ... [2018-10-22 10:15:06,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-22 10:15:06,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-22 10:15:06,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-22 10:15:06,150 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-22 10:15:06,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:15:06" (1/1) ... [2018-10-22 10:15:06,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:15:06" (1/1) ... [2018-10-22 10:15:06,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:15:06" (1/1) ... [2018-10-22 10:15:06,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:15:06" (1/1) ... [2018-10-22 10:15:06,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:15:06" (1/1) ... [2018-10-22 10:15:06,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:15:06" (1/1) ... [2018-10-22 10:15:06,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:15:06" (1/1) ... [2018-10-22 10:15:06,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-22 10:15:06,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-22 10:15:06,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-22 10:15:06,178 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-22 10:15:06,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:15:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/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-10-22 10:15:06,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-22 10:15:06,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-22 10:15:06,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-22 10:15:06,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-22 10:15:06,296 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-22 10:15:06,296 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-22 10:15:06,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-22 10:15:06,296 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-22 10:15:06,780 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-22 10:15:06,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 10:15:06 BoogieIcfgContainer [2018-10-22 10:15:06,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-22 10:15:06,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-22 10:15:06,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-22 10:15:06,786 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-22 10:15:06,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 10:15:05" (1/3) ... [2018-10-22 10:15:06,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ccabad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 10:15:06, skipping insertion in model container [2018-10-22 10:15:06,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:15:06" (2/3) ... [2018-10-22 10:15:06,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ccabad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 10:15:06, skipping insertion in model container [2018-10-22 10:15:06,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 10:15:06" (3/3) ... [2018-10-22 10:15:06,791 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop_true-unreach-call_false-termination.i [2018-10-22 10:15:06,801 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-22 10:15:06,810 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-22 10:15:06,828 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-22 10:15:06,862 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-22 10:15:06,863 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-22 10:15:06,864 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-22 10:15:06,864 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-22 10:15:06,864 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-22 10:15:06,864 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-22 10:15:06,864 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-22 10:15:06,865 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-22 10:15:06,865 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-22 10:15:06,886 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-10-22 10:15:06,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-22 10:15:06,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:15:06,895 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 10:15:06,898 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:15:06,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:15:06,905 INFO L82 PathProgramCache]: Analyzing trace with hash -372910930, now seen corresponding path program 1 times [2018-10-22 10:15:06,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:15:06,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:06,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:15:06,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:06,958 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:15:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:15:07,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 10:15:07,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 10:15:07,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-22 10:15:07,108 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:15:07,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-22 10:15:07,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-22 10:15:07,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-22 10:15:07,131 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 5 states. [2018-10-22 10:15:07,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:15:07,730 INFO L93 Difference]: Finished difference Result 90 states and 153 transitions. [2018-10-22 10:15:07,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-22 10:15:07,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-22 10:15:07,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:15:07,742 INFO L225 Difference]: With dead ends: 90 [2018-10-22 10:15:07,742 INFO L226 Difference]: Without dead ends: 47 [2018-10-22 10:15:07,747 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-10-22 10:15:07,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-22 10:15:07,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-10-22 10:15:07,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-22 10:15:07,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2018-10-22 10:15:07,799 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 15 [2018-10-22 10:15:07,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:15:07,800 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2018-10-22 10:15:07,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-22 10:15:07,800 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2018-10-22 10:15:07,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-22 10:15:07,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:15:07,802 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 10:15:07,802 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:15:07,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:15:07,803 INFO L82 PathProgramCache]: Analyzing trace with hash -394866897, now seen corresponding path program 1 times [2018-10-22 10:15:07,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:15:07,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:07,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:15:07,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:07,805 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:15:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:15:08,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 10:15:08,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 10:15:08,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-22 10:15:08,007 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:15:08,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-22 10:15:08,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-22 10:15:08,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-22 10:15:08,011 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand 5 states. [2018-10-22 10:15:08,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:15:08,229 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2018-10-22 10:15:08,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-22 10:15:08,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-22 10:15:08,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:15:08,232 INFO L225 Difference]: With dead ends: 58 [2018-10-22 10:15:08,232 INFO L226 Difference]: Without dead ends: 56 [2018-10-22 10:15:08,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-22 10:15:08,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-22 10:15:08,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-10-22 10:15:08,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-22 10:15:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 68 transitions. [2018-10-22 10:15:08,253 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 68 transitions. Word has length 15 [2018-10-22 10:15:08,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:15:08,254 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 68 transitions. [2018-10-22 10:15:08,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-22 10:15:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2018-10-22 10:15:08,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-22 10:15:08,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:15:08,256 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-10-22 10:15:08,256 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:15:08,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:15:08,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1825950327, now seen corresponding path program 1 times [2018-10-22 10:15:08,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:15:08,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:08,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:15:08,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:08,259 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:15:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:15:08,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 10:15:08,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:15:08,491 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:15:08,492 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-10-22 10:15:08,495 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [26], [52], [68], [71], [73], [76], [78], [79], [80], [81], [107], [108], [109] [2018-10-22 10:15:08,543 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:15:08,544 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:15:08,718 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 10:15:08,720 INFO L272 AbstractInterpreter]: Visited 18 different actions 22 times. Never merged. Never widened. Never found a fixpoint. Largest state had 7 variables. [2018-10-22 10:15:08,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:15:08,735 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 10:15:08,883 INFO L232 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 53.64% of their original sizes. [2018-10-22 10:15:08,883 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 10:15:09,241 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 10:15:09,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 10:15:09,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-10-22 10:15:09,242 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:15:09,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-22 10:15:09,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-22 10:15:09,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-22 10:15:09,243 INFO L87 Difference]: Start difference. First operand 52 states and 68 transitions. Second operand 10 states. [2018-10-22 10:15:11,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:15:11,027 INFO L93 Difference]: Finished difference Result 92 states and 122 transitions. [2018-10-22 10:15:11,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-22 10:15:11,027 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-10-22 10:15:11,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:15:11,031 INFO L225 Difference]: With dead ends: 92 [2018-10-22 10:15:11,032 INFO L226 Difference]: Without dead ends: 90 [2018-10-22 10:15:11,033 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-10-22 10:15:11,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-22 10:15:11,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2018-10-22 10:15:11,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-22 10:15:11,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 109 transitions. [2018-10-22 10:15:11,072 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 109 transitions. Word has length 20 [2018-10-22 10:15:11,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:15:11,072 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 109 transitions. [2018-10-22 10:15:11,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-22 10:15:11,073 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 109 transitions. [2018-10-22 10:15:11,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-22 10:15:11,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:15:11,074 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-10-22 10:15:11,074 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:15:11,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:15:11,078 INFO L82 PathProgramCache]: Analyzing trace with hash -443407858, now seen corresponding path program 1 times [2018-10-22 10:15:11,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:15:11,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:11,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:15:11,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:11,079 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:15:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:15:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-22 10:15:11,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:15:11,355 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:15:11,355 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-10-22 10:15:11,355 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-10-22 10:15:11,357 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:15:11,358 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:15:11,379 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 10:15:11,379 INFO L272 AbstractInterpreter]: Visited 20 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 7 variables. [2018-10-22 10:15:11,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:15:11,394 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 10:15:11,439 INFO L232 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 62.73% of their original sizes. [2018-10-22 10:15:11,439 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 10:15:11,718 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 10:15:11,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 10:15:11,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2018-10-22 10:15:11,719 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:15:11,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-22 10:15:11,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-22 10:15:11,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-10-22 10:15:11,721 INFO L87 Difference]: Start difference. First operand 82 states and 109 transitions. Second operand 11 states. [2018-10-22 10:15:13,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:15:13,774 INFO L93 Difference]: Finished difference Result 96 states and 125 transitions. [2018-10-22 10:15:13,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-22 10:15:13,774 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-10-22 10:15:13,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:15:13,776 INFO L225 Difference]: With dead ends: 96 [2018-10-22 10:15:13,776 INFO L226 Difference]: Without dead ends: 94 [2018-10-22 10:15:13,777 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2018-10-22 10:15:13,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-22 10:15:13,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2018-10-22 10:15:13,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-22 10:15:13,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2018-10-22 10:15:13,802 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 112 transitions. Word has length 25 [2018-10-22 10:15:13,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:15:13,802 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 112 transitions. [2018-10-22 10:15:13,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-22 10:15:13,802 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 112 transitions. [2018-10-22 10:15:13,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-22 10:15:13,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:15:13,806 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-10-22 10:15:13,806 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:15:13,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:15:13,806 INFO L82 PathProgramCache]: Analyzing trace with hash 2114615578, now seen corresponding path program 1 times [2018-10-22 10:15:13,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:15:13,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:13,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:15:13,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:13,808 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:15:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:15:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-22 10:15:14,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:15:14,018 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:15:14,019 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-10-22 10:15:14,019 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-10-22 10:15:14,022 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:15:14,022 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:15:14,050 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 10:15:14,051 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-10-22 10:15:14,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:15:14,066 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 10:15:14,145 INFO L232 lantSequenceWeakener]: Weakened 23 states. On average, predicates are now at 68.7% of their original sizes. [2018-10-22 10:15:14,146 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 10:15:14,703 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 10:15:14,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 10:15:14,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [8] total 20 [2018-10-22 10:15:14,704 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:15:14,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-22 10:15:14,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-22 10:15:14,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-10-22 10:15:14,705 INFO L87 Difference]: Start difference. First operand 86 states and 112 transitions. Second operand 14 states. [2018-10-22 10:15:15,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:15:15,976 INFO L93 Difference]: Finished difference Result 133 states and 177 transitions. [2018-10-22 10:15:15,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-22 10:15:15,976 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-10-22 10:15:15,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:15:15,979 INFO L225 Difference]: With dead ends: 133 [2018-10-22 10:15:15,980 INFO L226 Difference]: Without dead ends: 131 [2018-10-22 10:15:15,980 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-10-22 10:15:15,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-22 10:15:16,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-10-22 10:15:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-22 10:15:16,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 166 transitions. [2018-10-22 10:15:16,029 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 166 transitions. Word has length 44 [2018-10-22 10:15:16,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:15:16,029 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 166 transitions. [2018-10-22 10:15:16,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-22 10:15:16,029 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 166 transitions. [2018-10-22 10:15:16,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-22 10:15:16,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:15:16,032 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-10-22 10:15:16,032 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:15:16,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:15:16,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1255310588, now seen corresponding path program 1 times [2018-10-22 10:15:16,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:15:16,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:16,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:15:16,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:16,034 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:15:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:15:16,142 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-22 10:15:16,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:15:16,143 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:15:16,143 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-10-22 10:15:16,143 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-10-22 10:15:16,146 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:15:16,146 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:15:16,169 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 10:15:16,169 INFO L272 AbstractInterpreter]: Visited 31 different actions 55 times. Never merged. Never widened. Never found a fixpoint. Largest state had 10 variables. [2018-10-22 10:15:16,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:15:16,199 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 10:15:16,245 INFO L232 lantSequenceWeakener]: Weakened 30 states. On average, predicates are now at 61.56% of their original sizes. [2018-10-22 10:15:16,245 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 10:15:16,427 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 10:15:16,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 10:15:16,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 17 [2018-10-22 10:15:16,428 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:15:16,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-22 10:15:16,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-22 10:15:16,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-10-22 10:15:16,431 INFO L87 Difference]: Start difference. First operand 123 states and 166 transitions. Second operand 12 states. [2018-10-22 10:15:19,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:15:19,604 INFO L93 Difference]: Finished difference Result 171 states and 228 transitions. [2018-10-22 10:15:19,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-22 10:15:19,604 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-10-22 10:15:19,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:15:19,608 INFO L225 Difference]: With dead ends: 171 [2018-10-22 10:15:19,608 INFO L226 Difference]: Without dead ends: 169 [2018-10-22 10:15:19,609 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-10-22 10:15:19,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-22 10:15:19,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 157. [2018-10-22 10:15:19,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-22 10:15:19,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 208 transitions. [2018-10-22 10:15:19,649 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 208 transitions. Word has length 48 [2018-10-22 10:15:19,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:15:19,650 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 208 transitions. [2018-10-22 10:15:19,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-22 10:15:19,650 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 208 transitions. [2018-10-22 10:15:19,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-22 10:15:19,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:15:19,654 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-10-22 10:15:19,654 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:15:19,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:15:19,655 INFO L82 PathProgramCache]: Analyzing trace with hash -979286812, now seen corresponding path program 1 times [2018-10-22 10:15:19,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:15:19,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:19,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:15:19,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:19,657 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:15:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:15:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-10-22 10:15:19,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:15:19,762 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:15:19,762 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-10-22 10:15:19,763 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-10-22 10:15:19,765 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:15:19,766 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:15:19,789 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 10:15:19,789 INFO L272 AbstractInterpreter]: Visited 35 different actions 67 times. Never merged. Never widened. Never found a fixpoint. Largest state had 10 variables. [2018-10-22 10:15:19,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:15:19,805 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 10:15:19,851 INFO L232 lantSequenceWeakener]: Weakened 38 states. On average, predicates are now at 62.28% of their original sizes. [2018-10-22 10:15:19,851 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 10:15:20,163 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 10:15:20,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 10:15:20,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 20 [2018-10-22 10:15:20,164 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:15:20,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-22 10:15:20,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-22 10:15:20,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-10-22 10:15:20,167 INFO L87 Difference]: Start difference. First operand 157 states and 208 transitions. Second operand 13 states. [2018-10-22 10:15:24,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:15:24,408 INFO L93 Difference]: Finished difference Result 229 states and 308 transitions. [2018-10-22 10:15:24,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-22 10:15:24,408 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 58 [2018-10-22 10:15:24,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:15:24,411 INFO L225 Difference]: With dead ends: 229 [2018-10-22 10:15:24,411 INFO L226 Difference]: Without dead ends: 227 [2018-10-22 10:15:24,412 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-10-22 10:15:24,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-22 10:15:24,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 191. [2018-10-22 10:15:24,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-22 10:15:24,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 254 transitions. [2018-10-22 10:15:24,464 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 254 transitions. Word has length 58 [2018-10-22 10:15:24,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:15:24,464 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 254 transitions. [2018-10-22 10:15:24,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-22 10:15:24,464 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 254 transitions. [2018-10-22 10:15:24,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-22 10:15:24,469 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:15:24,469 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-10-22 10:15:24,469 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:15:24,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:15:24,470 INFO L82 PathProgramCache]: Analyzing trace with hash 377935603, now seen corresponding path program 1 times [2018-10-22 10:15:24,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:15:24,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:24,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:15:24,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:24,471 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:15:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:15:24,632 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-22 10:15:24,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:15:24,633 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:15:24,633 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-10-22 10:15:24,633 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-10-22 10:15:24,635 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:15:24,635 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:15:25,120 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 10:15:25,121 INFO L272 AbstractInterpreter]: Visited 32 different actions 1156 times. Merged at 16 different actions 299 times. Widened at 3 different actions 24 times. Found 38 fixpoints after 6 different actions. Largest state had 10 variables. [2018-10-22 10:15:25,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:15:25,159 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 10:15:25,230 INFO L232 lantSequenceWeakener]: Weakened 29 states. On average, predicates are now at 75.52% of their original sizes. [2018-10-22 10:15:25,230 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 10:15:25,739 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 10:15:25,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 10:15:25,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 19 [2018-10-22 10:15:25,739 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:15:25,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-22 10:15:25,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-22 10:15:25,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-10-22 10:15:25,742 INFO L87 Difference]: Start difference. First operand 191 states and 254 transitions. Second operand 13 states. [2018-10-22 10:15:27,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:15:27,636 INFO L93 Difference]: Finished difference Result 252 states and 334 transitions. [2018-10-22 10:15:27,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-22 10:15:27,636 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2018-10-22 10:15:27,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:15:27,641 INFO L225 Difference]: With dead ends: 252 [2018-10-22 10:15:27,641 INFO L226 Difference]: Without dead ends: 250 [2018-10-22 10:15:27,642 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-10-22 10:15:27,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-22 10:15:27,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 239. [2018-10-22 10:15:27,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-22 10:15:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 314 transitions. [2018-10-22 10:15:27,712 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 314 transitions. Word has length 65 [2018-10-22 10:15:27,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:15:27,713 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 314 transitions. [2018-10-22 10:15:27,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-22 10:15:27,713 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 314 transitions. [2018-10-22 10:15:27,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-22 10:15:27,716 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:15:27,717 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-10-22 10:15:27,717 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:15:27,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:15:27,717 INFO L82 PathProgramCache]: Analyzing trace with hash -2026132663, now seen corresponding path program 1 times [2018-10-22 10:15:27,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:15:27,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:27,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:15:27,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:27,718 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:15:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:15:27,868 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 19 proven. 28 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-10-22 10:15:27,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:15:27,869 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:15:27,869 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 70 with the following transitions: [2018-10-22 10:15:27,869 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-10-22 10:15:27,872 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:15:27,873 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:15:27,894 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 10:15:27,895 INFO L272 AbstractInterpreter]: Visited 40 different actions 80 times. Never merged. Never widened. Never found a fixpoint. Largest state had 12 variables. [2018-10-22 10:15:27,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:15:27,931 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 10:15:27,985 INFO L232 lantSequenceWeakener]: Weakened 47 states. On average, predicates are now at 63.55% of their original sizes. [2018-10-22 10:15:27,985 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 10:15:28,214 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 10:15:28,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 10:15:28,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 21 [2018-10-22 10:15:28,215 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:15:28,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-22 10:15:28,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-22 10:15:28,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-10-22 10:15:28,217 INFO L87 Difference]: Start difference. First operand 239 states and 314 transitions. Second operand 13 states. [2018-10-22 10:15:37,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:15:37,477 INFO L93 Difference]: Finished difference Result 335 states and 461 transitions. [2018-10-22 10:15:37,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-22 10:15:37,478 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-10-22 10:15:37,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:15:37,481 INFO L225 Difference]: With dead ends: 335 [2018-10-22 10:15:37,481 INFO L226 Difference]: Without dead ends: 333 [2018-10-22 10:15:37,482 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-10-22 10:15:37,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-10-22 10:15:37,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 316. [2018-10-22 10:15:37,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-10-22 10:15:37,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 442 transitions. [2018-10-22 10:15:37,578 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 442 transitions. Word has length 69 [2018-10-22 10:15:37,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:15:37,579 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 442 transitions. [2018-10-22 10:15:37,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-22 10:15:37,579 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 442 transitions. [2018-10-22 10:15:37,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-22 10:15:37,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:15:37,582 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-10-22 10:15:37,583 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:15:37,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:15:37,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1267705639, now seen corresponding path program 1 times [2018-10-22 10:15:37,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:15:37,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:37,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:15:37,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:37,586 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:15:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:15:37,768 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 35 proven. 15 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-10-22 10:15:37,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:15:37,768 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:15:37,769 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 73 with the following transitions: [2018-10-22 10:15:37,769 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-10-22 10:15:37,771 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:15:37,771 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:15:37,820 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 10:15:37,820 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-10-22 10:15:37,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:15:37,860 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 10:15:37,922 INFO L232 lantSequenceWeakener]: Weakened 42 states. On average, predicates are now at 67.78% of their original sizes. [2018-10-22 10:15:37,923 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 10:15:38,368 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 10:15:38,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 10:15:38,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [8] total 20 [2018-10-22 10:15:38,369 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:15:38,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-22 10:15:38,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-22 10:15:38,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-10-22 10:15:38,371 INFO L87 Difference]: Start difference. First operand 316 states and 442 transitions. Second operand 14 states. [2018-10-22 10:15:41,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:15:41,506 INFO L93 Difference]: Finished difference Result 393 states and 551 transitions. [2018-10-22 10:15:41,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-22 10:15:41,506 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-10-22 10:15:41,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:15:41,512 INFO L225 Difference]: With dead ends: 393 [2018-10-22 10:15:41,513 INFO L226 Difference]: Without dead ends: 391 [2018-10-22 10:15:41,514 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-10-22 10:15:41,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-10-22 10:15:41,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 370. [2018-10-22 10:15:41,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-10-22 10:15:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 515 transitions. [2018-10-22 10:15:41,622 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 515 transitions. Word has length 72 [2018-10-22 10:15:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:15:41,623 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 515 transitions. [2018-10-22 10:15:41,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-22 10:15:41,624 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 515 transitions. [2018-10-22 10:15:41,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-22 10:15:41,627 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:15:41,627 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-10-22 10:15:41,628 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:15:41,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:15:41,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1889944727, now seen corresponding path program 1 times [2018-10-22 10:15:41,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:15:41,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:41,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:15:41,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:41,630 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:15:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:15:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 26 proven. 34 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-10-22 10:15:41,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:15:41,778 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:15:41,779 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2018-10-22 10:15:41,779 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-10-22 10:15:41,780 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:15:41,781 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:15:42,004 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 10:15:42,004 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-10-22 10:15:42,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:15:42,044 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 10:15:42,115 INFO L232 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 69.72% of their original sizes. [2018-10-22 10:15:42,116 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 10:15:42,636 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 10:15:42,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 10:15:42,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [7] total 20 [2018-10-22 10:15:42,637 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:15:42,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-22 10:15:42,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-22 10:15:42,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-22 10:15:42,639 INFO L87 Difference]: Start difference. First operand 370 states and 515 transitions. Second operand 15 states. [2018-10-22 10:15:47,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:15:47,292 INFO L93 Difference]: Finished difference Result 474 states and 670 transitions. [2018-10-22 10:15:47,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-22 10:15:47,293 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 84 [2018-10-22 10:15:47,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:15:47,297 INFO L225 Difference]: With dead ends: 474 [2018-10-22 10:15:47,297 INFO L226 Difference]: Without dead ends: 472 [2018-10-22 10:15:47,298 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 94 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2018-10-22 10:15:47,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2018-10-22 10:15:47,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 458. [2018-10-22 10:15:47,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-10-22 10:15:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 650 transitions. [2018-10-22 10:15:47,428 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 650 transitions. Word has length 84 [2018-10-22 10:15:47,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:15:47,429 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 650 transitions. [2018-10-22 10:15:47,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-22 10:15:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 650 transitions. [2018-10-22 10:15:47,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-22 10:15:47,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:15:47,433 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-10-22 10:15:47,433 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:15:47,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:15:47,434 INFO L82 PathProgramCache]: Analyzing trace with hash 532621103, now seen corresponding path program 1 times [2018-10-22 10:15:47,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:15:47,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:47,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:15:47,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:47,437 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:15:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:15:47,638 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 39 proven. 25 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2018-10-22 10:15:47,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:15:47,638 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:15:47,638 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 87 with the following transitions: [2018-10-22 10:15:47,638 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-10-22 10:15:47,640 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:15:47,640 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:15:47,659 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 10:15:47,660 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-10-22 10:15:47,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:15:47,671 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 10:15:47,729 INFO L232 lantSequenceWeakener]: Weakened 54 states. On average, predicates are now at 63.83% of their original sizes. [2018-10-22 10:15:47,729 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 10:15:48,046 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 10:15:48,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 10:15:48,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 21 [2018-10-22 10:15:48,047 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:15:48,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-22 10:15:48,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-22 10:15:48,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-10-22 10:15:48,048 INFO L87 Difference]: Start difference. First operand 458 states and 650 transitions. Second operand 15 states. [2018-10-22 10:15:51,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:15:51,439 INFO L93 Difference]: Finished difference Result 562 states and 786 transitions. [2018-10-22 10:15:51,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-22 10:15:51,439 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 86 [2018-10-22 10:15:51,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:15:51,442 INFO L225 Difference]: With dead ends: 562 [2018-10-22 10:15:51,443 INFO L226 Difference]: Without dead ends: 320 [2018-10-22 10:15:51,450 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 90 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-10-22 10:15:51,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-22 10:15:51,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 316. [2018-10-22 10:15:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-10-22 10:15:51,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 436 transitions. [2018-10-22 10:15:51,539 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 436 transitions. Word has length 86 [2018-10-22 10:15:51,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:15:51,540 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 436 transitions. [2018-10-22 10:15:51,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-22 10:15:51,540 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 436 transitions. [2018-10-22 10:15:51,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-22 10:15:51,542 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:15:51,542 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-10-22 10:15:51,542 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:15:51,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:15:51,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1428285441, now seen corresponding path program 1 times [2018-10-22 10:15:51,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:15:51,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:51,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:15:51,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:15:51,546 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:15:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:15:51,802 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 45 proven. 50 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-10-22 10:15:51,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:15:51,802 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:15:51,803 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 89 with the following transitions: [2018-10-22 10:15:51,803 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-10-22 10:15:51,806 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:15:51,807 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:15:51,961 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 10:15:51,962 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-10-22 10:15:51,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:15:51,995 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 10:15:52,059 INFO L232 lantSequenceWeakener]: Weakened 47 states. On average, predicates are now at 76.17% of their original sizes. [2018-10-22 10:15:52,059 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 10:15:52,440 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 10:15:52,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 10:15:52,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [8] total 23 [2018-10-22 10:15:52,441 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:15:52,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-22 10:15:52,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-22 10:15:52,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-10-22 10:15:52,442 INFO L87 Difference]: Start difference. First operand 316 states and 436 transitions. Second operand 17 states. [2018-10-22 10:16:00,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:16:00,265 INFO L93 Difference]: Finished difference Result 502 states and 705 transitions. [2018-10-22 10:16:00,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-22 10:16:00,265 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2018-10-22 10:16:00,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:16:00,269 INFO L225 Difference]: With dead ends: 502 [2018-10-22 10:16:00,269 INFO L226 Difference]: Without dead ends: 500 [2018-10-22 10:16:00,270 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 106 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=287, Invalid=903, Unknown=0, NotChecked=0, Total=1190 [2018-10-22 10:16:00,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-10-22 10:16:00,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 382. [2018-10-22 10:16:00,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-22 10:16:00,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 522 transitions. [2018-10-22 10:16:00,487 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 522 transitions. Word has length 88 [2018-10-22 10:16:00,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:16:00,488 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 522 transitions. [2018-10-22 10:16:00,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-22 10:16:00,488 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 522 transitions. [2018-10-22 10:16:00,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-22 10:16:00,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:16:00,493 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-10-22 10:16:00,493 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:16:00,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:16:00,493 INFO L82 PathProgramCache]: Analyzing trace with hash 932385919, now seen corresponding path program 1 times [2018-10-22 10:16:00,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:16:00,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:16:00,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:16:00,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:16:00,500 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:16:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:16:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 26 proven. 34 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2018-10-22 10:16:00,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:16:00,620 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:16:00,621 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 89 with the following transitions: [2018-10-22 10:16:00,621 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-10-22 10:16:00,622 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:16:00,623 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:16:00,888 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 10:16:00,888 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-10-22 10:16:00,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:16:00,919 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 10:16:00,987 INFO L232 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 69.72% of their original sizes. [2018-10-22 10:16:00,987 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 10:16:01,864 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 10:16:01,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 10:16:01,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [7] total 20 [2018-10-22 10:16:01,864 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:16:01,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-22 10:16:01,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-22 10:16:01,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-10-22 10:16:01,865 INFO L87 Difference]: Start difference. First operand 382 states and 522 transitions. Second operand 15 states. [2018-10-22 10:16:04,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:16:04,874 INFO L93 Difference]: Finished difference Result 504 states and 705 transitions. [2018-10-22 10:16:04,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-22 10:16:04,874 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 88 [2018-10-22 10:16:04,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:16:04,878 INFO L225 Difference]: With dead ends: 504 [2018-10-22 10:16:04,878 INFO L226 Difference]: Without dead ends: 502 [2018-10-22 10:16:04,879 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2018-10-22 10:16:04,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2018-10-22 10:16:05,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 460. [2018-10-22 10:16:05,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-22 10:16:05,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 636 transitions. [2018-10-22 10:16:05,058 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 636 transitions. Word has length 88 [2018-10-22 10:16:05,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:16:05,058 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 636 transitions. [2018-10-22 10:16:05,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-22 10:16:05,059 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 636 transitions. [2018-10-22 10:16:05,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-22 10:16:05,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:16:05,063 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-10-22 10:16:05,063 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:16:05,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:16:05,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1245277849, now seen corresponding path program 1 times [2018-10-22 10:16:05,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:16:05,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:16:05,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:16:05,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:16:05,066 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:16:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:16:05,455 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 49 proven. 50 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-10-22 10:16:05,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:16:05,455 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:16:05,455 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 93 with the following transitions: [2018-10-22 10:16:05,456 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-10-22 10:16:05,457 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:16:05,457 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:16:05,762 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 10:16:05,763 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-10-22 10:16:05,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:16:05,803 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 10:16:05,869 INFO L232 lantSequenceWeakener]: Weakened 51 states. On average, predicates are now at 71.96% of their original sizes. [2018-10-22 10:16:05,869 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 10:16:06,521 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 10:16:06,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 10:16:06,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [8] total 24 [2018-10-22 10:16:06,522 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:16:06,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-22 10:16:06,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-22 10:16:06,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-10-22 10:16:06,524 INFO L87 Difference]: Start difference. First operand 460 states and 636 transitions. Second operand 18 states. [2018-10-22 10:16:12,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:16:12,371 INFO L93 Difference]: Finished difference Result 905 states and 1335 transitions. [2018-10-22 10:16:12,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-22 10:16:12,371 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 92 [2018-10-22 10:16:12,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:16:12,372 INFO L225 Difference]: With dead ends: 905 [2018-10-22 10:16:12,372 INFO L226 Difference]: Without dead ends: 0 [2018-10-22 10:16:12,375 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 105 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=279, Invalid=651, Unknown=0, NotChecked=0, Total=930 [2018-10-22 10:16:12,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-22 10:16:12,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-22 10:16:12,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-22 10:16:12,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-22 10:16:12,377 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2018-10-22 10:16:12,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:16:12,378 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-22 10:16:12,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-22 10:16:12,379 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-22 10:16:12,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-22 10:16:12,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-22 10:16:13,881 WARN L179 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 399 DAG size of output: 231 [2018-10-22 10:16:14,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:14,146 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 119 [2018-10-22 10:16:14,295 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 270 DAG size of output: 106 [2018-10-22 10:16:15,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:15,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:16,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:16,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:16,604 WARN L179 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 406 DAG size of output: 353 [2018-10-22 10:16:16,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:16,783 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 119 [2018-10-22 10:16:16,890 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 270 DAG size of output: 106 [2018-10-22 10:16:17,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:17,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:18,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:18,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:18,709 WARN L179 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 406 DAG size of output: 353 [2018-10-22 10:16:18,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:18,866 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 119 [2018-10-22 10:16:19,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:19,029 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 119 [2018-10-22 10:16:19,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:19,267 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 348 DAG size of output: 142 [2018-10-22 10:16:19,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:19,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:19,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:19,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:19,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:19,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:19,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:19,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:20,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:20,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:20,382 WARN L179 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 406 DAG size of output: 348 [2018-10-22 10:16:20,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:20,545 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 348 DAG size of output: 142 [2018-10-22 10:16:20,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:20,812 WARN L179 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 362 DAG size of output: 293 [2018-10-22 10:16:21,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:16:21,216 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 377 DAG size of output: 222 [2018-10-22 10:16:21,927 WARN L179 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 37 [2018-10-22 10:16:22,064 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 27 [2018-10-22 10:16:22,200 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 26 [2018-10-22 10:16:24,231 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 351 DAG size of output: 37 [2018-10-22 10:16:24,377 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 27 [2018-10-22 10:16:24,515 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 26 [2018-10-22 10:16:26,577 WARN L179 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 351 DAG size of output: 37 [2018-10-22 10:16:26,709 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 27 [2018-10-22 10:16:26,840 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 27 [2018-10-22 10:16:26,970 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 25 [2018-10-22 10:16:27,542 WARN L179 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 27 [2018-10-22 10:16:27,676 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 25 [2018-10-22 10:16:29,377 WARN L179 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 343 DAG size of output: 40 [2018-10-22 10:16:29,992 WARN L179 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 27 [2018-10-22 10:16:30,765 WARN L179 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 292 DAG size of output: 30 [2018-10-22 10:16:30,934 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 26 [2018-10-22 10:16:31,377 WARN L179 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 37 [2018-10-22 10:16:31,510 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 26 [2018-10-22 10:16:31,514 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-22 10:16:31,514 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-22 10:16:31,514 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-22 10:16:31,514 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-22 10:16:31,514 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-22 10:16:31,514 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-22 10:16:31,515 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-10-22 10:16:31,515 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 53) no Hoare annotation was computed. [2018-10-22 10:16:31,515 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-10-22 10:16:31,515 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-10-22 10:16:31,515 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-10-22 10:16:31,516 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-10-22 10:16:31,516 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-10-22 10:16:31,516 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-10-22 10:16:31,516 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-10-22 10:16:31,516 INFO L425 ceAbstractionStarter]: For program point L20-1(lines 20 51) no Hoare annotation was computed. [2018-10-22 10:16:31,517 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-10-22 10:16:31,517 INFO L425 ceAbstractionStarter]: For program point L20-4(lines 20 51) no Hoare annotation was computed. [2018-10-22 10:16:31,517 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-10-22 10:16:31,517 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-10-22 10:16:31,517 INFO L425 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-10-22 10:16:31,517 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-10-22 10:16:31,517 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 21 50) no Hoare annotation was computed. [2018-10-22 10:16:31,518 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-10-22 10:16:31,518 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-10-22 10:16:31,518 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-10-22 10:16:31,518 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 53) no Hoare annotation was computed. [2018-10-22 10:16:31,518 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-10-22 10:16:31,518 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-10-22 10:16:31,519 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-10-22 10:16:31,519 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-10-22 10:16:31,519 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 53) the Hoare annotation is: true [2018-10-22 10:16:31,519 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-10-22 10:16:31,519 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-10-22 10:16:31,519 INFO L425 ceAbstractionStarter]: For program point L22(lines 22 49) no Hoare annotation was computed. [2018-10-22 10:16:31,519 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-10-22 10:16:31,520 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-10-22 10:16:31,520 INFO L425 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2018-10-22 10:16:31,520 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-10-22 10:16:31,520 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-10-22 10:16:31,520 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-10-22 10:16:31,520 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-10-22 10:16:31,520 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-10-22 10:16:31,520 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-10-22 10:16:31,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 10:16:31 BoogieIcfgContainer [2018-10-22 10:16:31,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-22 10:16:31,537 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-22 10:16:31,538 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-22 10:16:31,538 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-22 10:16:31,538 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 10:15:06" (3/4) ... [2018-10-22 10:16:31,542 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-22 10:16:31,556 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-22 10:16:31,557 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-22 10:16:31,557 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-10-22 10:16:31,571 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2018-10-22 10:16:31,571 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-10-22 10:16:31,571 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-22 10:16:31,638 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/witness.graphml [2018-10-22 10:16:31,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-22 10:16:31,640 INFO L168 Benchmark]: Toolchain (without parser) took 85851.05 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 860.9 MB). Free memory was 953.2 MB in the beginning and 1.5 GB in the end (delta: -552.7 MB). Peak memory consumption was 308.2 MB. Max. memory is 11.5 GB. [2018-10-22 10:16:31,640 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-22 10:16:31,641 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.52 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-22 10:16:31,641 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.36 ms. Allocated memory is still 1.0 GB. Free memory is still 942.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-22 10:16:31,642 INFO L168 Benchmark]: Boogie Preprocessor took 27.17 ms. Allocated memory is still 1.0 GB. Free memory was 942.4 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-22 10:16:31,643 INFO L168 Benchmark]: RCFGBuilder took 602.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2018-10-22 10:16:31,643 INFO L168 Benchmark]: TraceAbstraction took 84755.12 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 708.8 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -378.1 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-10-22 10:16:31,645 INFO L168 Benchmark]: Witness Printer took 100.62 ms. Allocated memory is still 1.9 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 38.5 kB). Peak memory consumption was 38.5 kB. Max. memory is 11.5 GB. [2018-10-22 10:16:31,649 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 336.52 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.4 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 22.36 ms. Allocated memory is still 1.0 GB. Free memory is still 942.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.17 ms. Allocated memory is still 1.0 GB. Free memory was 942.4 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 602.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 84755.12 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 708.8 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -378.1 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 100.62 ms. Allocated memory is still 1.9 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 38.5 kB). Peak memory consumption was 38.5 kB. 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, 84.6s OverallTime, 15 OverallIterations, 14 TraceHistogramMax, 52.4s AutomataDifference, 0.0s DeadEndRemovalTime, 19.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1034 SDtfs, 890 SDslu, 4407 SDs, 0 SdLazy, 2312 SolverSat, 1976 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 26 DeclaredPredicates, 929 GetRequests, 689 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 9.3s 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, 2.2s AbstIntTime, 13 AbstIntIterations, 13 AbstIntStrong, 0.9003762782818469 AbsIntWeakeningRatio, 0.4794188861985472 AbsIntAvgWeakeningVarsNumRemoved, 6.825665859564165 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 307 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 539 PreInvPairs, 923 NumberOfFragments, 974 HoareAnnotationTreeSize, 539 FomulaSimplifications, 4280871 FormulaSimplificationTreeSizeReduction, 8.8s HoareSimplificationTime, 23 FomulaSimplificationsInter, 276368 FormulaSimplificationTreeSizeReductionInter, 10.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s 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...