./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Ackermann04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_62eb46ad-ae1e-4d32-a3fd-fe60aa31a283/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_62eb46ad-ae1e-4d32-a3fd-fe60aa31a283/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_62eb46ad-ae1e-4d32-a3fd-fe60aa31a283/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_62eb46ad-ae1e-4d32-a3fd-fe60aa31a283/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Ackermann04.c -s /tmp/vcloud-vcloud-master/worker/run_dir_62eb46ad-ae1e-4d32-a3fd-fe60aa31a283/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_62eb46ad-ae1e-4d32-a3fd-fe60aa31a283/bin/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 307542ef0214b83df72c59e51df6e57e6557ac8b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 13:35:08,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:35:08,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:35:08,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:35:08,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:35:08,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:35:08,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:35:08,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:35:08,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:35:08,972 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:35:08,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:35:08,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:35:08,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:35:08,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:35:08,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:35:08,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:35:08,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:35:08,977 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:35:08,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:35:08,980 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:35:08,981 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:35:08,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:35:08,982 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:35:08,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:35:08,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:35:08,984 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:35:08,984 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:35:08,985 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:35:08,985 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:35:08,986 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:35:08,986 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:35:08,986 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:35:08,987 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:35:08,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:35:08,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:35:08,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:35:08,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:35:08,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:35:08,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:35:08,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:35:08,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:35:08,990 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_62eb46ad-ae1e-4d32-a3fd-fe60aa31a283/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 13:35:08,999 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:35:08,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:35:09,000 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:35:09,000 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:35:09,000 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:35:09,000 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:35:09,000 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 13:35:09,000 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:35:09,000 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:35:09,001 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 13:35:09,001 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 13:35:09,001 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:35:09,001 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 13:35:09,001 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 13:35:09,001 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 13:35:09,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:35:09,002 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:35:09,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:35:09,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:35:09,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:35:09,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:35:09,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:35:09,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:35:09,002 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:35:09,003 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:35:09,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:35:09,003 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:35:09,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:35:09,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:35:09,003 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:35:09,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:35:09,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:35:09,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:35:09,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:35:09,004 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:35:09,004 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 13:35:09,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:35:09,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:35:09,004 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:35:09,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:35:09,004 INFO L138 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/run_dir_62eb46ad-ae1e-4d32-a3fd-fe60aa31a283/bin/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 -> 307542ef0214b83df72c59e51df6e57e6557ac8b [2019-12-07 13:35:09,102 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:35:09,109 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:35:09,112 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:35:09,114 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:35:09,114 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:35:09,114 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_62eb46ad-ae1e-4d32-a3fd-fe60aa31a283/bin/utaipan/../../sv-benchmarks/c/recursive/Ackermann04.c [2019-12-07 13:35:09,157 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_62eb46ad-ae1e-4d32-a3fd-fe60aa31a283/bin/utaipan/data/b9b030f8e/3f54a6e6da8b425fb52274448762b1db/FLAGbc67df0a0 [2019-12-07 13:35:09,521 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:35:09,521 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_62eb46ad-ae1e-4d32-a3fd-fe60aa31a283/sv-benchmarks/c/recursive/Ackermann04.c [2019-12-07 13:35:09,525 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_62eb46ad-ae1e-4d32-a3fd-fe60aa31a283/bin/utaipan/data/b9b030f8e/3f54a6e6da8b425fb52274448762b1db/FLAGbc67df0a0 [2019-12-07 13:35:09,933 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_62eb46ad-ae1e-4d32-a3fd-fe60aa31a283/bin/utaipan/data/b9b030f8e/3f54a6e6da8b425fb52274448762b1db [2019-12-07 13:35:09,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:35:09,939 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:35:09,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:35:09,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:35:09,942 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:35:09,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:35:09" (1/1) ... [2019-12-07 13:35:09,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a9a3eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:09, skipping insertion in model container [2019-12-07 13:35:09,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:35:09" (1/1) ... [2019-12-07 13:35:09,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:35:09,968 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:35:10,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:35:10,075 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:35:10,085 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:35:10,129 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:35:10,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:10 WrapperNode [2019-12-07 13:35:10,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:35:10,130 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:35:10,130 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:35:10,130 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:35:10,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:10" (1/1) ... [2019-12-07 13:35:10,143 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:10" (1/1) ... [2019-12-07 13:35:10,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:35:10,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:35:10,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:35:10,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:35:10,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:10" (1/1) ... [2019-12-07 13:35:10,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:10" (1/1) ... [2019-12-07 13:35:10,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:10" (1/1) ... [2019-12-07 13:35:10,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:10" (1/1) ... [2019-12-07 13:35:10,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:10" (1/1) ... [2019-12-07 13:35:10,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:10" (1/1) ... [2019-12-07 13:35:10,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:10" (1/1) ... [2019-12-07 13:35:10,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:35:10,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:35:10,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:35:10,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:35:10,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62eb46ad-ae1e-4d32-a3fd-fe60aa31a283/bin/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 [2019-12-07 13:35:10,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:35:10,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:35:10,220 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2019-12-07 13:35:10,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2019-12-07 13:35:10,339 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:35:10,340 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 13:35:10,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:35:10 BoogieIcfgContainer [2019-12-07 13:35:10,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:35:10,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:35:10,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:35:10,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:35:10,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:35:09" (1/3) ... [2019-12-07 13:35:10,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b0138cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:35:10, skipping insertion in model container [2019-12-07 13:35:10,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:10" (2/3) ... [2019-12-07 13:35:10,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b0138cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:35:10, skipping insertion in model container [2019-12-07 13:35:10,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:35:10" (3/3) ... [2019-12-07 13:35:10,345 INFO L109 eAbstractionObserver]: Analyzing ICFG Ackermann04.c [2019-12-07 13:35:10,352 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:35:10,356 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 13:35:10,363 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 13:35:10,378 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:35:10,378 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:35:10,378 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:35:10,378 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:35:10,378 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:35:10,378 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:35:10,378 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:35:10,379 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:35:10,389 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-12-07 13:35:10,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 13:35:10,393 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:10,393 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:35:10,394 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:35:10,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:10,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1260755674, now seen corresponding path program 1 times [2019-12-07 13:35:10,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:10,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286180965] [2019-12-07 13:35:10,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:10,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:35:10,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286180965] [2019-12-07 13:35:10,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:35:10,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:35:10,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505209180] [2019-12-07 13:35:10,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:35:10,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:35:10,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:35:10,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:35:10,541 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2019-12-07 13:35:10,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:10,617 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-12-07 13:35:10,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:35:10,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 13:35:10,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:10,627 INFO L225 Difference]: With dead ends: 47 [2019-12-07 13:35:10,628 INFO L226 Difference]: Without dead ends: 24 [2019-12-07 13:35:10,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:35:10,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-07 13:35:10,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-07 13:35:10,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 13:35:10,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2019-12-07 13:35:10,663 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 11 [2019-12-07 13:35:10,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:10,664 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-12-07 13:35:10,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:35:10,664 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2019-12-07 13:35:10,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:35:10,665 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:10,665 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:35:10,665 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:35:10,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:10,666 INFO L82 PathProgramCache]: Analyzing trace with hash 963920485, now seen corresponding path program 1 times [2019-12-07 13:35:10,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:10,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377288560] [2019-12-07 13:35:10,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 13:35:10,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377288560] [2019-12-07 13:35:10,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769576922] [2019-12-07 13:35:10,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62eb46ad-ae1e-4d32-a3fd-fe60aa31a283/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:35:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:10,765 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:35:10,769 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:35:10,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 13:35:10,808 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:35:10,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 13:35:10,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1290945063] [2019-12-07 13:35:10,883 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 13:35:10,884 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:35:10,889 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 13:35:10,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:35:10,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 14 [2019-12-07 13:35:10,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984952957] [2019-12-07 13:35:10,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 13:35:10,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:35:10,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 13:35:10,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:35:10,892 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 14 states. [2019-12-07 13:35:11,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:11,215 INFO L93 Difference]: Finished difference Result 91 states and 171 transitions. [2019-12-07 13:35:11,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 13:35:11,216 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-12-07 13:35:11,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:11,219 INFO L225 Difference]: With dead ends: 91 [2019-12-07 13:35:11,219 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 13:35:11,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2019-12-07 13:35:11,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 13:35:11,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2019-12-07 13:35:11,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 13:35:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 104 transitions. [2019-12-07 13:35:11,237 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 104 transitions. Word has length 18 [2019-12-07 13:35:11,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:11,237 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 104 transitions. [2019-12-07 13:35:11,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 13:35:11,237 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2019-12-07 13:35:11,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 13:35:11,240 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:11,240 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:35:11,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:35:11,441 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:35:11,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:11,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1827824897, now seen corresponding path program 1 times [2019-12-07 13:35:11,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:11,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564699235] [2019-12-07 13:35:11,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-07 13:35:11,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564699235] [2019-12-07 13:35:11,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229000473] [2019-12-07 13:35:11,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62eb46ad-ae1e-4d32-a3fd-fe60aa31a283/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:35:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:11,628 INFO L264 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 13:35:11,630 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:35:11,645 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-07 13:35:11,645 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:35:11,960 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 13:35:11,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1558679805] [2019-12-07 13:35:11,962 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-12-07 13:35:11,962 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:35:11,963 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 13:35:11,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:35:11,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 10 [2019-12-07 13:35:11,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535041481] [2019-12-07 13:35:11,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:35:11,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:35:11,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:35:11,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:35:11,964 INFO L87 Difference]: Start difference. First operand 62 states and 104 transitions. Second operand 10 states. [2019-12-07 13:35:12,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:12,033 INFO L93 Difference]: Finished difference Result 101 states and 180 transitions. [2019-12-07 13:35:12,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:35:12,034 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-12-07 13:35:12,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:12,038 INFO L225 Difference]: With dead ends: 101 [2019-12-07 13:35:12,038 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 13:35:12,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 12 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:35:12,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 13:35:12,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-12-07 13:35:12,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 13:35:12,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 176 transitions. [2019-12-07 13:35:12,056 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 176 transitions. Word has length 44 [2019-12-07 13:35:12,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:12,056 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 176 transitions. [2019-12-07 13:35:12,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:35:12,056 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 176 transitions. [2019-12-07 13:35:12,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 13:35:12,063 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:12,063 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 11, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:35:12,263 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:35:12,264 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:35:12,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:12,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1403295600, now seen corresponding path program 2 times [2019-12-07 13:35:12,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:12,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229176895] [2019-12-07 13:35:12,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:12,809 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 44 proven. 447 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2019-12-07 13:35:12,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229176895] [2019-12-07 13:35:12,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924087593] [2019-12-07 13:35:12,809 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62eb46ad-ae1e-4d32-a3fd-fe60aa31a283/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:35:12,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-12-07 13:35:12,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:35:12,866 INFO L264 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 13:35:12,871 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:35:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 182 proven. 101 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2019-12-07 13:35:13,092 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:35:14,466 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 202 proven. 86 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-12-07 13:35:14,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1796568950] [2019-12-07 13:35:14,468 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-12-07 13:35:14,468 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:35:14,468 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 13:35:14,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:35:14,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 12, 15] total 55 [2019-12-07 13:35:14,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798579093] [2019-12-07 13:35:14,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-12-07 13:35:14,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:35:14,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-12-07 13:35:14,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2813, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 13:35:14,471 INFO L87 Difference]: Start difference. First operand 97 states and 176 transitions. Second operand 55 states. [2019-12-07 13:35:17,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:17,449 INFO L93 Difference]: Finished difference Result 329 states and 921 transitions. [2019-12-07 13:35:17,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 13:35:17,449 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 118 [2019-12-07 13:35:17,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:17,456 INFO L225 Difference]: With dead ends: 329 [2019-12-07 13:35:17,456 INFO L226 Difference]: Without dead ends: 236 [2019-12-07 13:35:17,463 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 227 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1043, Invalid=6439, Unknown=0, NotChecked=0, Total=7482 [2019-12-07 13:35:17,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-12-07 13:35:17,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 141. [2019-12-07 13:35:17,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 13:35:17,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 257 transitions. [2019-12-07 13:35:17,497 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 257 transitions. Word has length 118 [2019-12-07 13:35:17,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:17,498 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 257 transitions. [2019-12-07 13:35:17,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-12-07 13:35:17,498 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 257 transitions. [2019-12-07 13:35:17,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 13:35:17,503 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:17,503 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 10, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:35:17,704 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:35:17,704 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:35:17,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:17,705 INFO L82 PathProgramCache]: Analyzing trace with hash 124620878, now seen corresponding path program 3 times [2019-12-07 13:35:17,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:17,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021924715] [2019-12-07 13:35:17,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 164 proven. 247 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-12-07 13:35:17,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021924715] [2019-12-07 13:35:17,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596169964] [2019-12-07 13:35:17,946 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62eb46ad-ae1e-4d32-a3fd-fe60aa31a283/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:35:18,021 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 13:35:18,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:35:18,023 INFO L264 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 13:35:18,026 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:35:18,046 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 236 proven. 115 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-12-07 13:35:18,046 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:35:18,950 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 252 proven. 113 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2019-12-07 13:35:18,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2059159420] [2019-12-07 13:35:18,952 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-12-07 13:35:18,952 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:35:18,952 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 13:35:18,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:35:18,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 16] total 26 [2019-12-07 13:35:18,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724204201] [2019-12-07 13:35:18,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 13:35:18,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:35:18,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 13:35:18,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2019-12-07 13:35:18,954 INFO L87 Difference]: Start difference. First operand 141 states and 257 transitions. Second operand 26 states. [2019-12-07 13:35:19,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:19,916 INFO L93 Difference]: Finished difference Result 452 states and 1152 transitions. [2019-12-07 13:35:19,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-07 13:35:19,916 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2019-12-07 13:35:19,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:19,923 INFO L225 Difference]: With dead ends: 452 [2019-12-07 13:35:19,923 INFO L226 Difference]: Without dead ends: 343 [2019-12-07 13:35:19,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 225 SyntacticMatches, 18 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1437 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=4353, Unknown=0, NotChecked=0, Total=5256 [2019-12-07 13:35:19,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-12-07 13:35:19,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 281. [2019-12-07 13:35:19,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-12-07 13:35:19,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 605 transitions. [2019-12-07 13:35:19,968 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 605 transitions. Word has length 117 [2019-12-07 13:35:19,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:19,968 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 605 transitions. [2019-12-07 13:35:19,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 13:35:19,968 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 605 transitions. [2019-12-07 13:35:19,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-12-07 13:35:19,977 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:19,977 INFO L410 BasicCegarLoop]: trace histogram [29, 29, 17, 12, 11, 11, 11, 11, 11, 11, 11, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:35:20,177 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:35:20,178 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:35:20,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:20,179 INFO L82 PathProgramCache]: Analyzing trace with hash -832617454, now seen corresponding path program 4 times [2019-12-07 13:35:20,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:20,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500222579] [2019-12-07 13:35:20,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:21,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2010 backedges. 233 proven. 1291 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2019-12-07 13:35:21,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500222579] [2019-12-07 13:35:21,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018683627] [2019-12-07 13:35:21,153 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62eb46ad-ae1e-4d32-a3fd-fe60aa31a283/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:35:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:21,233 INFO L264 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 13:35:21,236 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:35:21,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2010 backedges. 736 proven. 9 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-12-07 13:35:21,289 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:35:21,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2010 backedges. 149 proven. 450 refuted. 0 times theorem prover too weak. 1411 trivial. 0 not checked. [2019-12-07 13:35:21,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [535130903] [2019-12-07 13:35:21,950 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-12-07 13:35:21,950 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:35:21,951 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 13:35:21,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:35:21,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 6, 7] total 56 [2019-12-07 13:35:21,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103783272] [2019-12-07 13:35:21,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-12-07 13:35:21,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:35:21,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-12-07 13:35:21,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2941, Unknown=0, NotChecked=0, Total=3080 [2019-12-07 13:35:21,954 INFO L87 Difference]: Start difference. First operand 281 states and 605 transitions. Second operand 56 states. [2019-12-07 13:35:30,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:30,118 INFO L93 Difference]: Finished difference Result 728 states and 2717 transitions. [2019-12-07 13:35:30,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-12-07 13:35:30,118 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 196 [2019-12-07 13:35:30,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:30,138 INFO L225 Difference]: With dead ends: 728 [2019-12-07 13:35:30,138 INFO L226 Difference]: Without dead ends: 460 [2019-12-07 13:35:30,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 404 SyntacticMatches, 5 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4975 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=3290, Invalid=18762, Unknown=0, NotChecked=0, Total=22052 [2019-12-07 13:35:30,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-12-07 13:35:30,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 272. [2019-12-07 13:35:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-12-07 13:35:30,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 831 transitions. [2019-12-07 13:35:30,225 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 831 transitions. Word has length 196 [2019-12-07 13:35:30,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:30,225 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 831 transitions. [2019-12-07 13:35:30,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-12-07 13:35:30,225 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 831 transitions. [2019-12-07 13:35:30,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-12-07 13:35:30,231 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:30,231 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 14, 11, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:35:30,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:35:30,432 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:35:30,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:30,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1768194034, now seen corresponding path program 5 times [2019-12-07 13:35:30,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:30,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630307656] [2019-12-07 13:35:30,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2019-12-07 13:35:30,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630307656] [2019-12-07 13:35:30,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782095675] [2019-12-07 13:35:30,677 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62eb46ad-ae1e-4d32-a3fd-fe60aa31a283/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:35:30,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-12-07 13:35:30,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:35:30,756 INFO L264 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-07 13:35:30,759 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:35:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2019-12-07 13:35:30,785 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:35:33,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 525 proven. 384 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2019-12-07 13:35:33,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [884313011] [2019-12-07 13:35:33,612 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-12-07 13:35:33,612 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:35:33,612 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 13:35:33,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:35:33,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 28] total 30 [2019-12-07 13:35:33,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399897052] [2019-12-07 13:35:33,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 13:35:33,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:35:33,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 13:35:33,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2019-12-07 13:35:33,614 INFO L87 Difference]: Start difference. First operand 272 states and 831 transitions. Second operand 30 states. [2019-12-07 13:35:34,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:34,245 INFO L93 Difference]: Finished difference Result 668 states and 3408 transitions. [2019-12-07 13:35:34,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-07 13:35:34,245 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 169 [2019-12-07 13:35:34,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:34,255 INFO L225 Difference]: With dead ends: 668 [2019-12-07 13:35:34,255 INFO L226 Difference]: Without dead ends: 409 [2019-12-07 13:35:34,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 310 SyntacticMatches, 32 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1241 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=921, Invalid=3501, Unknown=0, NotChecked=0, Total=4422 [2019-12-07 13:35:34,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-12-07 13:35:34,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 384. [2019-12-07 13:35:34,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-12-07 13:35:34,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1089 transitions. [2019-12-07 13:35:34,320 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1089 transitions. Word has length 169 [2019-12-07 13:35:34,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:34,320 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 1089 transitions. [2019-12-07 13:35:34,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 13:35:34,320 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1089 transitions. [2019-12-07 13:35:34,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-12-07 13:35:34,326 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:34,326 INFO L410 BasicCegarLoop]: trace histogram [27, 27, 15, 12, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:35:34,526 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:35:34,527 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:35:34,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:34,527 INFO L82 PathProgramCache]: Analyzing trace with hash -728546296, now seen corresponding path program 6 times [2019-12-07 13:35:34,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:34,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046359543] [2019-12-07 13:35:34,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:34,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 657 proven. 84 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2019-12-07 13:35:34,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046359543] [2019-12-07 13:35:34,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258378606] [2019-12-07 13:35:34,759 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_62eb46ad-ae1e-4d32-a3fd-fe60aa31a283/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:35:34,870 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 13:35:34,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:35:34,871 INFO L264 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-07 13:35:34,874 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:35:34,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 657 proven. 84 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2019-12-07 13:35:34,898 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:35:38,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 711 proven. 75 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2019-12-07 13:35:38,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [165173627] [2019-12-07 13:35:38,857 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-12-07 13:35:38,857 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:35:38,857 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 13:35:38,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:35:38,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 33] total 35 [2019-12-07 13:35:38,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336318148] [2019-12-07 13:35:38,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-07 13:35:38,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:35:38,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-07 13:35:38,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1055, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 13:35:38,859 INFO L87 Difference]: Start difference. First operand 384 states and 1089 transitions. Second operand 35 states. [2019-12-07 13:35:40,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:40,525 INFO L93 Difference]: Finished difference Result 578 states and 1559 transitions. [2019-12-07 13:35:40,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-07 13:35:40,525 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 182 [2019-12-07 13:35:40,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:40,526 INFO L225 Difference]: With dead ends: 578 [2019-12-07 13:35:40,526 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 13:35:40,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 338 SyntacticMatches, 26 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1931 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1389, Invalid=5583, Unknown=0, NotChecked=0, Total=6972 [2019-12-07 13:35:40,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 13:35:40,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 13:35:40,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 13:35:40,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 13:35:40,544 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 182 [2019-12-07 13:35:40,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:40,544 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 13:35:40,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-07 13:35:40,544 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 13:35:40,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 13:35:40,744 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:35:40,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 13:35:40,992 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 108 [2019-12-07 13:35:47,553 WARN L192 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 324 DAG size of output: 46 [2019-12-07 13:35:47,690 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 19 [2019-12-07 13:35:47,744 INFO L246 CegarLoopResult]: For program point L33(lines 33 38) no Hoare annotation was computed. [2019-12-07 13:35:47,745 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 13:35:47,745 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 13:35:47,745 INFO L246 CegarLoopResult]: For program point L27(lines 27 31) no Hoare annotation was computed. [2019-12-07 13:35:47,745 INFO L249 CegarLoopResult]: At program point L25(lines 25 45) the Hoare annotation is: true [2019-12-07 13:35:47,745 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2019-12-07 13:35:47,745 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-12-07 13:35:47,745 INFO L246 CegarLoopResult]: For program point L40(lines 40 44) no Hoare annotation was computed. [2019-12-07 13:35:47,745 INFO L249 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2019-12-07 13:35:47,745 INFO L246 CegarLoopResult]: For program point L39-1(line 39) no Hoare annotation was computed. [2019-12-07 13:35:47,745 INFO L246 CegarLoopResult]: For program point ackermannEXIT(lines 14 22) no Hoare annotation was computed. [2019-12-07 13:35:47,745 INFO L249 CegarLoopResult]: At program point ackermannENTRY(lines 14 22) the Hoare annotation is: true [2019-12-07 13:35:47,745 INFO L242 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (or (not (<= 0 |ackermann_#in~m|)) (<= 1 |ackermann_#in~m|)) (<= (+ |ackermann_#in~n| (* 2 ackermann_~m)) (+ (* 2 |ackermann_#in~m|) ackermann_~n))) [2019-12-07 13:35:47,746 INFO L246 CegarLoopResult]: For program point L21-1(line 21) no Hoare annotation was computed. [2019-12-07 13:35:47,746 INFO L242 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (let ((.cse0 (+ |ackermann_#in~n| (* 2 ackermann_~m))) (.cse1 (* 2 |ackermann_#in~m|))) (and (= ackermann_~m |ackermann_#in~m|) (or (not (<= 0 |ackermann_#in~m|)) (<= 1 |ackermann_#in~m|)) (<= .cse0 .cse1) (<= .cse0 (+ .cse1 ackermann_~n)))) [2019-12-07 13:35:47,746 INFO L242 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: (let ((.cse3 (<= |ackermann_#in~n| 1)) (.cse0 (<= 3 |ackermann_#t~ret1|)) (.cse6 (+ |ackermann_#in~n| ackermann_~m)) (.cse1 (<= 1 |ackermann_#in~m|)) (.cse8 (<= 5 |ackermann_#t~ret1|)) (.cse2 (= ackermann_~m |ackermann_#in~m|)) (.cse5 (<= |ackermann_#in~m| 1)) (.cse4 (<= (+ |ackermann_#in~n| (* 2 ackermann_~m)) (+ (* 2 |ackermann_#in~m|) ackermann_~n)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse5 (<= 2 |ackermann_#t~ret1|) .cse4) (and .cse1 .cse2 (<= (+ |ackermann_#in~n| 1) |ackermann_#t~ret1|) (<= 6 |ackermann_#t~ret1|) .cse4) (and .cse0 .cse1 .cse2 (<= .cse6 (* 3 |ackermann_#in~m|)) .cse5 .cse4) (let ((.cse7 (* 4 |ackermann_#in~m|))) (and .cse1 .cse2 (<= (+ (* 4 ackermann_~m) 4) (+ |ackermann_#t~ret1| .cse7)) (<= .cse6 .cse7) .cse5 .cse4)) (and .cse1 .cse8 .cse2 (<= |ackermann_#in~n| 2) .cse4) (and .cse1 .cse8 .cse2 (<= |ackermann_#in~n| 4) .cse5 .cse4))) [2019-12-07 13:35:47,746 INFO L246 CegarLoopResult]: For program point L18(lines 18 20) no Hoare annotation was computed. [2019-12-07 13:35:47,746 INFO L246 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2019-12-07 13:35:47,746 INFO L246 CegarLoopResult]: For program point L21-3(line 21) no Hoare annotation was computed. [2019-12-07 13:35:47,746 INFO L246 CegarLoopResult]: For program point L15(lines 15 17) no Hoare annotation was computed. [2019-12-07 13:35:47,746 INFO L246 CegarLoopResult]: For program point ackermannFINAL(lines 14 22) no Hoare annotation was computed. [2019-12-07 13:35:47,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:35:47 BoogieIcfgContainer [2019-12-07 13:35:47,753 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:35:47,753 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:35:47,753 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:35:47,753 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:35:47,753 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:35:10" (3/4) ... [2019-12-07 13:35:47,756 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 13:35:47,760 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2019-12-07 13:35:47,764 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-12-07 13:35:47,764 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 13:35:47,796 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_62eb46ad-ae1e-4d32-a3fd-fe60aa31a283/bin/utaipan/witness.graphml [2019-12-07 13:35:47,796 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:35:47,797 INFO L168 Benchmark]: Toolchain (without parser) took 37858.98 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 597.2 MB). Free memory was 939.9 MB in the beginning and 1.6 GB in the end (delta: -614.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:35:47,797 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:35:47,797 INFO L168 Benchmark]: CACSL2BoogieTranslator took 190.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -154.8 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:35:47,797 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.04 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:35:47,798 INFO L168 Benchmark]: Boogie Preprocessor took 13.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:35:47,798 INFO L168 Benchmark]: RCFGBuilder took 169.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:35:47,798 INFO L168 Benchmark]: TraceAbstraction took 37411.60 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 498.6 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -484.3 MB). Peak memory consumption was 779.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:35:47,799 INFO L168 Benchmark]: Witness Printer took 42.80 ms. Allocated memory is still 1.6 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:35:47,801 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 190.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -154.8 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.04 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 169.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37411.60 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 498.6 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -484.3 MB). Peak memory consumption was 779.2 MB. Max. memory is 11.5 GB. * Witness Printer took 42.80 ms. Allocated memory is still 1.6 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: 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: 25]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Result: SAFE, OverallTime: 30.3s, OverallIterations: 8, TraceHistogramMax: 29, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.9s, HoareTripleCheckerStatistics: 198 SDtfs, 528 SDslu, 1667 SDs, 0 SdLazy, 10615 SolverSat, 3486 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2207 GetRequests, 1626 SyntacticMatches, 98 SemanticMatches, 483 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10566 ImplicationChecksByTransitivity, 12.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=384occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 373 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 962 PreInvPairs, 6481 NumberOfFragments, 257 HoareAnnotationTreeSize, 962 FomulaSimplifications, 537515 FormulaSimplificationTreeSizeReduction, 4.9s HoareSimplificationTime, 6 FomulaSimplificationsInter, 30411 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 1699 NumberOfCodeBlocks, 1661 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2521 ConstructedInterpolants, 0 QuantifiedInterpolants, 829478 SizeOfPredicates, 49 NumberOfNonLiveVariables, 2393 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 22 InterpolantComputations, 1 PerfectInterpolantSequences, 15598/19905 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...