./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e2be4508-668a-427e-a278-07e94a5465dd/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e2be4508-668a-427e-a278-07e94a5465dd/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e2be4508-668a-427e-a278-07e94a5465dd/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e2be4508-668a-427e-a278-07e94a5465dd/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e2be4508-668a-427e-a278-07e94a5465dd/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e2be4508-668a-427e-a278-07e94a5465dd/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e55536c26dc3d2371d51cd4bd073d4d19c2d7077 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 04:13:39,796 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:13:39,797 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:13:39,804 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:13:39,804 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:13:39,805 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:13:39,806 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:13:39,807 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:13:39,809 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:13:39,809 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:13:39,810 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:13:39,810 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:13:39,811 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:13:39,812 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:13:39,812 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:13:39,813 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:13:39,813 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:13:39,815 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:13:39,816 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:13:39,817 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:13:39,818 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:13:39,819 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:13:39,821 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:13:39,821 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:13:39,821 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:13:39,822 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:13:39,823 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:13:39,823 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:13:39,824 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:13:39,825 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:13:39,825 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:13:39,825 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:13:39,825 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:13:39,826 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:13:39,826 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:13:39,827 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:13:39,827 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e2be4508-668a-427e-a278-07e94a5465dd/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 04:13:39,837 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:13:39,837 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:13:39,838 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 04:13:39,838 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 04:13:39,838 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 04:13:39,838 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 04:13:39,839 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 04:13:39,839 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 04:13:39,839 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 04:13:39,839 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 04:13:39,839 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 04:13:39,840 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:13:39,840 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:13:39,840 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:13:39,840 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:13:39,840 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:13:39,841 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 04:13:39,841 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 04:13:39,841 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 04:13:39,841 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:13:39,841 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:13:39,841 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 04:13:39,841 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:13:39,842 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:13:39,842 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 04:13:39,842 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 04:13:39,842 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 04:13:39,842 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:13:39,842 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 04:13:39,843 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 04:13:39,843 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 04:13:39,843 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 04:13:39,843 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 04:13:39,843 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 04:13:39,843 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_e2be4508-668a-427e-a278-07e94a5465dd/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e55536c26dc3d2371d51cd4bd073d4d19c2d7077 [2018-11-10 04:13:39,867 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:13:39,877 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:13:39,880 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:13:39,881 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:13:39,881 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:13:39,882 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e2be4508-668a-427e-a278-07e94a5465dd/bin-2019/utaipan/../../sv-benchmarks/c/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-11-10 04:13:39,925 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e2be4508-668a-427e-a278-07e94a5465dd/bin-2019/utaipan/data/e92c06883/a77152c4c23b47d4965695118569f616/FLAG3df2fcae1 [2018-11-10 04:13:40,267 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:13:40,267 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e2be4508-668a-427e-a278-07e94a5465dd/sv-benchmarks/c/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-11-10 04:13:40,274 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e2be4508-668a-427e-a278-07e94a5465dd/bin-2019/utaipan/data/e92c06883/a77152c4c23b47d4965695118569f616/FLAG3df2fcae1 [2018-11-10 04:13:40,284 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e2be4508-668a-427e-a278-07e94a5465dd/bin-2019/utaipan/data/e92c06883/a77152c4c23b47d4965695118569f616 [2018-11-10 04:13:40,286 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:13:40,287 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:13:40,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:13:40,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:13:40,290 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:13:40,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:13:40" (1/1) ... [2018-11-10 04:13:40,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf9e623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:13:40, skipping insertion in model container [2018-11-10 04:13:40,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:13:40" (1/1) ... [2018-11-10 04:13:40,299 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:13:40,323 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:13:40,438 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:13:40,441 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:13:40,466 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:13:40,477 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:13:40,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:13:40 WrapperNode [2018-11-10 04:13:40,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:13:40,478 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:13:40,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:13:40,478 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:13:40,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:13:40" (1/1) ... [2018-11-10 04:13:40,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:13:40" (1/1) ... [2018-11-10 04:13:40,493 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:13:40,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:13:40,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:13:40,494 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:13:40,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:13:40" (1/1) ... [2018-11-10 04:13:40,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:13:40" (1/1) ... [2018-11-10 04:13:40,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:13:40" (1/1) ... [2018-11-10 04:13:40,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:13:40" (1/1) ... [2018-11-10 04:13:40,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:13:40" (1/1) ... [2018-11-10 04:13:40,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:13:40" (1/1) ... [2018-11-10 04:13:40,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:13:40" (1/1) ... [2018-11-10 04:13:40,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:13:40,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:13:40,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:13:40,513 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:13:40,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:13:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e2be4508-668a-427e-a278-07e94a5465dd/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 04:13:40,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 04:13:40,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 04:13:40,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:13:40,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:13:40,598 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 04:13:40,598 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 04:13:40,908 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:13:40,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:13:40 BoogieIcfgContainer [2018-11-10 04:13:40,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:13:40,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 04:13:40,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 04:13:40,912 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 04:13:40,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:13:40" (1/3) ... [2018-11-10 04:13:40,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785ed633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:13:40, skipping insertion in model container [2018-11-10 04:13:40,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:13:40" (2/3) ... [2018-11-10 04:13:40,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785ed633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:13:40, skipping insertion in model container [2018-11-10 04:13:40,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:13:40" (3/3) ... [2018-11-10 04:13:40,915 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-11-10 04:13:40,921 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 04:13:40,928 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2018-11-10 04:13:40,938 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2018-11-10 04:13:40,962 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 04:13:40,962 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 04:13:40,962 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 04:13:40,962 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:13:40,963 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:13:40,963 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 04:13:40,963 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:13:40,963 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 04:13:40,977 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2018-11-10 04:13:40,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 04:13:40,982 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:13:40,983 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-11-10 04:13:40,985 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:13:40,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:40,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1637525138, now seen corresponding path program 1 times [2018-11-10 04:13:40,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:13:41,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:41,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:13:41,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:41,025 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:13:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:13:41,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:13:41,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:13:41,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:13:41,116 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:13:41,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:13:41,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:13:41,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:13:41,130 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2018-11-10 04:13:41,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:13:41,156 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2018-11-10 04:13:41,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:13:41,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-10 04:13:41,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:13:41,164 INFO L225 Difference]: With dead ends: 93 [2018-11-10 04:13:41,164 INFO L226 Difference]: Without dead ends: 80 [2018-11-10 04:13:41,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:13:41,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-10 04:13:41,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-10 04:13:41,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-10 04:13:41,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-11-10 04:13:41,195 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2018-11-10 04:13:41,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:13:41,195 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-11-10 04:13:41,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:13:41,196 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-11-10 04:13:41,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 04:13:41,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:13:41,196 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] [2018-11-10 04:13:41,197 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:13:41,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:41,197 INFO L82 PathProgramCache]: Analyzing trace with hash 776331368, now seen corresponding path program 1 times [2018-11-10 04:13:41,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:13:41,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:41,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:13:41,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:41,199 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:13:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:13:41,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:13:41,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:13:41,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 04:13:41,299 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:13:41,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 04:13:41,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 04:13:41,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:13:41,301 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 6 states. [2018-11-10 04:13:41,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:13:41,384 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-11-10 04:13:41,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:13:41,384 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-10 04:13:41,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:13:41,385 INFO L225 Difference]: With dead ends: 80 [2018-11-10 04:13:41,385 INFO L226 Difference]: Without dead ends: 78 [2018-11-10 04:13:41,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 04:13:41,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-10 04:13:41,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-10 04:13:41,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-10 04:13:41,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-11-10 04:13:41,393 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2018-11-10 04:13:41,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:13:41,393 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-11-10 04:13:41,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 04:13:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-11-10 04:13:41,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 04:13:41,394 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:13:41,394 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, 1] [2018-11-10 04:13:41,394 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:13:41,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:41,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1269768629, now seen corresponding path program 1 times [2018-11-10 04:13:41,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:13:41,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:41,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:13:41,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:41,396 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:13:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:13:41,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:13:41,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:13:41,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:13:41,439 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:13:41,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:13:41,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:13:41,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:13:41,440 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 5 states. [2018-11-10 04:13:41,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:13:41,545 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-11-10 04:13:41,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:13:41,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-10 04:13:41,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:13:41,546 INFO L225 Difference]: With dead ends: 116 [2018-11-10 04:13:41,547 INFO L226 Difference]: Without dead ends: 114 [2018-11-10 04:13:41,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:13:41,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-10 04:13:41,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 76. [2018-11-10 04:13:41,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-10 04:13:41,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-11-10 04:13:41,554 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2018-11-10 04:13:41,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:13:41,554 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-11-10 04:13:41,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:13:41,554 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-11-10 04:13:41,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 04:13:41,555 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:13:41,555 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, 1, 1] [2018-11-10 04:13:41,555 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:13:41,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:41,556 INFO L82 PathProgramCache]: Analyzing trace with hash -708118726, now seen corresponding path program 1 times [2018-11-10 04:13:41,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:13:41,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:41,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:13:41,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:41,557 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:13:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:13:41,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:13:41,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:13:41,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 04:13:41,608 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:13:41,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 04:13:41,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 04:13:41,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:13:41,608 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2018-11-10 04:13:41,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:13:41,683 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-11-10 04:13:41,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:13:41,684 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-10 04:13:41,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:13:41,685 INFO L225 Difference]: With dead ends: 76 [2018-11-10 04:13:41,685 INFO L226 Difference]: Without dead ends: 74 [2018-11-10 04:13:41,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:13:41,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-10 04:13:41,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-10 04:13:41,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-10 04:13:41,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-11-10 04:13:41,691 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2018-11-10 04:13:41,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:13:41,691 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-11-10 04:13:41,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 04:13:41,691 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-10 04:13:41,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 04:13:41,692 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:13:41,692 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, 1, 1, 1, 1, 1] [2018-11-10 04:13:41,692 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:13:41,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:41,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1317531748, now seen corresponding path program 1 times [2018-11-10 04:13:41,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:13:41,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:41,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:13:41,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:41,694 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:13:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:13:41,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:13:41,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:13:41,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:13:41,760 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:13:41,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:13:41,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:13:41,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:13:41,761 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2018-11-10 04:13:41,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:13:41,863 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2018-11-10 04:13:41,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:13:41,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-10 04:13:41,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:13:41,864 INFO L225 Difference]: With dead ends: 141 [2018-11-10 04:13:41,865 INFO L226 Difference]: Without dead ends: 139 [2018-11-10 04:13:41,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 04:13:41,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-10 04:13:41,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2018-11-10 04:13:41,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-10 04:13:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-11-10 04:13:41,874 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2018-11-10 04:13:41,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:13:41,874 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-11-10 04:13:41,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:13:41,874 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-11-10 04:13:41,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 04:13:41,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:13:41,875 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, 1, 1, 1, 1, 1] [2018-11-10 04:13:41,876 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:13:41,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:41,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1321265557, now seen corresponding path program 1 times [2018-11-10 04:13:41,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:13:41,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:41,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:13:41,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:41,877 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:13:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:13:41,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:13:41,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:13:41,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:13:41,921 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:13:41,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:13:41,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:13:41,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:13:41,922 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2018-11-10 04:13:42,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:13:42,039 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2018-11-10 04:13:42,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:13:42,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-10 04:13:42,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:13:42,040 INFO L225 Difference]: With dead ends: 108 [2018-11-10 04:13:42,040 INFO L226 Difference]: Without dead ends: 106 [2018-11-10 04:13:42,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 04:13:42,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-10 04:13:42,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2018-11-10 04:13:42,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-10 04:13:42,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-11-10 04:13:42,047 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2018-11-10 04:13:42,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:13:42,047 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-11-10 04:13:42,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:13:42,048 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-11-10 04:13:42,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 04:13:42,048 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:13:42,048 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, 1, 1, 1, 1, 1, 1] [2018-11-10 04:13:42,049 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:13:42,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:42,049 INFO L82 PathProgramCache]: Analyzing trace with hash -2106185532, now seen corresponding path program 1 times [2018-11-10 04:13:42,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:13:42,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:42,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:13:42,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:42,051 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:13:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:13:42,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:13:42,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:13:42,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:13:42,087 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:13:42,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:13:42,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:13:42,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:13:42,088 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 5 states. [2018-11-10 04:13:42,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:13:42,170 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2018-11-10 04:13:42,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:13:42,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-10 04:13:42,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:13:42,171 INFO L225 Difference]: With dead ends: 121 [2018-11-10 04:13:42,171 INFO L226 Difference]: Without dead ends: 119 [2018-11-10 04:13:42,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:13:42,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-10 04:13:42,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2018-11-10 04:13:42,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-10 04:13:42,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-11-10 04:13:42,179 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2018-11-10 04:13:42,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:13:42,179 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-11-10 04:13:42,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:13:42,179 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-11-10 04:13:42,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 04:13:42,180 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:13:42,180 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, 1, 1, 1, 1, 1, 1] [2018-11-10 04:13:42,180 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:13:42,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:42,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1990437563, now seen corresponding path program 1 times [2018-11-10 04:13:42,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:13:42,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:42,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:13:42,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:42,182 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:13:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:13:42,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:13:42,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:13:42,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:13:42,219 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:13:42,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:13:42,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:13:42,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:13:42,220 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2018-11-10 04:13:42,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:13:42,289 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-11-10 04:13:42,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:13:42,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-10 04:13:42,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:13:42,291 INFO L225 Difference]: With dead ends: 77 [2018-11-10 04:13:42,291 INFO L226 Difference]: Without dead ends: 75 [2018-11-10 04:13:42,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:13:42,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-10 04:13:42,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-10 04:13:42,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 04:13:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-11-10 04:13:42,297 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2018-11-10 04:13:42,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:13:42,298 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-11-10 04:13:42,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:13:42,298 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-11-10 04:13:42,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 04:13:42,299 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:13:42,299 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:13:42,300 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:13:42,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:42,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1549950965, now seen corresponding path program 1 times [2018-11-10 04:13:42,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:13:42,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:42,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:13:42,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:42,302 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:13:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:13:42,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:13:42,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:13:42,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:13:42,322 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:13:42,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:13:42,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:13:42,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:13:42,323 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 3 states. [2018-11-10 04:13:42,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:13:42,357 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-11-10 04:13:42,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:13:42,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 04:13:42,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:13:42,358 INFO L225 Difference]: With dead ends: 115 [2018-11-10 04:13:42,358 INFO L226 Difference]: Without dead ends: 75 [2018-11-10 04:13:42,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:13:42,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-10 04:13:42,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-10 04:13:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 04:13:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-11-10 04:13:42,364 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2018-11-10 04:13:42,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:13:42,365 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-11-10 04:13:42,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:13:42,365 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-11-10 04:13:42,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 04:13:42,366 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:13:42,366 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:13:42,366 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:13:42,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:42,367 INFO L82 PathProgramCache]: Analyzing trace with hash 54388864, now seen corresponding path program 1 times [2018-11-10 04:13:42,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:13:42,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:42,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:13:42,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:42,368 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:13:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:13:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:13:42,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:13:42,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:13:42,410 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:13:42,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:13:42,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:13:42,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:13:42,411 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 7 states. [2018-11-10 04:13:42,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:13:42,473 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-11-10 04:13:42,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:13:42,474 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-10 04:13:42,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:13:42,474 INFO L225 Difference]: With dead ends: 76 [2018-11-10 04:13:42,474 INFO L226 Difference]: Without dead ends: 74 [2018-11-10 04:13:42,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-11-10 04:13:42,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-10 04:13:42,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-11-10 04:13:42,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-10 04:13:42,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-11-10 04:13:42,480 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2018-11-10 04:13:42,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:13:42,480 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-11-10 04:13:42,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:13:42,480 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-11-10 04:13:42,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 04:13:42,480 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:13:42,481 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 04:13:42,481 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:13:42,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:42,481 INFO L82 PathProgramCache]: Analyzing trace with hash -196719107, now seen corresponding path program 1 times [2018-11-10 04:13:42,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:13:42,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:42,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:13:42,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:42,482 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:13:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:13:42,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 04:13:42,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:13:42,540 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 04:13:42,540 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-11-10 04:13:42,541 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [17], [21], [25], [29], [32], [35], [38], [42], [46], [52], [58], [61], [67], [73], [77], [192], [195], [196], [198], [204], [214], [215], [216] [2018-11-10 04:13:42,581 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 04:13:42,581 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 04:13:43,211 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 04:13:43,213 INFO L272 AbstractInterpreter]: Visited 27 different actions 52 times. Merged at 4 different actions 20 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-11-10 04:13:43,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:43,223 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 04:13:43,449 INFO L227 lantSequenceWeakener]: Weakened 28 states. On average, predicates are now at 77.33% of their original sizes. [2018-11-10 04:13:43,449 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 04:13:43,940 INFO L415 sIntCurrentIteration]: We unified 29 AI predicates to 29 [2018-11-10 04:13:43,940 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 04:13:43,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:13:43,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [7] total 28 [2018-11-10 04:13:43,941 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:13:43,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 04:13:43,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 04:13:43,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2018-11-10 04:13:43,942 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 23 states. [2018-11-10 04:13:45,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:13:45,679 INFO L93 Difference]: Finished difference Result 175 states and 182 transitions. [2018-11-10 04:13:45,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-10 04:13:45,679 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-11-10 04:13:45,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:13:45,680 INFO L225 Difference]: With dead ends: 175 [2018-11-10 04:13:45,680 INFO L226 Difference]: Without dead ends: 173 [2018-11-10 04:13:45,680 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=364, Invalid=826, Unknown=0, NotChecked=0, Total=1190 [2018-11-10 04:13:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-10 04:13:45,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 70. [2018-11-10 04:13:45,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 04:13:45,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-11-10 04:13:45,688 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2018-11-10 04:13:45,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:13:45,688 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-11-10 04:13:45,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 04:13:45,688 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-11-10 04:13:45,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 04:13:45,689 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:13:45,689 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:13:45,690 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:13:45,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:45,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1686057932, now seen corresponding path program 1 times [2018-11-10 04:13:45,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:13:45,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:45,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:13:45,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:45,691 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:13:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:13:45,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:13:45,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:13:45,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 04:13:45,732 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:13:45,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 04:13:45,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 04:13:45,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:13:45,733 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 6 states. [2018-11-10 04:13:45,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:13:45,784 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-11-10 04:13:45,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:13:45,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-10 04:13:45,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:13:45,785 INFO L225 Difference]: With dead ends: 70 [2018-11-10 04:13:45,785 INFO L226 Difference]: Without dead ends: 68 [2018-11-10 04:13:45,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:13:45,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-10 04:13:45,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-10 04:13:45,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 04:13:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-11-10 04:13:45,791 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2018-11-10 04:13:45,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:13:45,792 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-11-10 04:13:45,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 04:13:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-10 04:13:45,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 04:13:45,792 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:13:45,792 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, 1, 1, 1, 1, 1] [2018-11-10 04:13:45,793 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:13:45,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:45,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1806773561, now seen corresponding path program 1 times [2018-11-10 04:13:45,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:13:45,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:45,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:13:45,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:45,794 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:13:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:13:45,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 04:13:45,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:13:45,850 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 04:13:45,850 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-10 04:13:45,850 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [17], [21], [25], [29], [32], [35], [38], [42], [46], [52], [58], [61], [67], [73], [77], [80], [82], [85], [86], [192], [198], [204], [214], [215], [216] [2018-11-10 04:13:45,852 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 04:13:45,852 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 04:13:46,294 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 04:13:46,294 INFO L272 AbstractInterpreter]: Visited 29 different actions 64 times. Merged at 6 different actions 30 times. Widened at 2 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-11-10 04:13:46,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:46,295 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 04:13:46,373 INFO L227 lantSequenceWeakener]: Weakened 29 states. On average, predicates are now at 77.73% of their original sizes. [2018-11-10 04:13:46,374 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 04:13:46,692 INFO L415 sIntCurrentIteration]: We unified 30 AI predicates to 30 [2018-11-10 04:13:46,693 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 04:13:46,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:13:46,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [7] total 29 [2018-11-10 04:13:46,693 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:13:46,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-10 04:13:46,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-10 04:13:46,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2018-11-10 04:13:46,694 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 24 states. [2018-11-10 04:13:47,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:13:47,951 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-10 04:13:47,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 04:13:47,951 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-11-10 04:13:47,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:13:47,952 INFO L225 Difference]: With dead ends: 90 [2018-11-10 04:13:47,952 INFO L226 Difference]: Without dead ends: 88 [2018-11-10 04:13:47,952 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=398, Invalid=934, Unknown=0, NotChecked=0, Total=1332 [2018-11-10 04:13:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-10 04:13:47,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 62. [2018-11-10 04:13:47,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-10 04:13:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-11-10 04:13:47,959 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2018-11-10 04:13:47,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:13:47,959 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-11-10 04:13:47,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-10 04:13:47,959 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-11-10 04:13:47,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 04:13:47,960 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:13:47,960 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:13:47,960 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:13:47,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:47,960 INFO L82 PathProgramCache]: Analyzing trace with hash -287576151, now seen corresponding path program 1 times [2018-11-10 04:13:47,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:13:47,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:47,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:13:47,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:47,961 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:13:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:13:48,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:13:48,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:13:48,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:13:48,028 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:13:48,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:13:48,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:13:48,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:13:48,029 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 7 states. [2018-11-10 04:13:48,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:13:48,084 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-10 04:13:48,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:13:48,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-10 04:13:48,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:13:48,085 INFO L225 Difference]: With dead ends: 63 [2018-11-10 04:13:48,086 INFO L226 Difference]: Without dead ends: 61 [2018-11-10 04:13:48,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-11-10 04:13:48,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-10 04:13:48,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-10 04:13:48,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 04:13:48,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-11-10 04:13:48,091 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2018-11-10 04:13:48,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:13:48,091 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-11-10 04:13:48,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:13:48,092 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-10 04:13:48,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 04:13:48,092 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:13:48,092 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:13:48,092 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:13:48,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:48,093 INFO L82 PathProgramCache]: Analyzing trace with hash -324922921, now seen corresponding path program 1 times [2018-11-10 04:13:48,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:13:48,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:48,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:13:48,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:48,094 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:13:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:13:48,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:13:48,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:13:48,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:13:48,146 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:13:48,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:13:48,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:13:48,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:13:48,147 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 7 states. [2018-11-10 04:13:48,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:13:48,219 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-11-10 04:13:48,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:13:48,220 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-11-10 04:13:48,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:13:48,220 INFO L225 Difference]: With dead ends: 71 [2018-11-10 04:13:48,220 INFO L226 Difference]: Without dead ends: 69 [2018-11-10 04:13:48,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-10 04:13:48,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-10 04:13:48,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2018-11-10 04:13:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 04:13:48,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-11-10 04:13:48,228 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2018-11-10 04:13:48,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:13:48,228 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-11-10 04:13:48,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:13:48,228 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-10 04:13:48,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 04:13:48,229 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:13:48,229 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:13:48,229 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:13:48,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:48,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1080633106, now seen corresponding path program 1 times [2018-11-10 04:13:48,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:13:48,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:48,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:13:48,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:48,231 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:13:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:13:48,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:13:48,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:13:48,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:13:48,261 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:13:48,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:13:48,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:13:48,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:13:48,262 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2018-11-10 04:13:48,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:13:48,340 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-11-10 04:13:48,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:13:48,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-10 04:13:48,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:13:48,341 INFO L225 Difference]: With dead ends: 91 [2018-11-10 04:13:48,341 INFO L226 Difference]: Without dead ends: 89 [2018-11-10 04:13:48,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:13:48,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-10 04:13:48,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2018-11-10 04:13:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-10 04:13:48,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-11-10 04:13:48,350 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2018-11-10 04:13:48,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:13:48,350 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-11-10 04:13:48,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:13:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-11-10 04:13:48,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 04:13:48,351 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:13:48,351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:13:48,351 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:13:48,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:48,351 INFO L82 PathProgramCache]: Analyzing trace with hash -860108895, now seen corresponding path program 1 times [2018-11-10 04:13:48,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:13:48,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:48,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:13:48,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:48,352 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:13:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:13:48,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:13:48,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:13:48,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:13:48,386 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:13:48,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:13:48,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:13:48,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:13:48,387 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 5 states. [2018-11-10 04:13:48,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:13:48,442 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-11-10 04:13:48,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:13:48,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-10 04:13:48,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:13:48,443 INFO L225 Difference]: With dead ends: 61 [2018-11-10 04:13:48,443 INFO L226 Difference]: Without dead ends: 59 [2018-11-10 04:13:48,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:13:48,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-10 04:13:48,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-10 04:13:48,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 04:13:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-11-10 04:13:48,451 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2018-11-10 04:13:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:13:48,451 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-11-10 04:13:48,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:13:48,451 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-10 04:13:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 04:13:48,452 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:13:48,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:13:48,452 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:13:48,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:48,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1930828060, now seen corresponding path program 1 times [2018-11-10 04:13:48,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:13:48,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:48,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:13:48,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:48,453 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:13:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:13:48,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:13:48,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:13:48,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:13:48,481 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:13:48,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:13:48,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:13:48,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:13:48,482 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 5 states. [2018-11-10 04:13:48,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:13:48,551 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-11-10 04:13:48,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:13:48,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-11-10 04:13:48,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:13:48,552 INFO L225 Difference]: With dead ends: 70 [2018-11-10 04:13:48,552 INFO L226 Difference]: Without dead ends: 68 [2018-11-10 04:13:48,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 04:13:48,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-10 04:13:48,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-11-10 04:13:48,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 04:13:48,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-11-10 04:13:48,564 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41 [2018-11-10 04:13:48,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:13:48,565 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-11-10 04:13:48,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:13:48,565 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-11-10 04:13:48,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 04:13:48,565 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:13:48,565 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:13:48,566 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:13:48,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:48,566 INFO L82 PathProgramCache]: Analyzing trace with hash 273875486, now seen corresponding path program 1 times [2018-11-10 04:13:48,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:13:48,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:48,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:13:48,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:48,567 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:13:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:13:48,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:13:48,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:13:48,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 04:13:48,609 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:13:48,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 04:13:48,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 04:13:48,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:13:48,609 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 6 states. [2018-11-10 04:13:48,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:13:48,694 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-11-10 04:13:48,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:13:48,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-11-10 04:13:48,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:13:48,696 INFO L225 Difference]: With dead ends: 66 [2018-11-10 04:13:48,696 INFO L226 Difference]: Without dead ends: 64 [2018-11-10 04:13:48,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:13:48,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-10 04:13:48,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-11-10 04:13:48,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-10 04:13:48,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-11-10 04:13:48,707 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2018-11-10 04:13:48,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:13:48,707 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-10 04:13:48,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 04:13:48,707 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-10 04:13:48,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 04:13:48,708 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:13:48,708 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:13:48,708 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:13:48,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:48,708 INFO L82 PathProgramCache]: Analyzing trace with hash -99791318, now seen corresponding path program 1 times [2018-11-10 04:13:48,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:13:48,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:48,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:13:48,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:48,709 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:13:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:13:48,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:13:48,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:13:48,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:13:48,765 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:13:48,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:13:48,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:13:48,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:13:48,766 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 5 states. [2018-11-10 04:13:48,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:13:48,873 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-11-10 04:13:48,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:13:48,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-11-10 04:13:48,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:13:48,875 INFO L225 Difference]: With dead ends: 88 [2018-11-10 04:13:48,875 INFO L226 Difference]: Without dead ends: 86 [2018-11-10 04:13:48,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:13:48,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-10 04:13:48,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2018-11-10 04:13:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 04:13:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-11-10 04:13:48,886 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43 [2018-11-10 04:13:48,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:13:48,888 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-11-10 04:13:48,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:13:48,888 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-11-10 04:13:48,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 04:13:48,888 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:13:48,888 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:13:48,889 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:13:48,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:48,889 INFO L82 PathProgramCache]: Analyzing trace with hash 2020599801, now seen corresponding path program 1 times [2018-11-10 04:13:48,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:13:48,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:48,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:13:48,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:48,893 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:13:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:13:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:13:48,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:13:48,975 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 04:13:48,975 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-11-10 04:13:48,975 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [17], [21], [25], [29], [32], [35], [38], [42], [46], [52], [58], [61], [67], [73], [77], [80], [82], [88], [94], [100], [106], [112], [117], [120], [126], [132], [136], [139], [142], [143], [145], [151], [180], [182], [214], [215], [216] [2018-11-10 04:13:48,977 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 04:13:48,977 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 04:13:50,608 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 04:13:50,608 INFO L272 AbstractInterpreter]: Visited 41 different actions 76 times. Merged at 6 different actions 30 times. Widened at 2 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 44 variables. [2018-11-10 04:13:50,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:50,615 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 04:13:50,852 INFO L227 lantSequenceWeakener]: Weakened 42 states. On average, predicates are now at 77.84% of their original sizes. [2018-11-10 04:13:50,852 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 04:13:51,971 INFO L415 sIntCurrentIteration]: We unified 43 AI predicates to 43 [2018-11-10 04:13:51,972 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 04:13:51,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:13:51,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [35] imperfect sequences [7] total 40 [2018-11-10 04:13:51,972 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:13:51,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-10 04:13:51,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-10 04:13:51,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1018, Unknown=0, NotChecked=0, Total=1190 [2018-11-10 04:13:51,973 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 35 states. [2018-11-10 04:13:55,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:13:55,374 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-11-10 04:13:55,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-10 04:13:55,375 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 44 [2018-11-10 04:13:55,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:13:55,375 INFO L225 Difference]: With dead ends: 71 [2018-11-10 04:13:55,375 INFO L226 Difference]: Without dead ends: 69 [2018-11-10 04:13:55,376 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 67 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=958, Invalid=2464, Unknown=0, NotChecked=0, Total=3422 [2018-11-10 04:13:55,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-10 04:13:55,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2018-11-10 04:13:55,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 04:13:55,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-11-10 04:13:55,386 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2018-11-10 04:13:55,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:13:55,387 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-11-10 04:13:55,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-10 04:13:55,387 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-10 04:13:55,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 04:13:55,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:13:55,387 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:13:55,387 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:13:55,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:55,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1201439652, now seen corresponding path program 1 times [2018-11-10 04:13:55,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:13:55,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:55,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:13:55,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:55,389 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:13:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:13:55,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:13:55,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:13:55,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:13:55,432 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:13:55,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:13:55,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:13:55,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:13:55,432 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2018-11-10 04:13:55,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:13:55,490 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-10 04:13:55,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:13:55,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-10 04:13:55,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:13:55,492 INFO L225 Difference]: With dead ends: 69 [2018-11-10 04:13:55,493 INFO L226 Difference]: Without dead ends: 67 [2018-11-10 04:13:55,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:13:55,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-10 04:13:55,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2018-11-10 04:13:55,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 04:13:55,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-11-10 04:13:55,502 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2018-11-10 04:13:55,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:13:55,502 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-11-10 04:13:55,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:13:55,503 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-11-10 04:13:55,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 04:13:55,503 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:13:55,503 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 04:13:55,503 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:13:55,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:13:55,504 INFO L82 PathProgramCache]: Analyzing trace with hash 40764835, now seen corresponding path program 1 times [2018-11-10 04:13:55,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:13:55,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:55,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:13:55,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:13:55,505 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:13:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:13:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 04:13:55,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:13:55,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:13:55,542 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:13:55,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:13:55,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:13:55,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:13:55,542 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2018-11-10 04:13:55,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:13:55,634 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-11-10 04:13:55,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 04:13:55,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-11-10 04:13:55,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:13:55,635 INFO L225 Difference]: With dead ends: 75 [2018-11-10 04:13:55,635 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 04:13:55,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 04:13:55,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 04:13:55,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 04:13:55,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 04:13:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 04:13:55,636 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-11-10 04:13:55,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:13:55,636 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:13:55,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:13:55,636 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 04:13:55,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 04:13:55,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 04:13:56,312 WARN L179 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 576 DAG size of output: 564 [2018-11-10 04:13:56,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 04:13:56,484 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 317 DAG size of output: 310 [2018-11-10 04:13:56,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 04:13:56,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 04:13:56,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 04:13:56,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 04:13:56,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 04:13:57,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 04:13:57,146 WARN L179 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 670 DAG size of output: 632 [2018-11-10 04:13:57,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 04:13:59,404 WARN L179 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 562 DAG size of output: 133 [2018-11-10 04:13:59,900 WARN L179 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 309 DAG size of output: 61 [2018-11-10 04:14:02,721 WARN L179 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 628 DAG size of output: 113 [2018-11-10 04:14:03,187 WARN L179 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 43 [2018-11-10 04:14:03,190 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 04:14:03,190 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-10 04:14:03,190 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 04:14:03,190 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 04:14:03,190 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 04:14:03,190 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 04:14:03,190 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 04:14:03,191 INFO L425 ceAbstractionStarter]: For program point L60(lines 60 412) no Hoare annotation was computed. [2018-11-10 04:14:03,191 INFO L425 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2018-11-10 04:14:03,191 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 434) no Hoare annotation was computed. [2018-11-10 04:14:03,191 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-10 04:14:03,191 INFO L425 ceAbstractionStarter]: For program point L118(lines 118 398) no Hoare annotation was computed. [2018-11-10 04:14:03,191 INFO L425 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2018-11-10 04:14:03,191 INFO L425 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2018-11-10 04:14:03,191 INFO L425 ceAbstractionStarter]: For program point L267(line 267) no Hoare annotation was computed. [2018-11-10 04:14:03,191 INFO L425 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2018-11-10 04:14:03,191 INFO L425 ceAbstractionStarter]: For program point L36(lines 36 430) no Hoare annotation was computed. [2018-11-10 04:14:03,191 INFO L425 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2018-11-10 04:14:03,191 INFO L425 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-11-10 04:14:03,191 INFO L425 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2018-11-10 04:14:03,191 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2018-11-10 04:14:03,191 INFO L425 ceAbstractionStarter]: For program point L367(lines 367 390) no Hoare annotation was computed. [2018-11-10 04:14:03,191 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 409) no Hoare annotation was computed. [2018-11-10 04:14:03,191 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 311) no Hoare annotation was computed. [2018-11-10 04:14:03,192 INFO L425 ceAbstractionStarter]: For program point L219(lines 219 339) no Hoare annotation was computed. [2018-11-10 04:14:03,192 INFO L425 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-11-10 04:14:03,192 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 427) no Hoare annotation was computed. [2018-11-10 04:14:03,192 INFO L421 ceAbstractionStarter]: At program point L310(lines 225 339) the Hoare annotation is: (let ((.cse23 (* 2 main_~__VERIFIER_assert__cond~1)) (.cse20 (* 2 main_~main__scheme~0)) (.cse21 (* 2 main_~main____CPAchecker_TMP_0~0)) (.cse22 (* 2 main_~__VERIFIER_assert__cond~2))) (let ((.cse11 (<= 2 .cse22)) (.cse7 (and (let ((.cse24 (* 2 main_~__VERIFIER_assert__cond~4))) (and (not (= 0 main_~__VERIFIER_assert__cond~7)) (<= 2 .cse24) (<= main_~main__cp~0 (+ main_~__VERIFIER_assert__cond~2 999998)) (<= .cse24 2) (<= 1 main_~main__cp~0) (<= 0 (+ .cse21 4294967296)) (and (and (= main_~__VERIFIER_assert__cond~3 1) (not (= 0 main_~__VERIFIER_assert__cond~2)) (not (= 0 main_~__VERIFIER_assert__cond~5)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1) (not (= 0 main_~__VERIFIER_assert__cond~6))) (<= (+ main_~main__tokenlen~0 main_~main__scheme~0) 2000000)))) (not (= 0 main_~__VERIFIER_assert__cond~8)))) (.cse12 (<= 2 .cse20)) (.cse5 (<= .cse23 2)) (.cse8 (<= 2 .cse23)) (.cse9 (<= .cse22 2)) (.cse13 (<= .cse21 4294967294)) (.cse1 (<= .cse20 2000000)) (.cse14 (<= main_~__VERIFIER_assert__cond~1 main_~main__tokenlen~0))) (or (let ((.cse3 (* 2 main_~__VERIFIER_assert__cond~7)) (.cse2 (* 2 main_~main____CPAchecker_TMP_2~0)) (.cse0 (* 2 main_~__VERIFIER_assert__cond~6)) (.cse6 (* 2 main_~main____CPAchecker_TMP_1~0)) (.cse10 (* 2 main_~__VERIFIER_assert__cond~5)) (.cse4 (+ main_~main__c~0 1))) (and (<= 2 .cse0) .cse1 (<= 0 (+ .cse2 4294967296)) (<= .cse3 2) (<= 2 .cse3) (<= .cse4 main_~__VERIFIER_assert__cond~9) .cse5 (<= 0 (+ .cse6 4294967296)) (<= .cse2 4294967294) (<= .cse0 2) (<= .cse6 4294967294) (<= (* 2 main_~main__c~0) 0) .cse7 .cse8 .cse9 (<= (+ main_~main__cp~0 2) main_~main__urilen~0) (<= .cse10 2) (<= main_~__VERIFIER_assert__cond~9 .cse4) (<= 2 .cse10) (<= 3 (+ main_~__VERIFIER_assert__cond~9 main_~main__cp~0)) .cse11 .cse12 (<= (+ main_~main__tokenlen~0 main_~__VERIFIER_assert__cond~9) 1000001) .cse13 (<= 2 (* 2 main_~__VERIFIER_assert__cond~8)) .cse14 (<= main_~main__urilen~0 (+ main_~__VERIFIER_assert__cond~7 999999)) (<= main_~__VERIFIER_assert__cond~8 .cse4))) (let ((.cse19 (* 2 main_~__VERIFIER_assert__cond~10))) (and .cse11 (let ((.cse15 (let ((.cse16 (<= 2 main_~main__cp~0)) (.cse17 (= main_~__VERIFIER_assert__cond~9 1)) (.cse18 (not (= 0 main_~__VERIFIER_assert__cond~11)))) (or (and .cse16 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse17 .cse7 .cse18) (and .cse16 .cse17 .cse7 .cse18 (not (= 0 main_~__VERIFIER_assert__cond~12))))))) (or (and (<= 1 main_~main__c~0) (not (= 0 main_~__VERIFIER_assert__cond~13)) .cse15) (and (= main_~main__c~0 0) .cse15))) .cse12 .cse5 .cse8 .cse9 .cse13 (<= 2 .cse19) .cse1 .cse14 (<= (+ main_~main__urilen~0 main_~__VERIFIER_assert__cond~3) 1000001) (<= (+ main_~__VERIFIER_assert__cond~2 main_~main__tokenlen~0) 1000001) (<= .cse19 2)))))) [2018-11-10 04:14:03,192 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 315) no Hoare annotation was computed. [2018-11-10 04:14:03,192 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 434) no Hoare annotation was computed. [2018-11-10 04:14:03,193 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 326) no Hoare annotation was computed. [2018-11-10 04:14:03,193 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 352) no Hoare annotation was computed. [2018-11-10 04:14:03,193 INFO L425 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2018-11-10 04:14:03,193 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 431) no Hoare annotation was computed. [2018-11-10 04:14:03,193 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 434) the Hoare annotation is: true [2018-11-10 04:14:03,193 INFO L425 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2018-11-10 04:14:03,193 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2018-11-10 04:14:03,193 INFO L425 ceAbstractionStarter]: For program point L369(line 369) no Hoare annotation was computed. [2018-11-10 04:14:03,193 INFO L425 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-10 04:14:03,193 INFO L425 ceAbstractionStarter]: For program point L303(line 303) no Hoare annotation was computed. [2018-11-10 04:14:03,193 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 357) no Hoare annotation was computed. [2018-11-10 04:14:03,193 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 333) no Hoare annotation was computed. [2018-11-10 04:14:03,193 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2018-11-10 04:14:03,194 INFO L425 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2018-11-10 04:14:03,194 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 392) no Hoare annotation was computed. [2018-11-10 04:14:03,194 INFO L425 ceAbstractionStarter]: For program point L221(line 221) no Hoare annotation was computed. [2018-11-10 04:14:03,194 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 422) no Hoare annotation was computed. [2018-11-10 04:14:03,194 INFO L425 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2018-11-10 04:14:03,194 INFO L425 ceAbstractionStarter]: For program point L48(lines 48 428) no Hoare annotation was computed. [2018-11-10 04:14:03,194 INFO L425 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2018-11-10 04:14:03,194 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-10 04:14:03,194 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 400) no Hoare annotation was computed. [2018-11-10 04:14:03,195 INFO L421 ceAbstractionStarter]: At program point L387(lines 124 398) the Hoare annotation is: (let ((.cse0 (* 2 main_~__VERIFIER_assert__cond~1)) (.cse1 (* 2 main_~__VERIFIER_assert__cond~0)) (.cse2 (* 2 main_~main____CPAchecker_TMP_0~0))) (and (<= .cse0 2) (<= (* 2 main_~main__scheme~0) 2000000) (<= .cse1 2) (= main_~__VERIFIER_assert__cond~3 1) (<= 2 .cse0) (<= main_~main__urilen~0 (+ main_~__VERIFIER_assert__cond~3 999999)) (<= main_~__VERIFIER_assert__cond~1 main_~main__tokenlen~0) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (<= (+ main_~__VERIFIER_assert__cond~2 main_~main__tokenlen~0) 1000001) (<= .cse2 4294967294) (= main_~__VERIFIER_assert__cond~2 1) (<= 2 .cse1) (<= 1 main_~main__cp~0) (<= 0 (+ .cse2 4294967296)) (<= 1 main_~main__scheme~0))) [2018-11-10 04:14:03,196 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 349) no Hoare annotation was computed. [2018-11-10 04:14:03,196 INFO L425 ceAbstractionStarter]: For program point L379(lines 379 388) no Hoare annotation was computed. [2018-11-10 04:14:03,196 INFO L425 ceAbstractionStarter]: For program point L90(lines 90 407) no Hoare annotation was computed. [2018-11-10 04:14:03,196 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 432) no Hoare annotation was computed. [2018-11-10 04:14:03,196 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2018-11-10 04:14:03,196 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2018-11-10 04:14:03,196 INFO L425 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-11-10 04:14:03,196 INFO L421 ceAbstractionStarter]: At program point L396(lines 126 397) the Hoare annotation is: (let ((.cse4 (and (= main_~__VERIFIER_assert__cond~3 1) (and (< main_~main__cp~0 main_~main__urilen~0) (let ((.cse5 (<= 1 main_~main__cp~0)) (.cse6 (= main_~__VERIFIER_assert__cond~0 1)) (.cse7 (<= 1 main_~main__scheme~0)) (.cse8 (not (= 0 main_~__VERIFIER_assert__cond~1)))) (or (and (not (= 0 main_~__VERIFIER_assert__cond~2)) .cse5 .cse6 (not (= 0 main_~__VERIFIER_assert__cond~16)) .cse7 .cse8) (and (= main_~__VERIFIER_assert__cond~2 1) .cse5 .cse6 .cse7 .cse8))))))) (or (let ((.cse3 (* 2 main_~__VERIFIER_assert__cond~2)) (.cse2 (* 2 main_~__VERIFIER_assert__cond~1)) (.cse0 (* 2 main_~main____CPAchecker_TMP_0~0)) (.cse1 (* 2 main_~main____CPAchecker_TMP_1~0))) (and (<= 0 (+ .cse0 4294967296)) (<= .cse1 4294967294) (<= 2 .cse2) (<= .cse3 2) (<= (* 2 main_~main__scheme~0) 2000000) .cse4 (<= 2 .cse3) (<= .cse2 2) (<= .cse0 4294967294) (<= 0 (+ .cse1 4294967296)) (<= (+ main_~__VERIFIER_assert__cond~0 main_~main__tokenlen~0) 1000001) (<= main_~__VERIFIER_assert__cond~1 main_~main__tokenlen~0) (<= (+ main_~main__urilen~0 main_~__VERIFIER_assert__cond~3) 1000001))) (and .cse4 (= main_~main__urilen~0 (+ main_~main__cp~0 1))))) [2018-11-10 04:14:03,196 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 406) no Hoare annotation was computed. [2018-11-10 04:14:03,197 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 411) no Hoare annotation was computed. [2018-11-10 04:14:03,197 INFO L421 ceAbstractionStarter]: At program point L322(lines 257 323) the Hoare annotation is: (let ((.cse0 (* 2 main_~__VERIFIER_assert__cond~1)) (.cse2 (* 2 main_~main____CPAchecker_TMP_0~0)) (.cse1 (* 2 main_~__VERIFIER_assert__cond~2))) (and (<= .cse0 2) (<= .cse1 2) (<= .cse2 4294967294) (<= (* 2 main_~main__scheme~0) 2000000) (<= 2 .cse0) (<= (+ main_~main__cp~0 2) main_~main__urilen~0) (<= main_~__VERIFIER_assert__cond~1 main_~main__tokenlen~0) (let ((.cse3 (let ((.cse4 (= main_~__VERIFIER_assert__cond~9 1)) (.cse5 (let ((.cse7 (* 2 main_~__VERIFIER_assert__cond~4)) (.cse8 (+ main_~main__tokenlen~0 2000000))) (and (not (= 0 main_~__VERIFIER_assert__cond~7)) (not (= 0 main_~__VERIFIER_assert__cond~2)) (not (= 0 main_~__VERIFIER_assert__cond~5)) (<= 2 .cse7) (not (= 0 main_~__VERIFIER_assert__cond~8)) (<= (+ main_~main____CPAchecker_TMP_0~0 main_~main__urilen~0) 2148483647) (<= 0 (+ (* 2 main_~main__tokenlen~0) 2000000)) (<= main_~main__scheme~0 .cse8) (<= main_~main__cp~0 (+ main_~__VERIFIER_assert__cond~2 999998)) (<= .cse7 2) (not (= 0 main_~__VERIFIER_assert__cond~9)) (<= (+ main_~main__tokenlen~0 main_~main__scheme~0) 2000000) (= main_~__VERIFIER_assert__cond~0 1) (<= main_~main__urilen~0 .cse8) (<= main_~main____CPAchecker_TMP_0~0 (+ main_~main__urilen~0 2147483645)) (<= 0 (+ .cse2 4294967296)) (not (= 0 main_~__VERIFIER_assert__cond~6)) (not (= 0 main_~__VERIFIER_assert__cond~1)) (<= 2 main_~main__cp~0) (= main_~__VERIFIER_assert__cond~3 1) (<= main_~main__urilen~0 (+ main_~main__cp~0 999999)) (<= (+ main_~__VERIFIER_assert__cond~2 main_~main__urilen~0) 1000001) (<= 3 (+ main_~__VERIFIER_assert__cond~1 main_~main__urilen~0)) (<= 1 main_~main__scheme~0) (<= main_~main__urilen~0 (+ main_~__VERIFIER_assert__cond~1 999999))))) (.cse6 (not (= 0 main_~__VERIFIER_assert__cond~11)))) (or (and .cse4 .cse5 .cse6 (not (= 0 main_~__VERIFIER_assert__cond~12))) (and (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse4 .cse5 .cse6))))) (or (and .cse3 (= main_~main__c~0 0)) (and (<= 1 main_~main__c~0) .cse3 (not (= 0 main_~__VERIFIER_assert__cond~13))))) (<= 2 .cse1) (= main_~__VERIFIER_assert__cond~10 1) (<= (+ main_~__VERIFIER_assert__cond~2 main_~main__tokenlen~0) 1000001))) [2018-11-10 04:14:03,197 INFO L425 ceAbstractionStarter]: For program point L289(lines 289 313) no Hoare annotation was computed. [2018-11-10 04:14:03,197 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2018-11-10 04:14:03,197 INFO L425 ceAbstractionStarter]: For program point L157(lines 157 354) no Hoare annotation was computed. [2018-11-10 04:14:03,197 INFO L425 ceAbstractionStarter]: For program point L58(lines 58 417) no Hoare annotation was computed. [2018-11-10 04:14:03,197 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 324) no Hoare annotation was computed. [2018-11-10 04:14:03,197 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 350) no Hoare annotation was computed. [2018-11-10 04:14:03,197 INFO L421 ceAbstractionStarter]: At program point L405(lines 99 406) the Hoare annotation is: (= main_~__VERIFIER_assert__cond~0 1) [2018-11-10 04:14:03,198 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-11-10 04:14:03,198 INFO L425 ceAbstractionStarter]: For program point L207(lines 207 341) no Hoare annotation was computed. [2018-11-10 04:14:03,198 INFO L425 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-11-10 04:14:03,198 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 429) no Hoare annotation was computed. [2018-11-10 04:14:03,198 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 317) no Hoare annotation was computed. [2018-11-10 04:14:03,198 INFO L425 ceAbstractionStarter]: For program point L199(lines 199 348) no Hoare annotation was computed. [2018-11-10 04:14:03,198 INFO L425 ceAbstractionStarter]: For program point L257(lines 257 323) no Hoare annotation was computed. [2018-11-10 04:14:03,198 INFO L425 ceAbstractionStarter]: For program point L381(line 381) no Hoare annotation was computed. [2018-11-10 04:14:03,198 INFO L425 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-11-10 04:14:03,198 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 355) no Hoare annotation was computed. [2018-11-10 04:14:03,198 INFO L425 ceAbstractionStarter]: For program point L18(lines 18 433) no Hoare annotation was computed. [2018-11-10 04:14:03,198 INFO L425 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2018-11-10 04:14:03,198 INFO L425 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2018-11-10 04:14:03,198 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-11-10 04:14:03,199 INFO L425 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2018-11-10 04:14:03,199 INFO L425 ceAbstractionStarter]: For program point L291(line 291) no Hoare annotation was computed. [2018-11-10 04:14:03,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:14:03 BoogieIcfgContainer [2018-11-10 04:14:03,228 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 04:14:03,229 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:14:03,229 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:14:03,229 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:14:03,230 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:13:40" (3/4) ... [2018-11-10 04:14:03,234 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 04:14:03,239 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 04:14:03,240 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 04:14:03,246 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-10 04:14:03,246 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 04:14:03,308 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e2be4508-668a-427e-a278-07e94a5465dd/bin-2019/utaipan/witness.graphml [2018-11-10 04:14:03,308 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:14:03,308 INFO L168 Benchmark]: Toolchain (without parser) took 23022.13 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 962.9 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:14:03,309 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:14:03,309 INFO L168 Benchmark]: CACSL2BoogieTranslator took 190.41 ms. Allocated memory is still 1.0 GB. Free memory was 962.9 MB in the beginning and 945.7 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-10 04:14:03,309 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.51 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:14:03,309 INFO L168 Benchmark]: Boogie Preprocessor took 18.91 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:14:03,309 INFO L168 Benchmark]: RCFGBuilder took 395.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-11-10 04:14:03,310 INFO L168 Benchmark]: TraceAbstraction took 22318.54 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-11-10 04:14:03,310 INFO L168 Benchmark]: Witness Printer took 78.79 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:14:03,312 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 190.41 ms. Allocated memory is still 1.0 GB. Free memory was 962.9 MB in the beginning and 945.7 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.51 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.91 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 395.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22318.54 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 78.79 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 92]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 120]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 221]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 291]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 381]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 209]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 303]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 369]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 279]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 267]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 238]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 108]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((2 <= 2 * __VERIFIER_assert__cond && 2 * main__scheme <= 2000000) && 0 <= 2 * main____CPAchecker_TMP_2 + 4294967296) && 2 * __VERIFIER_assert__cond <= 2) && 2 <= 2 * __VERIFIER_assert__cond) && main__c + 1 <= __VERIFIER_assert__cond) && 2 * __VERIFIER_assert__cond <= 2) && 0 <= 2 * main____CPAchecker_TMP_1 + 4294967296) && 2 * main____CPAchecker_TMP_2 <= 4294967294) && 2 * __VERIFIER_assert__cond <= 2) && 2 * main____CPAchecker_TMP_1 <= 4294967294) && 2 * main__c <= 0) && ((((((!(0 == __VERIFIER_assert__cond) && 2 <= 2 * __VERIFIER_assert__cond) && main__cp <= __VERIFIER_assert__cond + 999998) && 2 * __VERIFIER_assert__cond <= 2) && 1 <= main__cp) && 0 <= 2 * main____CPAchecker_TMP_0 + 4294967296) && (((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && main__tokenlen + main__scheme <= 2000000) && !(0 == __VERIFIER_assert__cond)) && 2 <= 2 * __VERIFIER_assert__cond) && 2 * __VERIFIER_assert__cond <= 2) && main__cp + 2 <= main__urilen) && 2 * __VERIFIER_assert__cond <= 2) && __VERIFIER_assert__cond <= main__c + 1) && 2 <= 2 * __VERIFIER_assert__cond) && 3 <= __VERIFIER_assert__cond + main__cp) && 2 <= 2 * __VERIFIER_assert__cond) && 2 <= 2 * main__scheme) && main__tokenlen + __VERIFIER_assert__cond <= 1000001) && 2 * main____CPAchecker_TMP_0 <= 4294967294) && 2 <= 2 * __VERIFIER_assert__cond) && __VERIFIER_assert__cond <= main__tokenlen) && main__urilen <= __VERIFIER_assert__cond + 999999) && __VERIFIER_assert__cond <= main__c + 1) || ((((((((((((2 <= 2 * __VERIFIER_assert__cond && (((1 <= main__c && !(0 == __VERIFIER_assert__cond)) && (((((2 <= main__cp && main__c + 2 <= main__tokenlen) && __VERIFIER_assert__cond == 1) && ((((((!(0 == __VERIFIER_assert__cond) && 2 <= 2 * __VERIFIER_assert__cond) && main__cp <= __VERIFIER_assert__cond + 999998) && 2 * __VERIFIER_assert__cond <= 2) && 1 <= main__cp) && 0 <= 2 * main____CPAchecker_TMP_0 + 4294967296) && (((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && main__tokenlen + main__scheme <= 2000000) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((2 <= main__cp && __VERIFIER_assert__cond == 1) && ((((((!(0 == __VERIFIER_assert__cond) && 2 <= 2 * __VERIFIER_assert__cond) && main__cp <= __VERIFIER_assert__cond + 999998) && 2 * __VERIFIER_assert__cond <= 2) && 1 <= main__cp) && 0 <= 2 * main____CPAchecker_TMP_0 + 4294967296) && (((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && main__tokenlen + main__scheme <= 2000000) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)))) || (main__c == 0 && (((((2 <= main__cp && main__c + 2 <= main__tokenlen) && __VERIFIER_assert__cond == 1) && ((((((!(0 == __VERIFIER_assert__cond) && 2 <= 2 * __VERIFIER_assert__cond) && main__cp <= __VERIFIER_assert__cond + 999998) && 2 * __VERIFIER_assert__cond <= 2) && 1 <= main__cp) && 0 <= 2 * main____CPAchecker_TMP_0 + 4294967296) && (((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && main__tokenlen + main__scheme <= 2000000) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((2 <= main__cp && __VERIFIER_assert__cond == 1) && ((((((!(0 == __VERIFIER_assert__cond) && 2 <= 2 * __VERIFIER_assert__cond) && main__cp <= __VERIFIER_assert__cond + 999998) && 2 * __VERIFIER_assert__cond <= 2) && 1 <= main__cp) && 0 <= 2 * main____CPAchecker_TMP_0 + 4294967296) && (((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && main__tokenlen + main__scheme <= 2000000) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)))))) && 2 <= 2 * main__scheme) && 2 * __VERIFIER_assert__cond <= 2) && 2 <= 2 * __VERIFIER_assert__cond) && 2 * __VERIFIER_assert__cond <= 2) && 2 * main____CPAchecker_TMP_0 <= 4294967294) && 2 <= 2 * __VERIFIER_assert__cond) && 2 * main__scheme <= 2000000) && __VERIFIER_assert__cond <= main__tokenlen) && main__urilen + __VERIFIER_assert__cond <= 1000001) && __VERIFIER_assert__cond + main__tokenlen <= 1000001) && 2 * __VERIFIER_assert__cond <= 2) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((((0 <= 2 * main____CPAchecker_TMP_0 + 4294967296 && 2 * main____CPAchecker_TMP_1 <= 4294967294) && 2 <= 2 * __VERIFIER_assert__cond) && 2 * __VERIFIER_assert__cond <= 2) && 2 * main__scheme <= 2000000) && __VERIFIER_assert__cond == 1 && main__cp < main__urilen && ((((((!(0 == __VERIFIER_assert__cond) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) || ((((__VERIFIER_assert__cond == 1 && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)))) && 2 <= 2 * __VERIFIER_assert__cond) && 2 * __VERIFIER_assert__cond <= 2) && 2 * main____CPAchecker_TMP_0 <= 4294967294) && 0 <= 2 * main____CPAchecker_TMP_1 + 4294967296) && __VERIFIER_assert__cond + main__tokenlen <= 1000001) && __VERIFIER_assert__cond <= main__tokenlen) && main__urilen + __VERIFIER_assert__cond <= 1000001) || ((__VERIFIER_assert__cond == 1 && main__cp < main__urilen && ((((((!(0 == __VERIFIER_assert__cond) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) || ((((__VERIFIER_assert__cond == 1 && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)))) && main__urilen == main__cp + 1) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((((2 * __VERIFIER_assert__cond <= 2 && 2 * __VERIFIER_assert__cond <= 2) && 2 * main____CPAchecker_TMP_0 <= 4294967294) && 2 * main__scheme <= 2000000) && 2 <= 2 * __VERIFIER_assert__cond) && main__cp + 2 <= main__urilen) && __VERIFIER_assert__cond <= main__tokenlen) && ((((((__VERIFIER_assert__cond == 1 && (((((((((((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 2 <= 2 * __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && main____CPAchecker_TMP_0 + main__urilen <= 2148483647) && 0 <= 2 * main__tokenlen + 2000000) && main__scheme <= main__tokenlen + 2000000) && main__cp <= __VERIFIER_assert__cond + 999998) && 2 * __VERIFIER_assert__cond <= 2) && !(0 == __VERIFIER_assert__cond)) && main__tokenlen + main__scheme <= 2000000) && __VERIFIER_assert__cond == 1) && main__urilen <= main__tokenlen + 2000000) && main____CPAchecker_TMP_0 <= main__urilen + 2147483645) && 0 <= 2 * main____CPAchecker_TMP_0 + 4294967296) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 2 <= main__cp) && __VERIFIER_assert__cond == 1) && main__urilen <= main__cp + 999999) && __VERIFIER_assert__cond + main__urilen <= 1000001) && 3 <= __VERIFIER_assert__cond + main__urilen) && 1 <= main__scheme) && main__urilen <= __VERIFIER_assert__cond + 999999) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || (((main__c + 2 <= main__tokenlen && __VERIFIER_assert__cond == 1) && (((((((((((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 2 <= 2 * __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && main____CPAchecker_TMP_0 + main__urilen <= 2148483647) && 0 <= 2 * main__tokenlen + 2000000) && main__scheme <= main__tokenlen + 2000000) && main__cp <= __VERIFIER_assert__cond + 999998) && 2 * __VERIFIER_assert__cond <= 2) && !(0 == __VERIFIER_assert__cond)) && main__tokenlen + main__scheme <= 2000000) && __VERIFIER_assert__cond == 1) && main__urilen <= main__tokenlen + 2000000) && main____CPAchecker_TMP_0 <= main__urilen + 2147483645) && 0 <= 2 * main____CPAchecker_TMP_0 + 4294967296) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 2 <= main__cp) && __VERIFIER_assert__cond == 1) && main__urilen <= main__cp + 999999) && __VERIFIER_assert__cond + main__urilen <= 1000001) && 3 <= __VERIFIER_assert__cond + main__urilen) && 1 <= main__scheme) && main__urilen <= __VERIFIER_assert__cond + 999999) && !(0 == __VERIFIER_assert__cond))) && main__c == 0) || ((1 <= main__c && ((((__VERIFIER_assert__cond == 1 && (((((((((((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 2 <= 2 * __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && main____CPAchecker_TMP_0 + main__urilen <= 2148483647) && 0 <= 2 * main__tokenlen + 2000000) && main__scheme <= main__tokenlen + 2000000) && main__cp <= __VERIFIER_assert__cond + 999998) && 2 * __VERIFIER_assert__cond <= 2) && !(0 == __VERIFIER_assert__cond)) && main__tokenlen + main__scheme <= 2000000) && __VERIFIER_assert__cond == 1) && main__urilen <= main__tokenlen + 2000000) && main____CPAchecker_TMP_0 <= main__urilen + 2147483645) && 0 <= 2 * main____CPAchecker_TMP_0 + 4294967296) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 2 <= main__cp) && __VERIFIER_assert__cond == 1) && main__urilen <= main__cp + 999999) && __VERIFIER_assert__cond + main__urilen <= 1000001) && 3 <= __VERIFIER_assert__cond + main__urilen) && 1 <= main__scheme) && main__urilen <= __VERIFIER_assert__cond + 999999) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || (((main__c + 2 <= main__tokenlen && __VERIFIER_assert__cond == 1) && (((((((((((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 2 <= 2 * __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && main____CPAchecker_TMP_0 + main__urilen <= 2148483647) && 0 <= 2 * main__tokenlen + 2000000) && main__scheme <= main__tokenlen + 2000000) && main__cp <= __VERIFIER_assert__cond + 999998) && 2 * __VERIFIER_assert__cond <= 2) && !(0 == __VERIFIER_assert__cond)) && main__tokenlen + main__scheme <= 2000000) && __VERIFIER_assert__cond == 1) && main__urilen <= main__tokenlen + 2000000) && main____CPAchecker_TMP_0 <= main__urilen + 2147483645) && 0 <= 2 * main____CPAchecker_TMP_0 + 4294967296) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 2 <= main__cp) && __VERIFIER_assert__cond == 1) && main__urilen <= main__cp + 999999) && __VERIFIER_assert__cond + main__urilen <= 1000001) && 3 <= __VERIFIER_assert__cond + main__urilen) && 1 <= main__scheme) && main__urilen <= __VERIFIER_assert__cond + 999999) && !(0 == __VERIFIER_assert__cond)))) && !(0 == __VERIFIER_assert__cond)))) && 2 <= 2 * __VERIFIER_assert__cond) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond + main__tokenlen <= 1000001 - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (((((((((((((2 * __VERIFIER_assert__cond <= 2 && 2 * main__scheme <= 2000000) && 2 * __VERIFIER_assert__cond <= 2) && __VERIFIER_assert__cond == 1) && 2 <= 2 * __VERIFIER_assert__cond) && main__urilen <= __VERIFIER_assert__cond + 999999) && __VERIFIER_assert__cond <= main__tokenlen) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond + main__tokenlen <= 1000001) && 2 * main____CPAchecker_TMP_0 <= 4294967294) && __VERIFIER_assert__cond == 1) && 2 <= 2 * __VERIFIER_assert__cond) && 1 <= main__cp) && 0 <= 2 * main____CPAchecker_TMP_0 + 4294967296) && 1 <= main__scheme - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: __VERIFIER_assert__cond == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 87 locations, 18 error locations. SAFE Result, 22.2s OverallTime, 23 OverallIterations, 2 TraceHistogramMax, 7.9s AutomataDifference, 0.0s DeadEndRemovalTime, 7.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1285 SDtfs, 5918 SDslu, 2114 SDs, 0 SdLazy, 1349 SolverSat, 370 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 318 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.7s AbstIntTime, 3 AbstIntIterations, 3 AbstIntStrong, 0.9612575333163569 AbsIntWeakeningRatio, 0.8823529411764706 AbsIntAvgWeakeningVarsNumRemoved, 522.6274509803922 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 407 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 17 NumberOfFragments, 1416 HoareAnnotationTreeSize, 9 FomulaSimplifications, 6343263 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 9 FomulaSimplificationsInter, 567470 FormulaSimplificationTreeSizeReductionInter, 5.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 750 NumberOfCodeBlocks, 750 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 727 ConstructedInterpolants, 0 QuantifiedInterpolants, 49180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 20 PerfectInterpolantSequences, 7/13 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...