./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/psyco/psyco_security_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bfda5238-204d-4254-9ef9-cf7c7ff61a00/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bfda5238-204d-4254-9ef9-cf7c7ff61a00/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bfda5238-204d-4254-9ef9-cf7c7ff61a00/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bfda5238-204d-4254-9ef9-cf7c7ff61a00/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/psyco/psyco_security_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bfda5238-204d-4254-9ef9-cf7c7ff61a00/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bfda5238-204d-4254-9ef9-cf7c7ff61a00/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 8cc1f38a976dda42d71f86348e088e61d77f90eb ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 17:37:59,480 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:37:59,481 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:37:59,488 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:37:59,488 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:37:59,489 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:37:59,489 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:37:59,490 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:37:59,491 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:37:59,492 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:37:59,493 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:37:59,493 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:37:59,494 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:37:59,494 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:37:59,495 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:37:59,495 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:37:59,497 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:37:59,498 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:37:59,499 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:37:59,500 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:37:59,501 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:37:59,502 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:37:59,503 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:37:59,503 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:37:59,503 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:37:59,504 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:37:59,505 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:37:59,505 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:37:59,506 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:37:59,507 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:37:59,507 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:37:59,507 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:37:59,508 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:37:59,508 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:37:59,509 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:37:59,509 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:37:59,509 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bfda5238-204d-4254-9ef9-cf7c7ff61a00/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 17:37:59,519 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:37:59,519 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:37:59,520 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 17:37:59,520 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 17:37:59,520 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 17:37:59,520 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 17:37:59,520 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 17:37:59,520 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 17:37:59,520 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 17:37:59,521 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 17:37:59,521 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 17:37:59,521 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 17:37:59,521 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 17:37:59,521 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:37:59,521 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 17:37:59,521 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 17:37:59,522 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 17:37:59,522 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:37:59,522 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 17:37:59,522 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 17:37:59,522 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 17:37:59,522 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 17:37:59,522 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:37:59,523 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:37:59,523 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 17:37:59,523 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:37:59,523 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 17:37:59,523 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 17:37:59,523 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 17:37:59,523 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:37:59,523 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:37:59,523 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 17:37:59,523 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 17:37:59,523 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 17:37:59,523 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 17:37:59,524 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 17:37:59,524 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 17:37:59,524 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_bfda5238-204d-4254-9ef9-cf7c7ff61a00/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 -> 8cc1f38a976dda42d71f86348e088e61d77f90eb [2018-11-18 17:37:59,547 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:37:59,556 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:37:59,558 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:37:59,558 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:37:59,559 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:37:59,559 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bfda5238-204d-4254-9ef9-cf7c7ff61a00/bin-2019/utaipan/../../sv-benchmarks/c/psyco/psyco_security_true-unreach-call_false-termination.c [2018-11-18 17:37:59,594 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bfda5238-204d-4254-9ef9-cf7c7ff61a00/bin-2019/utaipan/data/135ca6d30/68ac1f16f07e4b51a943bf2db8c4267b/FLAG4556621a5 [2018-11-18 17:38:00,007 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:38:00,007 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bfda5238-204d-4254-9ef9-cf7c7ff61a00/sv-benchmarks/c/psyco/psyco_security_true-unreach-call_false-termination.c [2018-11-18 17:38:00,014 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bfda5238-204d-4254-9ef9-cf7c7ff61a00/bin-2019/utaipan/data/135ca6d30/68ac1f16f07e4b51a943bf2db8c4267b/FLAG4556621a5 [2018-11-18 17:38:00,022 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bfda5238-204d-4254-9ef9-cf7c7ff61a00/bin-2019/utaipan/data/135ca6d30/68ac1f16f07e4b51a943bf2db8c4267b [2018-11-18 17:38:00,025 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:38:00,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 17:38:00,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:38:00,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:38:00,030 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:38:00,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:38:00" (1/1) ... [2018-11-18 17:38:00,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e3deec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:38:00, skipping insertion in model container [2018-11-18 17:38:00,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:38:00" (1/1) ... [2018-11-18 17:38:00,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:38:00,065 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:38:00,182 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:38:00,185 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:38:00,206 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:38:00,214 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:38:00,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:38:00 WrapperNode [2018-11-18 17:38:00,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:38:00,215 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 17:38:00,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 17:38:00,215 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 17:38:00,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:38:00" (1/1) ... [2018-11-18 17:38:00,224 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:38:00" (1/1) ... [2018-11-18 17:38:00,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 17:38:00,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:38:00,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:38:00,230 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:38:00,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:38:00" (1/1) ... [2018-11-18 17:38:00,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:38:00" (1/1) ... [2018-11-18 17:38:00,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:38:00" (1/1) ... [2018-11-18 17:38:00,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:38:00" (1/1) ... [2018-11-18 17:38:00,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:38:00" (1/1) ... [2018-11-18 17:38:00,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:38:00" (1/1) ... [2018-11-18 17:38:00,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:38:00" (1/1) ... [2018-11-18 17:38:00,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:38:00,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:38:00,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:38:00,288 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:38:00,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:38:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfda5238-204d-4254-9ef9-cf7c7ff61a00/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-18 17:38:00,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 17:38:00,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 17:38:00,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:38:00,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:38:00,326 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 17:38:00,326 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 17:38:00,604 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:38:00,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:38:00 BoogieIcfgContainer [2018-11-18 17:38:00,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:38:00,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 17:38:00,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 17:38:00,607 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 17:38:00,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:38:00" (1/3) ... [2018-11-18 17:38:00,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587c2586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:38:00, skipping insertion in model container [2018-11-18 17:38:00,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:38:00" (2/3) ... [2018-11-18 17:38:00,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587c2586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:38:00, skipping insertion in model container [2018-11-18 17:38:00,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:38:00" (3/3) ... [2018-11-18 17:38:00,610 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_security_true-unreach-call_false-termination.c [2018-11-18 17:38:00,616 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 17:38:00,620 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 17:38:00,629 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 17:38:00,650 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 17:38:00,650 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 17:38:00,650 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 17:38:00,650 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 17:38:00,651 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 17:38:00,651 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 17:38:00,651 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 17:38:00,651 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 17:38:00,666 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2018-11-18 17:38:00,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 17:38:00,671 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:38:00,672 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:38:00,674 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:38:00,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:38:00,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1921368221, now seen corresponding path program 1 times [2018-11-18 17:38:00,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:38:00,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:38:00,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:38:00,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:38:00,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:38:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:38:00,758 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-18 17:38:00,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:38:00,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 17:38:00,760 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:38:00,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 17:38:00,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 17:38:00,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 17:38:00,772 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 2 states. [2018-11-18 17:38:00,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:38:00,788 INFO L93 Difference]: Finished difference Result 160 states and 298 transitions. [2018-11-18 17:38:00,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 17:38:00,789 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-18 17:38:00,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:38:00,796 INFO L225 Difference]: With dead ends: 160 [2018-11-18 17:38:00,796 INFO L226 Difference]: Without dead ends: 78 [2018-11-18 17:38:00,799 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 17:38:00,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-18 17:38:00,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-18 17:38:00,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-18 17:38:00,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 113 transitions. [2018-11-18 17:38:00,826 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 113 transitions. Word has length 13 [2018-11-18 17:38:00,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:38:00,826 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 113 transitions. [2018-11-18 17:38:00,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 17:38:00,827 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2018-11-18 17:38:00,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 17:38:00,827 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:38:00,827 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:38:00,828 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:38:00,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:38:00,828 INFO L82 PathProgramCache]: Analyzing trace with hash -34635363, now seen corresponding path program 1 times [2018-11-18 17:38:00,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:38:00,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:38:00,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:38:00,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:38:00,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:38:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:38:00,858 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-18 17:38:00,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:38:00,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:38:00,859 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:38:00,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:38:00,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:38:00,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:38:00,861 INFO L87 Difference]: Start difference. First operand 78 states and 113 transitions. Second operand 3 states. [2018-11-18 17:38:00,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:38:00,917 INFO L93 Difference]: Finished difference Result 153 states and 224 transitions. [2018-11-18 17:38:00,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:38:00,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-18 17:38:00,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:38:00,918 INFO L225 Difference]: With dead ends: 153 [2018-11-18 17:38:00,918 INFO L226 Difference]: Without dead ends: 81 [2018-11-18 17:38:00,919 INFO L604 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-18 17:38:00,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-18 17:38:00,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-18 17:38:00,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-18 17:38:00,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 116 transitions. [2018-11-18 17:38:00,924 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 116 transitions. Word has length 14 [2018-11-18 17:38:00,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:38:00,924 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 116 transitions. [2018-11-18 17:38:00,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:38:00,924 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2018-11-18 17:38:00,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 17:38:00,925 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:38:00,925 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:38:00,925 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:38:00,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:38:00,925 INFO L82 PathProgramCache]: Analyzing trace with hash -304388480, now seen corresponding path program 1 times [2018-11-18 17:38:00,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:38:00,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:38:00,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:38:00,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:38:00,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:38:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:38:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:38:00,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:38:00,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:38:00,965 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:38:00,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:38:00,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:38:00,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:38:00,966 INFO L87 Difference]: Start difference. First operand 81 states and 116 transitions. Second operand 3 states. [2018-11-18 17:38:00,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:38:01,000 INFO L93 Difference]: Finished difference Result 146 states and 213 transitions. [2018-11-18 17:38:01,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:38:01,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 17:38:01,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:38:01,001 INFO L225 Difference]: With dead ends: 146 [2018-11-18 17:38:01,001 INFO L226 Difference]: Without dead ends: 72 [2018-11-18 17:38:01,001 INFO L604 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-18 17:38:01,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-18 17:38:01,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-18 17:38:01,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-18 17:38:01,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2018-11-18 17:38:01,006 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 102 transitions. Word has length 19 [2018-11-18 17:38:01,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:38:01,007 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 102 transitions. [2018-11-18 17:38:01,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:38:01,007 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2018-11-18 17:38:01,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 17:38:01,008 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:38:01,008 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] [2018-11-18 17:38:01,008 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:38:01,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:38:01,008 INFO L82 PathProgramCache]: Analyzing trace with hash -512664072, now seen corresponding path program 1 times [2018-11-18 17:38:01,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:38:01,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:38:01,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:38:01,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:38:01,010 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:38:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:38:01,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:38:01,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:38:01,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:38:01,032 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:38:01,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:38:01,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:38:01,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:38:01,033 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. Second operand 3 states. [2018-11-18 17:38:01,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:38:01,099 INFO L93 Difference]: Finished difference Result 192 states and 280 transitions. [2018-11-18 17:38:01,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:38:01,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 17:38:01,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:38:01,100 INFO L225 Difference]: With dead ends: 192 [2018-11-18 17:38:01,100 INFO L226 Difference]: Without dead ends: 122 [2018-11-18 17:38:01,101 INFO L604 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-18 17:38:01,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-18 17:38:01,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2018-11-18 17:38:01,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-18 17:38:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2018-11-18 17:38:01,108 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 22 [2018-11-18 17:38:01,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:38:01,108 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2018-11-18 17:38:01,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:38:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2018-11-18 17:38:01,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 17:38:01,109 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:38:01,109 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] [2018-11-18 17:38:01,109 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:38:01,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:38:01,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1940953662, now seen corresponding path program 1 times [2018-11-18 17:38:01,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:38:01,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:38:01,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:38:01,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:38:01,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:38:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:38:01,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:38:01,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:38:01,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:38:01,143 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:38:01,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:38:01,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:38:01,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:38:01,144 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand 3 states. [2018-11-18 17:38:01,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:38:01,183 INFO L93 Difference]: Finished difference Result 183 states and 260 transitions. [2018-11-18 17:38:01,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:38:01,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 17:38:01,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:38:01,184 INFO L225 Difference]: With dead ends: 183 [2018-11-18 17:38:01,184 INFO L226 Difference]: Without dead ends: 87 [2018-11-18 17:38:01,184 INFO L604 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-18 17:38:01,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-18 17:38:01,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-11-18 17:38:01,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-18 17:38:01,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2018-11-18 17:38:01,190 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 23 [2018-11-18 17:38:01,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:38:01,190 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2018-11-18 17:38:01,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:38:01,190 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2018-11-18 17:38:01,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 17:38:01,191 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:38:01,191 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:38:01,191 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:38:01,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:38:01,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1172052595, now seen corresponding path program 1 times [2018-11-18 17:38:01,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:38:01,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:38:01,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:38:01,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:38:01,193 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:38:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:38:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 17:38:01,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:38:01,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:38:01,219 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:38:01,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:38:01,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:38:01,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:38:01,220 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand 3 states. [2018-11-18 17:38:01,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:38:01,242 INFO L93 Difference]: Finished difference Result 134 states and 190 transitions. [2018-11-18 17:38:01,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:38:01,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 17:38:01,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:38:01,243 INFO L225 Difference]: With dead ends: 134 [2018-11-18 17:38:01,243 INFO L226 Difference]: Without dead ends: 70 [2018-11-18 17:38:01,243 INFO L604 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-18 17:38:01,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-18 17:38:01,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-18 17:38:01,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-18 17:38:01,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2018-11-18 17:38:01,248 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 29 [2018-11-18 17:38:01,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:38:01,248 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2018-11-18 17:38:01,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:38:01,248 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2018-11-18 17:38:01,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 17:38:01,249 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:38:01,249 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:38:01,249 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:38:01,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:38:01,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1320221367, now seen corresponding path program 1 times [2018-11-18 17:38:01,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:38:01,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:38:01,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:38:01,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:38:01,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:38:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:38:01,273 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 17:38:01,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:38:01,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:38:01,273 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:38:01,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:38:01,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:38:01,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:38:01,274 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand 3 states. [2018-11-18 17:38:01,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:38:01,325 INFO L93 Difference]: Finished difference Result 158 states and 228 transitions. [2018-11-18 17:38:01,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:38:01,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 17:38:01,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:38:01,326 INFO L225 Difference]: With dead ends: 158 [2018-11-18 17:38:01,326 INFO L226 Difference]: Without dead ends: 111 [2018-11-18 17:38:01,327 INFO L604 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-18 17:38:01,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-18 17:38:01,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2018-11-18 17:38:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-18 17:38:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2018-11-18 17:38:01,334 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 30 [2018-11-18 17:38:01,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:38:01,334 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2018-11-18 17:38:01,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:38:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2018-11-18 17:38:01,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 17:38:01,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:38:01,336 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:38:01,336 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:38:01,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:38:01,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1121323394, now seen corresponding path program 1 times [2018-11-18 17:38:01,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:38:01,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:38:01,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:38:01,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:38:01,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:38:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:38:01,369 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 17:38:01,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:38:01,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:38:01,370 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:38:01,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:38:01,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:38:01,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:38:01,371 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand 3 states. [2018-11-18 17:38:01,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:38:01,409 INFO L93 Difference]: Finished difference Result 166 states and 232 transitions. [2018-11-18 17:38:01,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:38:01,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 17:38:01,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:38:01,410 INFO L225 Difference]: With dead ends: 166 [2018-11-18 17:38:01,410 INFO L226 Difference]: Without dead ends: 92 [2018-11-18 17:38:01,411 INFO L604 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-18 17:38:01,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-18 17:38:01,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-18 17:38:01,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-18 17:38:01,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 120 transitions. [2018-11-18 17:38:01,416 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 120 transitions. Word has length 31 [2018-11-18 17:38:01,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:38:01,416 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 120 transitions. [2018-11-18 17:38:01,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:38:01,417 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2018-11-18 17:38:01,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 17:38:01,421 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:38:01,421 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:38:01,421 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:38:01,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:38:01,421 INFO L82 PathProgramCache]: Analyzing trace with hash -984969239, now seen corresponding path program 1 times [2018-11-18 17:38:01,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:38:01,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:38:01,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:38:01,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:38:01,422 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:38:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:38:01,445 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 17:38:01,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:38:01,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:38:01,446 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:38:01,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:38:01,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:38:01,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:38:01,446 INFO L87 Difference]: Start difference. First operand 92 states and 120 transitions. Second operand 3 states. [2018-11-18 17:38:01,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:38:01,478 INFO L93 Difference]: Finished difference Result 139 states and 184 transitions. [2018-11-18 17:38:01,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:38:01,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 17:38:01,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:38:01,478 INFO L225 Difference]: With dead ends: 139 [2018-11-18 17:38:01,478 INFO L226 Difference]: Without dead ends: 72 [2018-11-18 17:38:01,479 INFO L604 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-18 17:38:01,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-18 17:38:01,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-18 17:38:01,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-18 17:38:01,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2018-11-18 17:38:01,482 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 31 [2018-11-18 17:38:01,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:38:01,483 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2018-11-18 17:38:01,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:38:01,483 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2018-11-18 17:38:01,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 17:38:01,484 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:38:01,484 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:38:01,484 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:38:01,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:38:01,484 INFO L82 PathProgramCache]: Analyzing trace with hash 885900628, now seen corresponding path program 1 times [2018-11-18 17:38:01,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:38:01,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:38:01,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:38:01,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:38:01,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:38:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:38:01,513 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 17:38:01,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:38:01,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:38:01,514 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:38:01,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:38:01,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:38:01,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:38:01,515 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand 3 states. [2018-11-18 17:38:01,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:38:01,548 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2018-11-18 17:38:01,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:38:01,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 17:38:01,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:38:01,549 INFO L225 Difference]: With dead ends: 74 [2018-11-18 17:38:01,549 INFO L226 Difference]: Without dead ends: 70 [2018-11-18 17:38:01,550 INFO L604 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-18 17:38:01,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-18 17:38:01,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-18 17:38:01,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-18 17:38:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2018-11-18 17:38:01,554 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 32 [2018-11-18 17:38:01,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:38:01,554 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2018-11-18 17:38:01,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:38:01,554 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2018-11-18 17:38:01,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 17:38:01,555 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:38:01,555 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:38:01,555 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:38:01,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:38:01,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1704565915, now seen corresponding path program 1 times [2018-11-18 17:38:01,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:38:01,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:38:01,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:38:01,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:38:01,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:38:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:38:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 17:38:01,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:38:01,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:38:01,582 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:38:01,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:38:01,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:38:01,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:38:01,583 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 3 states. [2018-11-18 17:38:01,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:38:01,603 INFO L93 Difference]: Finished difference Result 111 states and 143 transitions. [2018-11-18 17:38:01,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:38:01,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 17:38:01,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:38:01,604 INFO L225 Difference]: With dead ends: 111 [2018-11-18 17:38:01,604 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 17:38:01,604 INFO L604 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-18 17:38:01,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 17:38:01,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 17:38:01,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 17:38:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 17:38:01,605 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-11-18 17:38:01,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:38:01,605 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 17:38:01,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:38:01,605 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 17:38:01,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 17:38:01,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 17:38:01,668 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 17:38:01,668 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-18 17:38:01,668 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:38:01,668 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:38:01,668 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 17:38:01,668 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 17:38:01,669 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 17:38:01,669 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 331) no Hoare annotation was computed. [2018-11-18 17:38:01,669 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 382) no Hoare annotation was computed. [2018-11-18 17:38:01,669 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 261) no Hoare annotation was computed. [2018-11-18 17:38:01,669 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 13 390) no Hoare annotation was computed. [2018-11-18 17:38:01,669 INFO L425 ceAbstractionStarter]: For program point L184(lines 184 199) no Hoare annotation was computed. [2018-11-18 17:38:01,669 INFO L425 ceAbstractionStarter]: For program point L118(lines 118 129) no Hoare annotation was computed. [2018-11-18 17:38:01,669 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 377) no Hoare annotation was computed. [2018-11-18 17:38:01,669 INFO L425 ceAbstractionStarter]: For program point L300(lines 300 315) no Hoare annotation was computed. [2018-11-18 17:38:01,669 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 245) no Hoare annotation was computed. [2018-11-18 17:38:01,669 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 113) no Hoare annotation was computed. [2018-11-18 17:38:01,670 INFO L425 ceAbstractionStarter]: For program point L350(lines 350 361) no Hoare annotation was computed. [2018-11-18 17:38:01,670 INFO L425 ceAbstractionStarter]: For program point L284(lines 284 299) no Hoare annotation was computed. [2018-11-18 17:38:01,670 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 229) no Hoare annotation was computed. [2018-11-18 17:38:01,670 INFO L425 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2018-11-18 17:38:01,670 INFO L425 ceAbstractionStarter]: For program point L334(lines 334 345) no Hoare annotation was computed. [2018-11-18 17:38:01,670 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 213) no Hoare annotation was computed. [2018-11-18 17:38:01,670 INFO L425 ceAbstractionStarter]: For program point L70(lines 70 72) no Hoare annotation was computed. [2018-11-18 17:38:01,670 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 329) no Hoare annotation was computed. [2018-11-18 17:38:01,670 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 197) no Hoare annotation was computed. [2018-11-18 17:38:01,670 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 56) no Hoare annotation was computed. [2018-11-18 17:38:01,670 INFO L425 ceAbstractionStarter]: For program point L302(lines 302 313) no Hoare annotation was computed. [2018-11-18 17:38:01,670 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 13 390) no Hoare annotation was computed. [2018-11-18 17:38:01,671 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 172) no Hoare annotation was computed. [2018-11-18 17:38:01,671 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 297) no Hoare annotation was computed. [2018-11-18 17:38:01,671 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 156) no Hoare annotation was computed. [2018-11-18 17:38:01,671 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 389) no Hoare annotation was computed. [2018-11-18 17:38:01,671 INFO L421 ceAbstractionStarter]: At program point L22-3(lines 22 385) the Hoare annotation is: (or (and (<= main_~this_state~0 0) (= main_~q~0 0)) (and (= main_~this_state~0 3) (<= 4 main_~q~0))) [2018-11-18 17:38:01,671 INFO L425 ceAbstractionStarter]: For program point L22-4(lines 22 385) no Hoare annotation was computed. [2018-11-18 17:38:01,671 INFO L425 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2018-11-18 17:38:01,671 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 140) no Hoare annotation was computed. [2018-11-18 17:38:01,672 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2018-11-18 17:38:01,672 INFO L425 ceAbstractionStarter]: For program point L122(lines 122 124) no Hoare annotation was computed. [2018-11-18 17:38:01,672 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 372) no Hoare annotation was computed. [2018-11-18 17:38:01,672 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 240) no Hoare annotation was computed. [2018-11-18 17:38:01,672 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 108) no Hoare annotation was computed. [2018-11-18 17:38:01,672 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 356) no Hoare annotation was computed. [2018-11-18 17:38:01,672 INFO L425 ceAbstractionStarter]: For program point L222(lines 222 224) no Hoare annotation was computed. [2018-11-18 17:38:01,672 INFO L421 ceAbstractionStarter]: At program point L371(lines 13 390) the Hoare annotation is: false [2018-11-18 17:38:01,672 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 340) no Hoare annotation was computed. [2018-11-18 17:38:01,672 INFO L425 ceAbstractionStarter]: For program point L206(lines 206 208) no Hoare annotation was computed. [2018-11-18 17:38:01,672 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 324) no Hoare annotation was computed. [2018-11-18 17:38:01,673 INFO L425 ceAbstractionStarter]: For program point L190(lines 190 192) no Hoare annotation was computed. [2018-11-18 17:38:01,673 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 308) no Hoare annotation was computed. [2018-11-18 17:38:01,673 INFO L425 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2018-11-18 17:38:01,673 INFO L425 ceAbstractionStarter]: For program point L27(lines 27 46) no Hoare annotation was computed. [2018-11-18 17:38:01,673 INFO L425 ceAbstractionStarter]: For program point L28(lines 28 43) no Hoare annotation was computed. [2018-11-18 17:38:01,673 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 41) no Hoare annotation was computed. [2018-11-18 17:38:01,673 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 13 390) the Hoare annotation is: true [2018-11-18 17:38:01,673 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 95) no Hoare annotation was computed. [2018-11-18 17:38:01,673 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 98) no Hoare annotation was computed. [2018-11-18 17:38:01,673 INFO L425 ceAbstractionStarter]: For program point L64(lines 64 79) no Hoare annotation was computed. [2018-11-18 17:38:01,673 INFO L425 ceAbstractionStarter]: For program point L48(lines 48 63) no Hoare annotation was computed. [2018-11-18 17:38:01,673 INFO L425 ceAbstractionStarter]: For program point L164(lines 164 179) no Hoare annotation was computed. [2018-11-18 17:38:01,674 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 163) no Hoare annotation was computed. [2018-11-18 17:38:01,674 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 93) no Hoare annotation was computed. [2018-11-18 17:38:01,674 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 279) no Hoare annotation was computed. [2018-11-18 17:38:01,674 INFO L425 ceAbstractionStarter]: For program point L132(lines 132 147) no Hoare annotation was computed. [2018-11-18 17:38:01,674 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 182) no Hoare annotation was computed. [2018-11-18 17:38:01,674 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 77) no Hoare annotation was computed. [2018-11-18 17:38:01,674 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 263) no Hoare annotation was computed. [2018-11-18 17:38:01,674 INFO L425 ceAbstractionStarter]: For program point L116(lines 116 131) no Hoare annotation was computed. [2018-11-18 17:38:01,674 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 61) no Hoare annotation was computed. [2018-11-18 17:38:01,674 INFO L425 ceAbstractionStarter]: For program point L364(lines 364 379) no Hoare annotation was computed. [2018-11-18 17:38:01,674 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 247) no Hoare annotation was computed. [2018-11-18 17:38:01,674 INFO L425 ceAbstractionStarter]: For program point L166(lines 166 177) no Hoare annotation was computed. [2018-11-18 17:38:01,675 INFO L425 ceAbstractionStarter]: For program point L100(lines 100 115) no Hoare annotation was computed. [2018-11-18 17:38:01,675 INFO L425 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2018-11-18 17:38:01,675 INFO L421 ceAbstractionStarter]: At program point L381(lines 22 385) the Hoare annotation is: (let ((.cse0 (<= main_~this_state~0 0))) (or (and .cse0 (= main_~q~0 2)) (and (= main_~q~0 3) (= main_~this_state~0 2)) (and .cse0 (= main_~q~0 0)) (and (= main_~this_state~0 3) (<= 4 main_~q~0)))) [2018-11-18 17:38:01,675 INFO L425 ceAbstractionStarter]: For program point L348(lines 348 363) no Hoare annotation was computed. [2018-11-18 17:38:01,675 INFO L425 ceAbstractionStarter]: For program point L216(lines 216 231) no Hoare annotation was computed. [2018-11-18 17:38:01,675 INFO L425 ceAbstractionStarter]: For program point L183(lines 183 282) no Hoare annotation was computed. [2018-11-18 17:38:01,675 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 161) no Hoare annotation was computed. [2018-11-18 17:38:01,675 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 347) no Hoare annotation was computed. [2018-11-18 17:38:01,675 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 277) no Hoare annotation was computed. [2018-11-18 17:38:01,676 INFO L425 ceAbstractionStarter]: For program point L200(lines 200 215) no Hoare annotation was computed. [2018-11-18 17:38:01,676 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 145) no Hoare annotation was computed. [2018-11-18 17:38:01,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 05:38:01 BoogieIcfgContainer [2018-11-18 17:38:01,690 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 17:38:01,690 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 17:38:01,690 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 17:38:01,691 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 17:38:01,691 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:38:00" (3/4) ... [2018-11-18 17:38:01,694 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 17:38:01,698 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 17:38:01,698 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 17:38:01,704 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-18 17:38:01,704 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 17:38:01,729 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bfda5238-204d-4254-9ef9-cf7c7ff61a00/bin-2019/utaipan/witness.graphml [2018-11-18 17:38:01,729 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 17:38:01,730 INFO L168 Benchmark]: Toolchain (without parser) took 1704.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 957.0 MB in the beginning and 974.6 MB in the end (delta: -17.6 MB). Peak memory consumption was 153.8 MB. Max. memory is 11.5 GB. [2018-11-18 17:38:01,731 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:38:01,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 188.06 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 943.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 17:38:01,732 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.93 ms. Allocated memory is still 1.0 GB. Free memory was 943.6 MB in the beginning and 940.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 17:38:01,733 INFO L168 Benchmark]: Boogie Preprocessor took 57.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 940.9 MB in the beginning and 1.2 GB in the end (delta: -226.0 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-18 17:38:01,733 INFO L168 Benchmark]: RCFGBuilder took 316.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2018-11-18 17:38:01,734 INFO L168 Benchmark]: TraceAbstraction took 1084.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 977.8 MB in the end (delta: 159.2 MB). Peak memory consumption was 159.2 MB. Max. memory is 11.5 GB. [2018-11-18 17:38:01,734 INFO L168 Benchmark]: Witness Printer took 39.21 ms. Allocated memory is still 1.2 GB. Free memory was 977.8 MB in the beginning and 974.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-18 17:38:01,737 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 188.06 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 943.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.93 ms. Allocated memory is still 1.0 GB. Free memory was 943.6 MB in the beginning and 940.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 940.9 MB in the beginning and 1.2 GB in the end (delta: -226.0 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 316.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1084.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 977.8 MB in the end (delta: 159.2 MB). Peak memory consumption was 159.2 MB. Max. memory is 11.5 GB. * Witness Printer took 39.21 ms. Allocated memory is still 1.2 GB. Free memory was 977.8 MB in the beginning and 974.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 389]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((this_state <= 0 && q == 2) || (q == 3 && this_state == 2)) || (this_state <= 0 && q == 0)) || (this_state == 3 && 4 <= q) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (this_state <= 0 && q == 0) || (this_state == 3 && 4 <= q) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 83 locations, 1 error locations. SAFE Result, 1.0s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1008 SDtfs, 337 SDslu, 455 SDs, 0 SdLazy, 217 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 28 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 13 NumberOfFragments, 49 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 27 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 10566 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 55/55 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...