./Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call_true-termination.i --full-output --rcfgbuilder.size.of.a.code.block SingleStatement --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/apache-get-tag_true-unreach-call_true-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 01c80fcdd0a0da14cc25a34188deb5573e4a4209 --rcfgbuilder.size.of.a.code.block SingleStatement ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 09:51:26,568 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-22 09:51:26,570 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-22 09:51:26,588 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-22 09:51:26,588 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-22 09:51:26,590 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-22 09:51:26,592 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-22 09:51:26,594 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-22 09:51:26,597 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-22 09:51:26,599 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-22 09:51:26,600 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-22 09:51:26,600 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-22 09:51:26,602 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-22 09:51:26,603 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-22 09:51:26,604 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-22 09:51:26,612 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-22 09:51:26,613 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-22 09:51:26,617 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-22 09:51:26,619 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-22 09:51:26,622 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-22 09:51:26,625 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-22 09:51:26,626 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-22 09:51:26,631 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-22 09:51:26,631 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-22 09:51:26,631 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-22 09:51:26,632 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-22 09:51:26,633 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-22 09:51:26,638 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-22 09:51:26,638 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-22 09:51:26,639 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-22 09:51:26,640 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-22 09:51:26,640 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-22 09:51:26,641 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-22 09:51:26,642 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-22 09:51:26,644 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-22 09:51:26,645 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-22 09:51:26,645 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-22 09:51:26,668 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-22 09:51:26,669 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-22 09:51:26,669 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-22 09:51:26,671 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-22 09:51:26,671 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-22 09:51:26,671 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-22 09:51:26,671 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-22 09:51:26,671 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-22 09:51:26,672 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-22 09:51:26,672 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-22 09:51:26,672 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-22 09:51:26,673 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-22 09:51:26,674 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-22 09:51:26,674 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-22 09:51:26,674 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-22 09:51:26,674 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-22 09:51:26,674 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-22 09:51:26,675 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-22 09:51:26,675 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-22 09:51:26,675 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-22 09:51:26,675 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-22 09:51:26,675 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-22 09:51:26,676 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-22 09:51:26,677 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-22 09:51:26,677 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-22 09:51:26,677 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-22 09:51:26,677 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-22 09:51:26,678 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-22 09:51:26,678 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-22 09:51:26,678 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-22 09:51:26,678 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-22 09:51:26,678 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-22 09:51:26,678 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-22 09:51:26,679 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-22 09:51:26,679 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 -> 01c80fcdd0a0da14cc25a34188deb5573e4a4209 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement [2018-10-22 09:51:26,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-22 09:51:26,784 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-22 09:51:26,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-22 09:51:26,789 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-22 09:51:26,790 INFO L276 PluginConnector]: CDTParser initialized [2018-10-22 09:51:26,790 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call_true-termination.i [2018-10-22 09:51:26,856 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/446339cf7/bf26d4c13bbf4e55882c8e139b116b58/FLAG2fe9f6379 [2018-10-22 09:51:27,339 INFO L298 CDTParser]: Found 1 translation units. [2018-10-22 09:51:27,340 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call_true-termination.i [2018-10-22 09:51:27,346 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/446339cf7/bf26d4c13bbf4e55882c8e139b116b58/FLAG2fe9f6379 [2018-10-22 09:51:27,363 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/446339cf7/bf26d4c13bbf4e55882c8e139b116b58 [2018-10-22 09:51:27,369 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-22 09:51:27,371 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-22 09:51:27,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-22 09:51:27,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-22 09:51:27,376 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-22 09:51:27,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:51:27" (1/1) ... [2018-10-22 09:51:27,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12582e65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:51:27, skipping insertion in model container [2018-10-22 09:51:27,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:51:27" (1/1) ... [2018-10-22 09:51:27,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-22 09:51:27,415 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-22 09:51:27,624 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 09:51:27,628 INFO L189 MainTranslator]: Completed pre-run [2018-10-22 09:51:27,650 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 09:51:27,664 INFO L193 MainTranslator]: Completed translation [2018-10-22 09:51:27,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:51:27 WrapperNode [2018-10-22 09:51:27,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-22 09:51:27,665 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-22 09:51:27,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-22 09:51:27,665 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-22 09:51:27,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:51:27" (1/1) ... [2018-10-22 09:51:27,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:51:27" (1/1) ... [2018-10-22 09:51:27,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-22 09:51:27,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-22 09:51:27,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-22 09:51:27,685 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-22 09:51:27,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:51:27" (1/1) ... [2018-10-22 09:51:27,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:51:27" (1/1) ... [2018-10-22 09:51:27,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:51:27" (1/1) ... [2018-10-22 09:51:27,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:51:27" (1/1) ... [2018-10-22 09:51:27,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:51:27" (1/1) ... [2018-10-22 09:51:27,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:51:27" (1/1) ... [2018-10-22 09:51:27,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:51:27" (1/1) ... [2018-10-22 09:51:27,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-22 09:51:27,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-22 09:51:27,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-22 09:51:27,712 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-22 09:51:27,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:51:27" (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 09:51:27,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-22 09:51:27,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-22 09:51:27,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-22 09:51:27,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-22 09:51:27,840 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-22 09:51:27,840 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-22 09:51:27,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-22 09:51:27,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-22 09:51:28,341 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-22 09:51:28,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:51:28 BoogieIcfgContainer [2018-10-22 09:51:28,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-22 09:51:28,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-22 09:51:28,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-22 09:51:28,347 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-22 09:51:28,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:51:27" (1/3) ... [2018-10-22 09:51:28,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c067e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:51:28, skipping insertion in model container [2018-10-22 09:51:28,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:51:27" (2/3) ... [2018-10-22 09:51:28,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c067e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:51:28, skipping insertion in model container [2018-10-22 09:51:28,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:51:28" (3/3) ... [2018-10-22 09:51:28,352 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call_true-termination.i [2018-10-22 09:51:28,362 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-22 09:51:28,373 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-22 09:51:28,390 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-22 09:51:28,427 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-22 09:51:28,428 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-22 09:51:28,428 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-22 09:51:28,428 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-22 09:51:28,428 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-22 09:51:28,428 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-22 09:51:28,428 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-22 09:51:28,429 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-22 09:51:28,429 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-22 09:51:28,449 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-10-22 09:51:28,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-22 09:51:28,456 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 09:51:28,457 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 09:51:28,460 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 09:51:28,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:51:28,466 INFO L82 PathProgramCache]: Analyzing trace with hash -2067193188, now seen corresponding path program 1 times [2018-10-22 09:51:28,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 09:51:28,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:51:28,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:51:28,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:51:28,518 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 09:51:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:51:28,588 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 09:51:28,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 09:51:28,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-22 09:51:28,591 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 09:51:28,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-22 09:51:28,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-22 09:51:28,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-22 09:51:28,611 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-10-22 09:51:28,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 09:51:28,650 INFO L93 Difference]: Finished difference Result 138 states and 207 transitions. [2018-10-22 09:51:28,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-22 09:51:28,652 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-10-22 09:51:28,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 09:51:28,664 INFO L225 Difference]: With dead ends: 138 [2018-10-22 09:51:28,664 INFO L226 Difference]: Without dead ends: 71 [2018-10-22 09:51:28,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-22 09:51:28,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-22 09:51:28,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-10-22 09:51:28,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-22 09:51:28,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2018-10-22 09:51:28,730 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 19 [2018-10-22 09:51:28,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 09:51:28,733 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2018-10-22 09:51:28,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-22 09:51:28,733 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2018-10-22 09:51:28,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-22 09:51:28,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 09:51:28,734 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 09:51:28,736 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 09:51:28,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:51:28,738 INFO L82 PathProgramCache]: Analyzing trace with hash -605047221, now seen corresponding path program 1 times [2018-10-22 09:51:28,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 09:51:28,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:51:28,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:51:28,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:51:28,742 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 09:51:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:51:28,833 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 09:51:28,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 09:51:28,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-22 09:51:28,834 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 09:51:28,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-22 09:51:28,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-22 09:51:28,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-22 09:51:28,837 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand 5 states. [2018-10-22 09:51:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 09:51:29,291 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2018-10-22 09:51:29,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-22 09:51:29,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-10-22 09:51:29,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 09:51:29,294 INFO L225 Difference]: With dead ends: 94 [2018-10-22 09:51:29,294 INFO L226 Difference]: Without dead ends: 92 [2018-10-22 09:51:29,295 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 09:51:29,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-22 09:51:29,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2018-10-22 09:51:29,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-22 09:51:29,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 107 transitions. [2018-10-22 09:51:29,314 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 107 transitions. Word has length 21 [2018-10-22 09:51:29,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 09:51:29,315 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 107 transitions. [2018-10-22 09:51:29,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-22 09:51:29,316 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 107 transitions. [2018-10-22 09:51:29,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-22 09:51:29,317 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 09:51:29,317 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-22 09:51:29,317 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 09:51:29,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:51:29,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1819953139, now seen corresponding path program 1 times [2018-10-22 09:51:29,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 09:51:29,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:51:29,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:51:29,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:51:29,321 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 09:51:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:51:29,468 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 09:51:29,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:51:29,469 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 09:51:29,471 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-10-22 09:51:29,473 INFO L202 CegarAbsIntRunner]: [0], [4], [5], [6], [7], [8], [11], [15], [16], [17], [18], [22], [28], [31], [125], [128], [130], [133], [135], [136], [137], [138], [140], [141], [142] [2018-10-22 09:51:29,531 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 09:51:29,532 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 09:51:29,687 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 09:51:29,689 INFO L272 AbstractInterpreter]: Visited 24 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 4 variables. [2018-10-22 09:51:29,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:51:29,701 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 09:51:29,861 INFO L232 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 59.52% of their original sizes. [2018-10-22 09:51:29,862 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 09:51:30,181 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 09:51:30,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 09:51:30,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2018-10-22 09:51:30,182 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 09:51:30,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-22 09:51:30,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-22 09:51:30,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-22 09:51:30,183 INFO L87 Difference]: Start difference. First operand 85 states and 107 transitions. Second operand 10 states. [2018-10-22 09:51:31,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 09:51:31,997 INFO L93 Difference]: Finished difference Result 98 states and 121 transitions. [2018-10-22 09:51:31,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-22 09:51:31,998 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-10-22 09:51:31,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 09:51:32,000 INFO L225 Difference]: With dead ends: 98 [2018-10-22 09:51:32,000 INFO L226 Difference]: Without dead ends: 94 [2018-10-22 09:51:32,001 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-10-22 09:51:32,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-22 09:51:32,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2018-10-22 09:51:32,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-22 09:51:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2018-10-22 09:51:32,029 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 26 [2018-10-22 09:51:32,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 09:51:32,029 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2018-10-22 09:51:32,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-22 09:51:32,030 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2018-10-22 09:51:32,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-22 09:51:32,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 09:51:32,031 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 09:51:32,032 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 09:51:32,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:51:32,032 INFO L82 PathProgramCache]: Analyzing trace with hash -212399780, now seen corresponding path program 1 times [2018-10-22 09:51:32,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 09:51:32,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:51:32,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:51:32,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:51:32,034 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 09:51:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:51:32,145 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-22 09:51:32,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:51:32,146 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 09:51:32,146 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-10-22 09:51:32,147 INFO L202 CegarAbsIntRunner]: [0], [4], [5], [6], [7], [8], [11], [15], [16], [17], [18], [22], [28], [35], [36], [39], [40], [54], [55], [56], [60], [66], [69], [125], [128], [130], [133], [135], [136], [137], [138], [148], [149], [150], [151], [152] [2018-10-22 09:51:32,150 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 09:51:32,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 09:51:32,175 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 09:51:32,175 INFO L272 AbstractInterpreter]: Visited 35 different actions 43 times. Never merged. Never widened. Never found a fixpoint. Largest state had 6 variables. [2018-10-22 09:51:32,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:51:32,194 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 09:51:32,290 INFO L232 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 58.33% of their original sizes. [2018-10-22 09:51:32,291 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 09:51:32,768 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 09:51:32,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 09:51:32,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [7] total 19 [2018-10-22 09:51:32,769 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 09:51:32,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-22 09:51:32,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-22 09:51:32,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-10-22 09:51:32,771 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand 14 states. [2018-10-22 09:51:34,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 09:51:34,972 INFO L93 Difference]: Finished difference Result 128 states and 158 transitions. [2018-10-22 09:51:34,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-22 09:51:34,972 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-10-22 09:51:34,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 09:51:34,974 INFO L225 Difference]: With dead ends: 128 [2018-10-22 09:51:34,974 INFO L226 Difference]: Without dead ends: 121 [2018-10-22 09:51:34,975 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-10-22 09:51:34,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-22 09:51:34,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2018-10-22 09:51:34,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-22 09:51:34,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2018-10-22 09:51:34,991 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 141 transitions. Word has length 40 [2018-10-22 09:51:34,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 09:51:34,992 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 141 transitions. [2018-10-22 09:51:34,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-22 09:51:34,992 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2018-10-22 09:51:34,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-22 09:51:34,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 09:51:34,994 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-10-22 09:51:34,994 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 09:51:34,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:51:34,994 INFO L82 PathProgramCache]: Analyzing trace with hash 743016426, now seen corresponding path program 1 times [2018-10-22 09:51:34,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 09:51:34,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:51:34,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:51:34,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:51:34,996 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 09:51:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:51:35,115 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-22 09:51:35,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:51:35,116 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 09:51:35,116 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-10-22 09:51:35,116 INFO L202 CegarAbsIntRunner]: [0], [4], [5], [6], [7], [8], [11], [15], [16], [17], [18], [22], [28], [31], [35], [36], [42], [43], [46], [47], [48], [125], [128], [130], [133], [135], [136], [137], [138], [140], [144], [145], [146], [147] [2018-10-22 09:51:35,119 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 09:51:35,119 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 09:51:35,216 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 09:51:35,217 INFO L272 AbstractInterpreter]: Visited 33 different actions 230 times. Merged at 12 different actions 84 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-10-22 09:51:35,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:51:35,236 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 09:51:35,288 INFO L232 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 58.33% of their original sizes. [2018-10-22 09:51:35,288 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 09:51:35,726 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 09:51:35,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 09:51:35,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [7] total 20 [2018-10-22 09:51:35,727 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 09:51:35,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-22 09:51:35,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-22 09:51:35,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-10-22 09:51:35,729 INFO L87 Difference]: Start difference. First operand 115 states and 141 transitions. Second operand 15 states. [2018-10-22 09:51:37,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 09:51:37,692 INFO L93 Difference]: Finished difference Result 123 states and 148 transitions. [2018-10-22 09:51:37,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-22 09:51:37,693 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-10-22 09:51:37,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 09:51:37,696 INFO L225 Difference]: With dead ends: 123 [2018-10-22 09:51:37,696 INFO L226 Difference]: Without dead ends: 119 [2018-10-22 09:51:37,697 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2018-10-22 09:51:37,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-22 09:51:37,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-10-22 09:51:37,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-22 09:51:37,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 140 transitions. [2018-10-22 09:51:37,712 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 140 transitions. Word has length 40 [2018-10-22 09:51:37,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 09:51:37,712 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 140 transitions. [2018-10-22 09:51:37,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-22 09:51:37,712 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 140 transitions. [2018-10-22 09:51:37,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-22 09:51:37,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 09:51:37,716 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 09:51:37,716 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 09:51:37,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:51:37,716 INFO L82 PathProgramCache]: Analyzing trace with hash 669367645, now seen corresponding path program 1 times [2018-10-22 09:51:37,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 09:51:37,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:51:37,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:51:37,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:51:37,719 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 09:51:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:51:37,830 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-22 09:51:37,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:51:37,831 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 09:51:37,831 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-10-22 09:51:37,831 INFO L202 CegarAbsIntRunner]: [0], [4], [5], [6], [7], [8], [11], [15], [16], [17], [18], [22], [28], [35], [36], [39], [40], [42], [43], [46], [47], [48], [54], [55], [56], [60], [66], [69], [125], [128], [130], [133], [135], [136], [137], [138], [144], [145], [146], [147], [148], [149], [150], [151], [152] [2018-10-22 09:51:37,835 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 09:51:37,835 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 09:51:37,956 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 09:51:37,956 INFO L272 AbstractInterpreter]: Visited 44 different actions 374 times. Merged at 21 different actions 143 times. Widened at 2 different actions 5 times. Found 2 fixpoints after 2 different actions. Largest state had 7 variables. [2018-10-22 09:51:37,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:51:37,972 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 09:51:38,014 INFO L232 lantSequenceWeakener]: Weakened 23 states. On average, predicates are now at 61.59% of their original sizes. [2018-10-22 09:51:38,015 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 09:51:38,240 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 09:51:38,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 09:51:38,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [7] total 21 [2018-10-22 09:51:38,240 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 09:51:38,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-22 09:51:38,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-22 09:51:38,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-10-22 09:51:38,242 INFO L87 Difference]: Start difference. First operand 117 states and 140 transitions. Second operand 16 states. [2018-10-22 09:51:41,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 09:51:41,139 INFO L93 Difference]: Finished difference Result 152 states and 184 transitions. [2018-10-22 09:51:41,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-22 09:51:41,139 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-10-22 09:51:41,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 09:51:41,142 INFO L225 Difference]: With dead ends: 152 [2018-10-22 09:51:41,142 INFO L226 Difference]: Without dead ends: 145 [2018-10-22 09:51:41,143 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2018-10-22 09:51:41,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-22 09:51:41,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 114. [2018-10-22 09:51:41,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-22 09:51:41,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2018-10-22 09:51:41,165 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 59 [2018-10-22 09:51:41,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 09:51:41,165 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2018-10-22 09:51:41,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-22 09:51:41,166 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2018-10-22 09:51:41,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-22 09:51:41,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 09:51:41,170 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:51:41,170 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 09:51:41,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:51:41,170 INFO L82 PathProgramCache]: Analyzing trace with hash 977582821, now seen corresponding path program 1 times [2018-10-22 09:51:41,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 09:51:41,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:51:41,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:51:41,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:51:41,173 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 09:51:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:51:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-22 09:51:41,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:51:41,347 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 09:51:41,347 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-10-22 09:51:41,347 INFO L202 CegarAbsIntRunner]: [0], [4], [5], [6], [7], [8], [11], [15], [16], [17], [18], [22], [28], [35], [36], [39], [40], [54], [55], [56], [60], [66], [73], [74], [77], [78], [79], [82], [83], [86], [87], [88], [91], [125], [128], [130], [133], [135], [136], [137], [138], [148], [149], [150], [151], [156], [157], [158], [159], [160] [2018-10-22 09:51:41,350 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 09:51:41,350 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 09:51:41,366 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 09:51:41,367 INFO L272 AbstractInterpreter]: Visited 49 different actions 65 times. Never merged. Never widened. Never found a fixpoint. Largest state had 9 variables. [2018-10-22 09:51:41,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:51:41,373 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 09:51:41,416 INFO L232 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 60.42% of their original sizes. [2018-10-22 09:51:41,416 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 09:51:41,740 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 09:51:41,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 09:51:41,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [7] total 24 [2018-10-22 09:51:41,741 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 09:51:41,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-22 09:51:41,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-22 09:51:41,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-10-22 09:51:41,742 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand 19 states. [2018-10-22 09:51:46,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 09:51:46,158 INFO L93 Difference]: Finished difference Result 159 states and 190 transitions. [2018-10-22 09:51:46,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-22 09:51:46,158 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-10-22 09:51:46,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 09:51:46,160 INFO L225 Difference]: With dead ends: 159 [2018-10-22 09:51:46,160 INFO L226 Difference]: Without dead ends: 155 [2018-10-22 09:51:46,161 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2018-10-22 09:51:46,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-22 09:51:46,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 149. [2018-10-22 09:51:46,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-22 09:51:46,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 178 transitions. [2018-10-22 09:51:46,180 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 178 transitions. Word has length 60 [2018-10-22 09:51:46,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 09:51:46,180 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 178 transitions. [2018-10-22 09:51:46,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-22 09:51:46,181 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 178 transitions. [2018-10-22 09:51:46,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-22 09:51:46,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 09:51:46,189 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1] [2018-10-22 09:51:46,189 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 09:51:46,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:51:46,189 INFO L82 PathProgramCache]: Analyzing trace with hash 973218989, now seen corresponding path program 1 times [2018-10-22 09:51:46,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 09:51:46,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:51:46,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:51:46,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:51:46,191 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 09:51:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:51:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-22 09:51:46,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:51:46,342 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 09:51:46,342 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-10-22 09:51:46,342 INFO L202 CegarAbsIntRunner]: [0], [4], [5], [6], [7], [8], [11], [15], [16], [17], [18], [22], [28], [35], [36], [39], [40], [54], [55], [56], [60], [66], [69], [73], [74], [101], [102], [103], [109], [110], [114], [115], [116], [125], [128], [130], [133], [135], [136], [137], [138], [148], [149], [150], [151], [152], [164], [165], [166], [167] [2018-10-22 09:51:46,344 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 09:51:46,344 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 09:51:46,417 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 09:51:46,418 INFO L272 AbstractInterpreter]: Visited 49 different actions 275 times. Merged at 15 different actions 105 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 9 variables. [2018-10-22 09:51:46,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:51:46,453 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 09:51:46,498 INFO L232 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 60.42% of their original sizes. [2018-10-22 09:51:46,498 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 09:51:46,934 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 09:51:46,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 09:51:46,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [7] total 25 [2018-10-22 09:51:46,935 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 09:51:46,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-22 09:51:46,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-22 09:51:46,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-10-22 09:51:46,937 INFO L87 Difference]: Start difference. First operand 149 states and 178 transitions. Second operand 20 states. [2018-10-22 09:51:49,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 09:51:49,820 INFO L93 Difference]: Finished difference Result 187 states and 225 transitions. [2018-10-22 09:51:49,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-22 09:51:49,820 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2018-10-22 09:51:49,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 09:51:49,822 INFO L225 Difference]: With dead ends: 187 [2018-10-22 09:51:49,823 INFO L226 Difference]: Without dead ends: 180 [2018-10-22 09:51:49,825 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=868, Unknown=0, NotChecked=0, Total=1056 [2018-10-22 09:51:49,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-22 09:51:49,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 174. [2018-10-22 09:51:49,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-22 09:51:49,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 208 transitions. [2018-10-22 09:51:49,842 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 208 transitions. Word has length 62 [2018-10-22 09:51:49,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 09:51:49,842 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 208 transitions. [2018-10-22 09:51:49,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-22 09:51:49,842 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 208 transitions. [2018-10-22 09:51:49,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-22 09:51:49,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 09:51:49,845 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 09:51:49,845 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 09:51:49,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:51:49,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1531276929, now seen corresponding path program 1 times [2018-10-22 09:51:49,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 09:51:49,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:51:49,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:51:49,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:51:49,847 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 09:51:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:51:49,988 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-22 09:51:49,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:51:49,988 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 09:51:49,989 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 77 with the following transitions: [2018-10-22 09:51:49,989 INFO L202 CegarAbsIntRunner]: [0], [4], [5], [6], [7], [8], [11], [15], [16], [17], [18], [22], [28], [35], [36], [39], [40], [54], [55], [56], [60], [66], [69], [73], [74], [77], [78], [79], [82], [83], [86], [87], [88], [95], [114], [115], [116], [125], [128], [130], [133], [135], [136], [137], [138], [148], [149], [150], [151], [152], [156], [157], [158], [159], [164], [165], [166], [167] [2018-10-22 09:51:49,991 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 09:51:49,991 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 09:51:50,110 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 09:51:50,111 INFO L272 AbstractInterpreter]: Visited 57 different actions 357 times. Merged at 21 different actions 126 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 10 variables. [2018-10-22 09:51:50,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:51:50,149 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 09:51:50,202 INFO L232 lantSequenceWeakener]: Weakened 32 states. On average, predicates are now at 63.02% of their original sizes. [2018-10-22 09:51:50,203 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 09:51:53,332 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 09:51:53,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 09:51:53,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [7] total 28 [2018-10-22 09:51:53,333 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 09:51:53,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-22 09:51:53,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-22 09:51:53,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2018-10-22 09:51:53,335 INFO L87 Difference]: Start difference. First operand 174 states and 208 transitions. Second operand 23 states. [2018-10-22 09:51:56,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 09:51:56,540 INFO L93 Difference]: Finished difference Result 220 states and 267 transitions. [2018-10-22 09:51:56,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-22 09:51:56,540 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 76 [2018-10-22 09:51:56,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 09:51:56,543 INFO L225 Difference]: With dead ends: 220 [2018-10-22 09:51:56,543 INFO L226 Difference]: Without dead ends: 165 [2018-10-22 09:51:56,544 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 92 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=248, Invalid=1234, Unknown=0, NotChecked=0, Total=1482 [2018-10-22 09:51:56,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-22 09:51:56,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2018-10-22 09:51:56,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-22 09:51:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 191 transitions. [2018-10-22 09:51:56,558 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 191 transitions. Word has length 76 [2018-10-22 09:51:56,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 09:51:56,559 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 191 transitions. [2018-10-22 09:51:56,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-22 09:51:56,559 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 191 transitions. [2018-10-22 09:51:56,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-22 09:51:56,563 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 09:51:56,563 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 09:51:56,563 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 09:51:56,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:51:56,564 INFO L82 PathProgramCache]: Analyzing trace with hash 889873510, now seen corresponding path program 1 times [2018-10-22 09:51:56,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 09:51:56,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:51:56,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:51:56,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:51:56,566 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 09:51:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:51:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 10 proven. 31 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-22 09:51:56,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:51:56,665 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 09:51:56,665 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 80 with the following transitions: [2018-10-22 09:51:56,666 INFO L202 CegarAbsIntRunner]: [0], [4], [5], [6], [7], [8], [11], [15], [16], [17], [18], [22], [28], [35], [36], [39], [40], [42], [43], [46], [47], [48], [54], [55], [56], [60], [66], [73], [74], [77], [78], [79], [82], [83], [86], [87], [88], [91], [125], [128], [130], [133], [135], [136], [137], [138], [144], [145], [146], [147], [148], [149], [150], [151], [156], [157], [158], [159], [160] [2018-10-22 09:51:56,668 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 09:51:56,668 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 09:51:56,816 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 09:51:56,816 INFO L272 AbstractInterpreter]: Visited 58 different actions 528 times. Merged at 33 different actions 215 times. Widened at 2 different actions 5 times. Found 2 fixpoints after 2 different actions. Largest state had 10 variables. [2018-10-22 09:51:56,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:51:56,826 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 09:51:56,912 INFO L232 lantSequenceWeakener]: Weakened 33 states. On average, predicates are now at 62.12% of their original sizes. [2018-10-22 09:51:56,912 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 09:51:57,525 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 09:51:57,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 09:51:57,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [7] total 26 [2018-10-22 09:51:57,526 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 09:51:57,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-22 09:51:57,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-22 09:51:57,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2018-10-22 09:51:57,528 INFO L87 Difference]: Start difference. First operand 161 states and 191 transitions. Second operand 21 states. [2018-10-22 09:51:59,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 09:51:59,720 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2018-10-22 09:51:59,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-22 09:51:59,720 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 79 [2018-10-22 09:51:59,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 09:51:59,723 INFO L225 Difference]: With dead ends: 183 [2018-10-22 09:51:59,723 INFO L226 Difference]: Without dead ends: 179 [2018-10-22 09:51:59,724 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=200, Invalid=990, Unknown=0, NotChecked=0, Total=1190 [2018-10-22 09:51:59,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-22 09:51:59,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 171. [2018-10-22 09:51:59,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-22 09:51:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 202 transitions. [2018-10-22 09:51:59,740 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 202 transitions. Word has length 79 [2018-10-22 09:51:59,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 09:51:59,740 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 202 transitions. [2018-10-22 09:51:59,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-22 09:51:59,740 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 202 transitions. [2018-10-22 09:51:59,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-22 09:51:59,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 09:51:59,743 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 09:51:59,744 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 09:51:59,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:51:59,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1711050258, now seen corresponding path program 1 times [2018-10-22 09:51:59,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 09:51:59,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:51:59,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:51:59,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:51:59,745 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 09:51:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:51:59,833 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 10 proven. 31 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-22 09:51:59,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:51:59,834 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 09:51:59,834 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 82 with the following transitions: [2018-10-22 09:51:59,834 INFO L202 CegarAbsIntRunner]: [0], [4], [5], [6], [7], [8], [11], [15], [16], [17], [18], [22], [28], [35], [36], [39], [40], [42], [43], [46], [47], [48], [54], [55], [56], [60], [66], [69], [73], [74], [101], [102], [103], [109], [110], [114], [115], [116], [125], [128], [130], [133], [135], [136], [137], [138], [144], [145], [146], [147], [148], [149], [150], [151], [152], [164], [165], [166], [167] [2018-10-22 09:51:59,837 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 09:51:59,837 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 09:51:59,941 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 09:51:59,941 INFO L272 AbstractInterpreter]: Visited 58 different actions 528 times. Merged at 32 different actions 209 times. Widened at 2 different actions 5 times. Found 9 fixpoints after 3 different actions. Largest state had 10 variables. [2018-10-22 09:51:59,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:51:59,979 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 09:52:00,027 INFO L232 lantSequenceWeakener]: Weakened 33 states. On average, predicates are now at 62.12% of their original sizes. [2018-10-22 09:52:00,027 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 09:52:00,356 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 09:52:00,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 09:52:00,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [7] total 26 [2018-10-22 09:52:00,357 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 09:52:00,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-22 09:52:00,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-22 09:52:00,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-10-22 09:52:00,359 INFO L87 Difference]: Start difference. First operand 171 states and 202 transitions. Second operand 21 states. [2018-10-22 09:52:04,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 09:52:04,473 INFO L93 Difference]: Finished difference Result 211 states and 251 transitions. [2018-10-22 09:52:04,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-22 09:52:04,473 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 81 [2018-10-22 09:52:04,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 09:52:04,475 INFO L225 Difference]: With dead ends: 211 [2018-10-22 09:52:04,476 INFO L226 Difference]: Without dead ends: 204 [2018-10-22 09:52:04,476 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 98 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=248, Invalid=1158, Unknown=0, NotChecked=0, Total=1406 [2018-10-22 09:52:04,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-10-22 09:52:04,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 171. [2018-10-22 09:52:04,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-22 09:52:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 202 transitions. [2018-10-22 09:52:04,496 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 202 transitions. Word has length 81 [2018-10-22 09:52:04,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 09:52:04,498 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 202 transitions. [2018-10-22 09:52:04,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-22 09:52:04,498 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 202 transitions. [2018-10-22 09:52:04,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-22 09:52:04,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 09:52:04,500 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 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, 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 09:52:04,501 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 09:52:04,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:52:04,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1682308170, now seen corresponding path program 1 times [2018-10-22 09:52:04,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 09:52:04,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:52:04,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:52:04,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:52:04,504 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 09:52:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:52:05,029 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-22 09:52:05,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:52:05,029 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 09:52:05,029 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2018-10-22 09:52:05,030 INFO L202 CegarAbsIntRunner]: [0], [4], [5], [6], [7], [8], [11], [15], [16], [17], [18], [22], [28], [35], [36], [39], [40], [54], [55], [56], [60], [66], [73], [74], [77], [78], [79], [82], [83], [86], [87], [88], [91], [101], [102], [103], [109], [110], [114], [115], [116], [125], [128], [130], [133], [135], [136], [137], [138], [148], [149], [150], [151], [156], [157], [158], [159], [160], [164], [165], [166], [167] [2018-10-22 09:52:05,033 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 09:52:05,035 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 09:52:05,135 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 09:52:05,136 INFO L272 AbstractInterpreter]: Visited 61 different actions 435 times. Merged at 25 different actions 175 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 11 variables. [2018-10-22 09:52:05,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:52:05,174 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 09:52:05,230 INFO L232 lantSequenceWeakener]: Weakened 34 states. On average, predicates are now at 61.27% of their original sizes. [2018-10-22 09:52:05,232 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 09:52:05,820 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 09:52:05,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 09:52:05,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [7] total 27 [2018-10-22 09:52:05,820 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 09:52:05,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-22 09:52:05,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-22 09:52:05,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2018-10-22 09:52:05,821 INFO L87 Difference]: Start difference. First operand 171 states and 202 transitions. Second operand 22 states. [2018-10-22 09:52:09,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 09:52:09,565 INFO L93 Difference]: Finished difference Result 238 states and 285 transitions. [2018-10-22 09:52:09,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-22 09:52:09,565 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 82 [2018-10-22 09:52:09,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 09:52:09,568 INFO L225 Difference]: With dead ends: 238 [2018-10-22 09:52:09,568 INFO L226 Difference]: Without dead ends: 148 [2018-10-22 09:52:09,569 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 99 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=226, Invalid=1256, Unknown=0, NotChecked=0, Total=1482 [2018-10-22 09:52:09,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-22 09:52:09,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-10-22 09:52:09,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-22 09:52:09,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 172 transitions. [2018-10-22 09:52:09,580 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 172 transitions. Word has length 82 [2018-10-22 09:52:09,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 09:52:09,581 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 172 transitions. [2018-10-22 09:52:09,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-22 09:52:09,582 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 172 transitions. [2018-10-22 09:52:09,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-22 09:52:09,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 09:52:09,584 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 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, 1, 1, 1, 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 09:52:09,584 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 09:52:09,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:52:09,585 INFO L82 PathProgramCache]: Analyzing trace with hash -181275134, now seen corresponding path program 1 times [2018-10-22 09:52:09,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 09:52:09,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:52:09,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:52:09,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:52:09,587 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 09:52:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:52:09,701 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 14 proven. 43 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-22 09:52:09,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:52:09,702 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 09:52:09,702 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 96 with the following transitions: [2018-10-22 09:52:09,702 INFO L202 CegarAbsIntRunner]: [0], [4], [5], [6], [7], [8], [11], [15], [16], [17], [18], [22], [28], [35], [36], [39], [40], [42], [43], [46], [47], [48], [54], [55], [56], [60], [66], [69], [73], [74], [77], [78], [79], [82], [83], [86], [87], [88], [95], [114], [115], [116], [125], [128], [130], [133], [135], [136], [137], [138], [144], [145], [146], [147], [148], [149], [150], [151], [152], [156], [157], [158], [159], [164], [165], [166], [167] [2018-10-22 09:52:09,705 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 09:52:09,705 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 09:52:09,831 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 09:52:09,832 INFO L272 AbstractInterpreter]: Visited 66 different actions 640 times. Merged at 39 different actions 245 times. Widened at 3 different actions 5 times. Found 9 fixpoints after 3 different actions. Largest state had 11 variables. [2018-10-22 09:52:09,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:52:09,871 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 09:52:09,925 INFO L232 lantSequenceWeakener]: Weakened 41 states. On average, predicates are now at 63.82% of their original sizes. [2018-10-22 09:52:09,926 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 09:52:11,395 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 09:52:11,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 09:52:11,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [7] total 29 [2018-10-22 09:52:11,396 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 09:52:11,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-22 09:52:11,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-22 09:52:11,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2018-10-22 09:52:11,398 INFO L87 Difference]: Start difference. First operand 146 states and 172 transitions. Second operand 24 states. [2018-10-22 09:52:16,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 09:52:16,596 INFO L93 Difference]: Finished difference Result 192 states and 231 transitions. [2018-10-22 09:52:16,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-22 09:52:16,597 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 95 [2018-10-22 09:52:16,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 09:52:16,599 INFO L225 Difference]: With dead ends: 192 [2018-10-22 09:52:16,599 INFO L226 Difference]: Without dead ends: 137 [2018-10-22 09:52:16,601 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 114 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=306, Invalid=1500, Unknown=0, NotChecked=0, Total=1806 [2018-10-22 09:52:16,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-22 09:52:16,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2018-10-22 09:52:16,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-22 09:52:16,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2018-10-22 09:52:16,611 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 95 [2018-10-22 09:52:16,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 09:52:16,612 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2018-10-22 09:52:16,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-22 09:52:16,612 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2018-10-22 09:52:16,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-22 09:52:16,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 09:52:16,615 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 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, 1, 1, 1, 1, 1, 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 09:52:16,615 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 09:52:16,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:52:16,617 INFO L82 PathProgramCache]: Analyzing trace with hash 636036727, now seen corresponding path program 1 times [2018-10-22 09:52:16,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 09:52:16,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:52:16,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:52:16,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:52:16,619 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 09:52:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:52:17,139 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 14 proven. 43 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-10-22 09:52:17,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:52:17,140 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 09:52:17,140 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 102 with the following transitions: [2018-10-22 09:52:17,140 INFO L202 CegarAbsIntRunner]: [0], [4], [5], [6], [7], [8], [11], [15], [16], [17], [18], [22], [28], [35], [36], [39], [40], [42], [43], [46], [47], [48], [54], [55], [56], [60], [66], [73], [74], [77], [78], [79], [82], [83], [86], [87], [88], [91], [101], [102], [103], [109], [110], [114], [115], [116], [125], [128], [130], [133], [135], [136], [137], [138], [144], [145], [146], [147], [148], [149], [150], [151], [156], [157], [158], [159], [160], [164], [165], [166], [167] [2018-10-22 09:52:17,141 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 09:52:17,142 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 09:52:17,289 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 09:52:17,290 INFO L272 AbstractInterpreter]: Visited 70 different actions 668 times. Merged at 42 different actions 269 times. Widened at 2 different actions 5 times. Found 9 fixpoints after 3 different actions. Largest state had 12 variables. [2018-10-22 09:52:17,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:52:17,328 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 09:52:17,391 INFO L232 lantSequenceWeakener]: Weakened 43 states. On average, predicates are now at 62.4% of their original sizes. [2018-10-22 09:52:17,392 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 09:52:21,122 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 09:52:21,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 09:52:21,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [7] total 28 [2018-10-22 09:52:21,123 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 09:52:21,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-22 09:52:21,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-22 09:52:21,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2018-10-22 09:52:21,124 INFO L87 Difference]: Start difference. First operand 133 states and 155 transitions. Second operand 23 states. [2018-10-22 09:52:23,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 09:52:23,566 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2018-10-22 09:52:23,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-22 09:52:23,567 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 101 [2018-10-22 09:52:23,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 09:52:23,568 INFO L225 Difference]: With dead ends: 137 [2018-10-22 09:52:23,568 INFO L226 Difference]: Without dead ends: 0 [2018-10-22 09:52:23,569 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 120 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=274, Invalid=1448, Unknown=0, NotChecked=0, Total=1722 [2018-10-22 09:52:23,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-22 09:52:23,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-22 09:52:23,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-22 09:52:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-22 09:52:23,570 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2018-10-22 09:52:23,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 09:52:23,570 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-22 09:52:23,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-22 09:52:23,570 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-22 09:52:23,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-22 09:52:23,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-22 09:52:23,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 09:52:23,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 09:52:23,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 09:52:23,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 09:52:23,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 09:52:23,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 09:52:23,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 09:52:23,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 09:52:23,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 09:52:23,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 09:52:24,641 WARN L179 SmtUtils]: Spent 771.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 12 [2018-10-22 09:52:24,887 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 11 [2018-10-22 09:52:25,049 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 13 [2018-10-22 09:52:25,258 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 10 [2018-10-22 09:52:25,887 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-22 09:52:25,888 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-22 09:52:25,888 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-22 09:52:25,888 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-22 09:52:25,888 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-22 09:52:25,888 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-22 09:52:25,888 INFO L428 ceAbstractionStarter]: At program point L60(lines 11 63) the Hoare annotation is: true [2018-10-22 09:52:25,888 INFO L421 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (<= 0 (* 2 main_~t~0)) (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= (* 2 main_~tagbuf_len~0) 4294967292)) [2018-10-22 09:52:25,889 INFO L421 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (and (<= 0 (* 2 main_~t~0)) (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= (* 2 main_~tagbuf_len~0) 4294967292)) [2018-10-22 09:52:25,889 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 63) no Hoare annotation was computed. [2018-10-22 09:52:25,889 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-10-22 09:52:25,889 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 23) no Hoare annotation was computed. [2018-10-22 09:52:25,889 INFO L425 ceAbstractionStarter]: For program point L52-1(lines 52 54) no Hoare annotation was computed. [2018-10-22 09:52:25,889 INFO L425 ceAbstractionStarter]: For program point L52-2(line 52) no Hoare annotation was computed. [2018-10-22 09:52:25,889 INFO L425 ceAbstractionStarter]: For program point L52-3(line 52) no Hoare annotation was computed. [2018-10-22 09:52:25,889 INFO L425 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2018-10-22 09:52:25,889 INFO L425 ceAbstractionStarter]: For program point L44-1(line 44) no Hoare annotation was computed. [2018-10-22 09:52:25,889 INFO L421 ceAbstractionStarter]: At program point L36(line 36) the Hoare annotation is: (and (<= 2 (* 2 main_~t~0)) (<= (* 2 main_~tagbuf_len~0) 4294967292) (<= main_~t~0 main_~tagbuf_len~0)) [2018-10-22 09:52:25,890 INFO L421 ceAbstractionStarter]: At program point L36-1(line 36) the Hoare annotation is: (and (<= 2 (* 2 main_~t~0)) (<= (* 2 main_~tagbuf_len~0) 4294967292) (<= main_~t~0 main_~tagbuf_len~0)) [2018-10-22 09:52:25,892 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-10-22 09:52:25,892 INFO L421 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (let ((.cse0 (* 2 main_~tagbuf_len~0))) (or (and (<= (+ main_~tagbuf_len~0 main_~t~0) 0) (<= main_~tagbuf_len~0 main_~t~0) (<= 0 .cse0)) (and (<= 2 (* 2 main_~t~0)) (<= .cse0 4294967292) (<= main_~t~0 main_~tagbuf_len~0)))) [2018-10-22 09:52:25,892 INFO L421 ceAbstractionStarter]: At program point L20-1(line 20) the Hoare annotation is: (let ((.cse0 (* 2 main_~tagbuf_len~0))) (or (and (<= (+ main_~tagbuf_len~0 main_~t~0) 0) (<= main_~tagbuf_len~0 main_~t~0) (<= 0 .cse0)) (and (<= 2 (* 2 main_~t~0)) (<= .cse0 4294967292) (<= main_~t~0 main_~tagbuf_len~0)))) [2018-10-22 09:52:25,892 INFO L425 ceAbstractionStarter]: For program point L45(lines 45 49) no Hoare annotation was computed. [2018-10-22 09:52:25,892 INFO L425 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-10-22 09:52:25,892 INFO L425 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2018-10-22 09:52:25,892 INFO L421 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: (and (<= (* 2 main_~tagbuf_len~0) 4294967292) (<= main_~t~0 main_~tagbuf_len~0) (<= 4 (* 2 main_~t~0))) [2018-10-22 09:52:25,892 INFO L425 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-10-22 09:52:25,893 INFO L421 ceAbstractionStarter]: At program point L46-1(line 46) the Hoare annotation is: (and (<= (* 2 main_~tagbuf_len~0) 4294967292) (<= main_~t~0 main_~tagbuf_len~0) (<= 4 (* 2 main_~t~0))) [2018-10-22 09:52:25,893 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 63) no Hoare annotation was computed. [2018-10-22 09:52:25,894 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 63) the Hoare annotation is: true [2018-10-22 09:52:25,894 INFO L421 ceAbstractionStarter]: At program point L55(line 55) the Hoare annotation is: (and (<= 2 (* 2 main_~t~0)) (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= (* 2 main_~tagbuf_len~0) 4294967292)) [2018-10-22 09:52:25,894 INFO L425 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-10-22 09:52:25,894 INFO L425 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-10-22 09:52:25,894 INFO L425 ceAbstractionStarter]: For program point L14-2(line 14) no Hoare annotation was computed. [2018-10-22 09:52:25,894 INFO L421 ceAbstractionStarter]: At program point L31(line 31) the Hoare annotation is: (and (<= 0 (* 2 main_~t~0)) (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= (* 2 main_~tagbuf_len~0) 4294967292)) [2018-10-22 09:52:25,894 INFO L425 ceAbstractionStarter]: For program point L56(line 56) no Hoare annotation was computed. [2018-10-22 09:52:25,894 INFO L425 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-10-22 09:52:25,895 INFO L425 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2018-10-22 09:52:25,895 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-10-22 09:52:25,895 INFO L425 ceAbstractionStarter]: For program point L40-1(lines 40 54) no Hoare annotation was computed. [2018-10-22 09:52:25,895 INFO L425 ceAbstractionStarter]: For program point L40-2(line 40) no Hoare annotation was computed. [2018-10-22 09:52:25,895 INFO L425 ceAbstractionStarter]: For program point L40-3(line 40) no Hoare annotation was computed. [2018-10-22 09:52:25,895 INFO L421 ceAbstractionStarter]: At program point L40-4(lines 40 54) the Hoare annotation is: (and (<= 2 (* 2 main_~t~0)) (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= (* 2 main_~tagbuf_len~0) 4294967292)) [2018-10-22 09:52:25,895 INFO L425 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2018-10-22 09:52:25,895 INFO L425 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-10-22 09:52:25,895 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-10-22 09:52:25,895 INFO L425 ceAbstractionStarter]: For program point L57-1(line 57) no Hoare annotation was computed. [2018-10-22 09:52:25,895 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 24 26) no Hoare annotation was computed. [2018-10-22 09:52:25,896 INFO L425 ceAbstractionStarter]: For program point L24-2(line 24) no Hoare annotation was computed. [2018-10-22 09:52:25,896 INFO L425 ceAbstractionStarter]: For program point L24-3(line 24) no Hoare annotation was computed. [2018-10-22 09:52:25,896 INFO L425 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-10-22 09:52:25,896 INFO L425 ceAbstractionStarter]: For program point L41-1(lines 41 50) no Hoare annotation was computed. [2018-10-22 09:52:25,896 INFO L425 ceAbstractionStarter]: For program point L41-2(line 41) no Hoare annotation was computed. [2018-10-22 09:52:25,896 INFO L425 ceAbstractionStarter]: For program point L41-4(line 41) no Hoare annotation was computed. [2018-10-22 09:52:25,896 INFO L425 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-10-22 09:52:25,896 INFO L425 ceAbstractionStarter]: For program point L33-1(line 33) no Hoare annotation was computed. [2018-10-22 09:52:25,896 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-10-22 09:52:25,896 INFO L425 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2018-10-22 09:52:25,896 INFO L425 ceAbstractionStarter]: For program point L17-2(line 17) no Hoare annotation was computed. [2018-10-22 09:52:25,897 INFO L421 ceAbstractionStarter]: At program point L42(line 42) the Hoare annotation is: (and (<= 2 (* 2 main_~t~0)) (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= (* 2 main_~tagbuf_len~0) 4294967292)) [2018-10-22 09:52:25,897 INFO L421 ceAbstractionStarter]: At program point L42-1(line 42) the Hoare annotation is: (and (<= 2 (* 2 main_~t~0)) (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= (* 2 main_~tagbuf_len~0) 4294967292)) [2018-10-22 09:52:25,897 INFO L425 ceAbstractionStarter]: For program point L34-1(lines 34 58) no Hoare annotation was computed. [2018-10-22 09:52:25,897 INFO L421 ceAbstractionStarter]: At program point L34-3(lines 34 58) the Hoare annotation is: (and (<= 2 (* 2 main_~t~0)) (<= (* 2 main_~tagbuf_len~0) 4294967292) (<= main_~t~0 main_~tagbuf_len~0)) [2018-10-22 09:52:25,897 INFO L421 ceAbstractionStarter]: At program point L34-4(lines 34 58) the Hoare annotation is: (let ((.cse0 (* 2 main_~tagbuf_len~0))) (or (and (= main_~t~0 1) (<= 2 .cse0) (<= main_~tagbuf_len~0 (+ main_~t~0 2147483645))) (and (<= 2 (* 2 main_~t~0)) (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= .cse0 4294967292)))) [2018-10-22 09:52:25,897 INFO L421 ceAbstractionStarter]: At program point L59(line 59) the Hoare annotation is: (let ((.cse0 (* 2 main_~tagbuf_len~0))) (or (and (= main_~t~0 1) (<= 2 .cse0) (<= main_~tagbuf_len~0 (+ main_~t~0 2147483645))) (and (<= 2 (* 2 main_~t~0)) (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= .cse0 4294967292)))) [2018-10-22 09:52:25,897 INFO L425 ceAbstractionStarter]: For program point L18-1(lines 18 30) no Hoare annotation was computed. [2018-10-22 09:52:25,897 INFO L421 ceAbstractionStarter]: At program point L18-3(lines 18 30) the Hoare annotation is: (and (<= (* 2 main_~tagbuf_len~0) 4294967292) (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2018-10-22 09:52:25,898 INFO L421 ceAbstractionStarter]: At program point L18-4(lines 18 30) the Hoare annotation is: (and (<= 0 (* 2 main_~t~0)) (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= (* 2 main_~tagbuf_len~0) 4294967292)) [2018-10-22 09:52:25,903 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-10-22 09:52:25,903 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 39) no Hoare annotation was computed. [2018-10-22 09:52:25,903 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-10-22 09:52:25,903 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-10-22 09:52:25,903 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-10-22 09:52:25,904 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-10-22 09:52:25,904 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-10-22 09:52:25,904 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-10-22 09:52:25,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:52:25 BoogieIcfgContainer [2018-10-22 09:52:25,917 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-22 09:52:25,917 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-22 09:52:25,917 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-22 09:52:25,917 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-22 09:52:25,918 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:51:28" (3/4) ... [2018-10-22 09:52:25,922 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-22 09:52:25,928 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-22 09:52:25,928 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-22 09:52:25,928 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-10-22 09:52:25,934 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-10-22 09:52:25,934 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-10-22 09:52:25,934 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-22 09:52:26,000 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/witness.graphml [2018-10-22 09:52:26,001 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-22 09:52:26,005 INFO L168 Benchmark]: Toolchain (without parser) took 58631.79 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 475.0 MB). Free memory was 953.2 MB in the beginning and 1.0 GB in the end (delta: -64.9 MB). Peak memory consumption was 410.1 MB. Max. memory is 11.5 GB. [2018-10-22 09:52:26,006 INFO L168 Benchmark]: CDTParser took 0.20 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 09:52:26,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.99 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-22 09:52:26,008 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.27 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-22 09:52:26,008 INFO L168 Benchmark]: Boogie Preprocessor took 26.38 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-22 09:52:26,009 INFO L168 Benchmark]: RCFGBuilder took 631.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2018-10-22 09:52:26,010 INFO L168 Benchmark]: TraceAbstraction took 57573.51 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 324.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.0 MB). Peak memory consumption was 419.5 MB. Max. memory is 11.5 GB. [2018-10-22 09:52:26,012 INFO L168 Benchmark]: Witness Printer took 83.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-10-22 09:52:26,016 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.20 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 292.99 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 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 19.27 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.38 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 631.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 57573.51 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 324.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.0 MB). Peak memory consumption was 419.5 MB. Max. memory is 11.5 GB. * Witness Printer took 83.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. 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: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (2 * tagbuf_len <= 4294967292 && t <= tagbuf_len) && 0 <= t - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (2 <= 2 * t && 2 * tagbuf_len <= 4294967292) && t <= tagbuf_len - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 76 locations, 1 error locations. SAFE Result, 57.4s OverallTime, 14 OverallIterations, 9 TraceHistogramMax, 37.6s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1101 SDtfs, 2366 SDslu, 7819 SDs, 0 SdLazy, 3095 SolverSat, 739 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 24 DeclaredPredicates, 958 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2100 ImplicationChecksByTransitivity, 16.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.6s AbstIntTime, 12 AbstIntIterations, 12 AbstIntStrong, 0.9192461460522247 AbsIntWeakeningRatio, 0.43346007604562736 AbsIntAvgWeakeningVarsNumRemoved, 3.3929024081115338 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 113 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 135 PreInvPairs, 228 NumberOfFragments, 336 HoareAnnotationTreeSize, 135 FomulaSimplifications, 5981 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 24 FomulaSimplificationsInter, 2856 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 841 NumberOfCodeBlocks, 841 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 827 ConstructedInterpolants, 0 QuantifiedInterpolants, 136413 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 453/708 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...