./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Fibonacci04.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db54bc93f5615de8b0a803193005d14234c84165 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 08:45:54,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 08:45:54,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 08:45:54,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 08:45:54,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 08:45:54,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 08:45:54,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 08:45:54,073 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 08:45:54,074 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 08:45:54,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 08:45:54,076 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 08:45:54,077 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 08:45:54,077 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 08:45:54,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 08:45:54,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 08:45:54,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 08:45:54,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 08:45:54,081 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 08:45:54,082 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 08:45:54,084 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 08:45:54,085 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 08:45:54,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 08:45:54,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 08:45:54,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 08:45:54,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 08:45:54,092 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 08:45:54,093 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 08:45:54,094 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 08:45:54,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 08:45:54,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 08:45:54,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 08:45:54,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 08:45:54,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 08:45:54,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 08:45:54,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 08:45:54,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 08:45:54,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 08:45:54,106 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 08:45:54,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 08:45:54,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 08:45:54,108 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 08:45:54,109 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 08:45:54,143 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 08:45:54,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 08:45:54,143 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 08:45:54,143 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 08:45:54,144 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 08:45:54,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 08:45:54,144 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 08:45:54,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 08:45:54,145 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 08:45:54,145 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 08:45:54,145 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 08:45:54,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 08:45:54,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 08:45:54,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 08:45:54,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 08:45:54,146 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 08:45:54,146 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 08:45:54,146 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 08:45:54,146 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 08:45:54,146 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 08:45:54,146 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 08:45:54,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 08:45:54,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 08:45:54,147 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 08:45:54,147 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 08:45:54,147 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 08:45:54,147 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 08:45:54,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 08:45:54,147 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 08:45:54,147 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 08:45:54,148 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> db54bc93f5615de8b0a803193005d14234c84165 [2021-08-26 08:45:54,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 08:45:54,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 08:45:54,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 08:45:54,425 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 08:45:54,425 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 08:45:54,426 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci04.c [2021-08-26 08:45:54,472 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eb742903/b66ee8e626ad44118ccf24fa3e8df7bf/FLAG1b4c99eb5 [2021-08-26 08:45:54,817 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 08:45:54,817 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c [2021-08-26 08:45:54,822 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eb742903/b66ee8e626ad44118ccf24fa3e8df7bf/FLAG1b4c99eb5 [2021-08-26 08:45:54,836 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eb742903/b66ee8e626ad44118ccf24fa3e8df7bf [2021-08-26 08:45:54,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 08:45:54,841 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 08:45:54,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 08:45:54,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 08:45:54,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 08:45:54,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:45:54" (1/1) ... [2021-08-26 08:45:54,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52c8456a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:54, skipping insertion in model container [2021-08-26 08:45:54,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:45:54" (1/1) ... [2021-08-26 08:45:54,852 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 08:45:54,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 08:45:54,968 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c[780,793] [2021-08-26 08:45:54,970 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 08:45:54,976 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 08:45:55,015 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c[780,793] [2021-08-26 08:45:55,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 08:45:55,025 INFO L208 MainTranslator]: Completed translation [2021-08-26 08:45:55,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:55 WrapperNode [2021-08-26 08:45:55,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 08:45:55,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 08:45:55,029 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 08:45:55,029 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 08:45:55,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:55" (1/1) ... [2021-08-26 08:45:55,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:55" (1/1) ... [2021-08-26 08:45:55,051 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 08:45:55,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 08:45:55,052 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 08:45:55,052 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 08:45:55,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:55" (1/1) ... [2021-08-26 08:45:55,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:55" (1/1) ... [2021-08-26 08:45:55,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:55" (1/1) ... [2021-08-26 08:45:55,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:55" (1/1) ... [2021-08-26 08:45:55,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:55" (1/1) ... [2021-08-26 08:45:55,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:55" (1/1) ... [2021-08-26 08:45:55,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:55" (1/1) ... [2021-08-26 08:45:55,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 08:45:55,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 08:45:55,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 08:45:55,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 08:45:55,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:55" (1/1) ... [2021-08-26 08:45:55,087 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 08:45:55,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:45:55,110 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 08:45:55,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 08:45:55,141 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2021-08-26 08:45:55,141 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2021-08-26 08:45:55,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 08:45:55,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 08:45:55,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 08:45:55,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 08:45:55,335 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 08:45:55,335 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-26 08:45:55,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:45:55 BoogieIcfgContainer [2021-08-26 08:45:55,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 08:45:55,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 08:45:55,338 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 08:45:55,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 08:45:55,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 08:45:54" (1/3) ... [2021-08-26 08:45:55,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2637a5ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:45:55, skipping insertion in model container [2021-08-26 08:45:55,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:45:55" (2/3) ... [2021-08-26 08:45:55,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2637a5ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:45:55, skipping insertion in model container [2021-08-26 08:45:55,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:45:55" (3/3) ... [2021-08-26 08:45:55,342 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2021-08-26 08:45:55,345 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 08:45:55,345 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 08:45:55,385 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 08:45:55,391 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 08:45:55,391 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 08:45:55,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-26 08:45:55,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-26 08:45:55,408 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:45:55,408 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:45:55,409 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:45:55,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:45:55,413 INFO L82 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2021-08-26 08:45:55,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:45:55,419 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270100790] [2021-08-26 08:45:55,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:45:55,420 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:45:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:55,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:45:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:45:55,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:45:55,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270100790] [2021-08-26 08:45:55,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270100790] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:45:55,623 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:45:55,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 08:45:55,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509263337] [2021-08-26 08:45:55,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 08:45:55,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:45:55,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 08:45:55,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:45:55,650 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-26 08:45:55,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:45:55,722 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2021-08-26 08:45:55,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 08:45:55,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-08-26 08:45:55,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:45:55,730 INFO L225 Difference]: With dead ends: 31 [2021-08-26 08:45:55,730 INFO L226 Difference]: Without dead ends: 18 [2021-08-26 08:45:55,732 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.8ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 08:45:55,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-08-26 08:45:55,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-08-26 08:45:55,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-26 08:45:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-08-26 08:45:55,762 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2021-08-26 08:45:55,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:45:55,762 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-08-26 08:45:55,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-26 08:45:55,763 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-08-26 08:45:55,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 08:45:55,764 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:45:55,764 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:45:55,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 08:45:55,764 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:45:55,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:45:55,765 INFO L82 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2021-08-26 08:45:55,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:45:55,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807048539] [2021-08-26 08:45:55,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:45:55,766 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:45:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:55,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:45:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 08:45:55,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:45:55,849 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807048539] [2021-08-26 08:45:55,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807048539] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 08:45:55,849 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 08:45:55,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 08:45:55,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86291539] [2021-08-26 08:45:55,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 08:45:55,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:45:55,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 08:45:55,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 08:45:55,851 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-26 08:45:55,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:45:55,910 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-08-26 08:45:55,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 08:45:55,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-08-26 08:45:55,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:45:55,913 INFO L225 Difference]: With dead ends: 24 [2021-08-26 08:45:55,914 INFO L226 Difference]: Without dead ends: 20 [2021-08-26 08:45:55,915 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 08:45:55,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-08-26 08:45:55,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-08-26 08:45:55,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-26 08:45:55,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-08-26 08:45:55,925 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2021-08-26 08:45:55,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:45:55,925 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-08-26 08:45:55,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-26 08:45:55,926 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-08-26 08:45:55,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-26 08:45:55,927 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:45:55,927 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:45:55,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 08:45:55,928 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:45:55,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:45:55,929 INFO L82 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2021-08-26 08:45:55,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:45:55,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092889463] [2021-08-26 08:45:55,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:45:55,931 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:45:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:55,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:45:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:56,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:56,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-26 08:45:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:56,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 08:45:56,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:45:56,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092889463] [2021-08-26 08:45:56,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092889463] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:45:56,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12266073] [2021-08-26 08:45:56,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:45:56,063 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:45:56,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:45:56,080 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 08:45:56,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-26 08:45:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:56,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-26 08:45:56,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:45:56,308 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-26 08:45:56,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12266073] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:45:56,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:45:56,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-08-26 08:45:56,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815462548] [2021-08-26 08:45:56,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 08:45:56,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:45:56,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 08:45:56,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-26 08:45:56,310 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2021-08-26 08:45:56,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:45:56,438 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2021-08-26 08:45:56,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 08:45:56,439 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 23 [2021-08-26 08:45:56,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:45:56,440 INFO L225 Difference]: With dead ends: 35 [2021-08-26 08:45:56,440 INFO L226 Difference]: Without dead ends: 20 [2021-08-26 08:45:56,440 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 65.4ms TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-08-26 08:45:56,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-08-26 08:45:56,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-08-26 08:45:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-26 08:45:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2021-08-26 08:45:56,444 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2021-08-26 08:45:56,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:45:56,444 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-08-26 08:45:56,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2021-08-26 08:45:56,445 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2021-08-26 08:45:56,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-26 08:45:56,449 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:45:56,449 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:45:56,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-26 08:45:56,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:45:56,668 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:45:56,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:45:56,668 INFO L82 PathProgramCache]: Analyzing trace with hash 187716987, now seen corresponding path program 1 times [2021-08-26 08:45:56,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:45:56,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525258135] [2021-08-26 08:45:56,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:45:56,668 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:45:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:56,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:45:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:56,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:56,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:45:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:56,808 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-26 08:45:56,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:45:56,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525258135] [2021-08-26 08:45:56,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525258135] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:45:56,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593419760] [2021-08-26 08:45:56,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:45:56,809 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:45:56,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:45:56,821 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 08:45:56,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-26 08:45:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:56,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-26 08:45:56,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:45:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-26 08:45:56,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593419760] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:45:56,980 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:45:56,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-08-26 08:45:56,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482946374] [2021-08-26 08:45:56,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 08:45:56,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:45:56,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 08:45:56,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-08-26 08:45:56,982 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-26 08:45:57,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:45:57,036 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2021-08-26 08:45:57,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 08:45:57,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Word has length 24 [2021-08-26 08:45:57,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:45:57,038 INFO L225 Difference]: With dead ends: 38 [2021-08-26 08:45:57,038 INFO L226 Difference]: Without dead ends: 34 [2021-08-26 08:45:57,038 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 35.8ms TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-08-26 08:45:57,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-08-26 08:45:57,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-08-26 08:45:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2021-08-26 08:45:57,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2021-08-26 08:45:57,044 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2021-08-26 08:45:57,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:45:57,052 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2021-08-26 08:45:57,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-26 08:45:57,053 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2021-08-26 08:45:57,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-26 08:45:57,055 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:45:57,056 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:45:57,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-26 08:45:57,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-08-26 08:45:57,273 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:45:57,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:45:57,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1151618030, now seen corresponding path program 2 times [2021-08-26 08:45:57,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:45:57,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647386592] [2021-08-26 08:45:57,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:45:57,274 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:45:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:57,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:45:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:57,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:57,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:57,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:45:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:57,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:45:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:57,419 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-26 08:45:57,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:45:57,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647386592] [2021-08-26 08:45:57,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647386592] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:45:57,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854837276] [2021-08-26 08:45:57,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 08:45:57,421 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:45:57,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:45:57,427 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 08:45:57,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-26 08:45:57,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 08:45:57,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 08:45:57,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-26 08:45:57,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:45:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-08-26 08:45:57,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854837276] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:45:57,660 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:45:57,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-08-26 08:45:57,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445888670] [2021-08-26 08:45:57,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 08:45:57,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:45:57,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 08:45:57,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-08-26 08:45:57,662 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 6 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2021-08-26 08:45:57,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:45:57,839 INFO L93 Difference]: Finished difference Result 68 states and 103 transitions. [2021-08-26 08:45:57,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 08:45:57,840 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 6 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) Word has length 37 [2021-08-26 08:45:57,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:45:57,841 INFO L225 Difference]: With dead ends: 68 [2021-08-26 08:45:57,841 INFO L226 Difference]: Without dead ends: 35 [2021-08-26 08:45:57,841 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 133.6ms TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2021-08-26 08:45:57,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-08-26 08:45:57,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-08-26 08:45:57,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2021-08-26 08:45:57,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2021-08-26 08:45:57,847 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 37 [2021-08-26 08:45:57,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:45:57,847 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2021-08-26 08:45:57,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 6 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2021-08-26 08:45:57,847 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2021-08-26 08:45:57,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-08-26 08:45:57,848 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:45:57,849 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:45:57,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-08-26 08:45:58,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:45:58,065 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:45:58,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:45:58,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1673648870, now seen corresponding path program 3 times [2021-08-26 08:45:58,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:45:58,066 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760859098] [2021-08-26 08:45:58,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:45:58,066 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:45:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:45:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:45:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:45:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:45:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:45:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,215 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-08-26 08:45:58,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:45:58,216 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760859098] [2021-08-26 08:45:58,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760859098] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:45:58,216 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100469818] [2021-08-26 08:45:58,216 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 08:45:58,216 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:45:58,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:45:58,217 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 08:45:58,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-26 08:45:58,322 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-08-26 08:45:58,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 08:45:58,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-26 08:45:58,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:45:58,498 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-08-26 08:45:58,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100469818] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:45:58,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:45:58,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 13 [2021-08-26 08:45:58,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250313678] [2021-08-26 08:45:58,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 08:45:58,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:45:58,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 08:45:58,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-26 08:45:58,500 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2021-08-26 08:45:58,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:45:58,637 INFO L93 Difference]: Finished difference Result 84 states and 123 transitions. [2021-08-26 08:45:58,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 08:45:58,637 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) Word has length 65 [2021-08-26 08:45:58,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:45:58,639 INFO L225 Difference]: With dead ends: 84 [2021-08-26 08:45:58,639 INFO L226 Difference]: Without dead ends: 47 [2021-08-26 08:45:58,640 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 66.0ms TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-08-26 08:45:58,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-08-26 08:45:58,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2021-08-26 08:45:58,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2021-08-26 08:45:58,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2021-08-26 08:45:58,645 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 65 [2021-08-26 08:45:58,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:45:58,646 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2021-08-26 08:45:58,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2021-08-26 08:45:58,646 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2021-08-26 08:45:58,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-08-26 08:45:58,649 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:45:58,649 INFO L512 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:45:58,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-26 08:45:58,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:45:58,861 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:45:58,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:45:58,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1511331526, now seen corresponding path program 4 times [2021-08-26 08:45:58,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:45:58,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268781475] [2021-08-26 08:45:58,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:45:58,862 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:45:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 08:45:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:45:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:45:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:45:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:45:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:58,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:45:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:59,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:59,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:59,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:59,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:59,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:45:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:59,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 08:45:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:59,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 08:45:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:59,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 08:45:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:59,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 08:45:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:59,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 08:45:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 08:45:59,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 320 proven. 96 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2021-08-26 08:45:59,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 08:45:59,136 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268781475] [2021-08-26 08:45:59,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268781475] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:45:59,137 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093042867] [2021-08-26 08:45:59,137 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-26 08:45:59,137 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:45:59,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 08:45:59,145 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 08:45:59,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-26 08:45:59,263 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-26 08:45:59,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 08:45:59,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 08:45:59,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 08:45:59,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 327 proven. 131 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2021-08-26 08:45:59,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093042867] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 08:45:59,647 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 08:45:59,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2021-08-26 08:45:59,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685451549] [2021-08-26 08:45:59,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 08:45:59,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 08:45:59,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 08:45:59,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-08-26 08:45:59,649 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 10 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (21), 13 states have call predecessors, (21), 10 states have call successors, (21) [2021-08-26 08:45:59,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 08:45:59,820 INFO L93 Difference]: Finished difference Result 105 states and 174 transitions. [2021-08-26 08:45:59,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-26 08:45:59,820 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 10 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (21), 13 states have call predecessors, (21), 10 states have call successors, (21) Word has length 147 [2021-08-26 08:45:59,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 08:45:59,824 INFO L225 Difference]: With dead ends: 105 [2021-08-26 08:45:59,824 INFO L226 Difference]: Without dead ends: 49 [2021-08-26 08:45:59,827 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 95.4ms TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-08-26 08:45:59,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-08-26 08:45:59,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2021-08-26 08:45:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 33 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2021-08-26 08:45:59,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2021-08-26 08:45:59,840 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 147 [2021-08-26 08:45:59,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 08:45:59,842 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2021-08-26 08:45:59,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 10 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (21), 13 states have call predecessors, (21), 10 states have call successors, (21) [2021-08-26 08:45:59,842 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2021-08-26 08:45:59,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-26 08:45:59,846 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 08:45:59,846 INFO L512 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 08:45:59,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-26 08:46:00,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 08:46:00,064 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 08:46:00,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 08:46:00,064 INFO L82 PathProgramCache]: Analyzing trace with hash -2094125593, now seen corresponding path program 5 times [2021-08-26 08:46:00,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 08:46:00,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739084451] [2021-08-26 08:46:00,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 08:46:00,064 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 08:46:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 08:46:00,079 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 08:46:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 08:46:00,124 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 08:46:00,124 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 08:46:00,125 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 08:46:00,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 08:46:00,131 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 08:46:00,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 08:46:00 BoogieIcfgContainer [2021-08-26 08:46:00,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 08:46:00,191 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 08:46:00,191 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 08:46:00,191 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 08:46:00,192 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:45:55" (3/4) ... [2021-08-26 08:46:00,193 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-26 08:46:00,258 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 08:46:00,258 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 08:46:00,259 INFO L168 Benchmark]: Toolchain (without parser) took 5417.50 ms. Allocated memory was 67.1 MB in the beginning and 146.8 MB in the end (delta: 79.7 MB). Free memory was 47.4 MB in the beginning and 113.7 MB in the end (delta: -66.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 16.1 GB. [2021-08-26 08:46:00,259 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 67.1 MB. Free memory is still 48.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 08:46:00,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 184.18 ms. Allocated memory is still 67.1 MB. Free memory was 47.2 MB in the beginning and 49.5 MB in the end (delta: -2.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-26 08:46:00,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.22 ms. Allocated memory is still 67.1 MB. Free memory was 49.5 MB in the beginning and 48.1 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 08:46:00,260 INFO L168 Benchmark]: Boogie Preprocessor took 27.40 ms. Allocated memory is still 67.1 MB. Free memory was 48.1 MB in the beginning and 47.2 MB in the end (delta: 915.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 08:46:00,261 INFO L168 Benchmark]: RCFGBuilder took 256.67 ms. Allocated memory is still 67.1 MB. Free memory was 47.2 MB in the beginning and 35.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-26 08:46:00,261 INFO L168 Benchmark]: TraceAbstraction took 4852.71 ms. Allocated memory was 67.1 MB in the beginning and 146.8 MB in the end (delta: 79.7 MB). Free memory was 34.9 MB in the beginning and 118.9 MB in the end (delta: -84.0 MB). Peak memory consumption was 57.6 MB. Max. memory is 16.1 GB. [2021-08-26 08:46:00,261 INFO L168 Benchmark]: Witness Printer took 66.90 ms. Allocated memory is still 146.8 MB. Free memory was 118.9 MB in the beginning and 113.7 MB in the end (delta: 5.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-26 08:46:00,262 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40 ms. Allocated memory is still 67.1 MB. Free memory is still 48.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 184.18 ms. Allocated memory is still 67.1 MB. Free memory was 47.2 MB in the beginning and 49.5 MB in the end (delta: -2.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 22.22 ms. Allocated memory is still 67.1 MB. Free memory was 49.5 MB in the beginning and 48.1 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.40 ms. Allocated memory is still 67.1 MB. Free memory was 48.1 MB in the beginning and 47.2 MB in the end (delta: 915.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 256.67 ms. Allocated memory is still 67.1 MB. Free memory was 47.2 MB in the beginning and 35.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 4852.71 ms. Allocated memory was 67.1 MB in the beginning and 146.8 MB in the end (delta: 79.7 MB). Free memory was 34.9 MB in the beginning and 118.9 MB in the end (delta: -84.0 MB). Peak memory consumption was 57.6 MB. Max. memory is 16.1 GB. * Witness Printer took 66.90 ms. Allocated memory is still 146.8 MB. Free memory was 118.9 MB in the beginning and 113.7 MB in the end (delta: 5.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 35]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L30] int x = __VERIFIER_nondet_int(); [L31] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L19] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L21] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L19] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L21] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L24] return fibonacci(n-1) + fibonacci(n-2); [L31] RET, EXPR fibonacci(x) [L31] int result = fibonacci(x); [L32] COND FALSE !(x != 5 || result == 3) [L35] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4746.4ms, OverallIterations: 8, TraceHistogramMax: 21, EmptinessCheckTime: 22.9ms, AutomataDifference: 842.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 116 SDtfs, 198 SDslu, 319 SDs, 0 SdLazy, 595 SolverSat, 174 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 413.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 453 GetRequests, 378 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 446.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=7, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 57.2ms AutomataMinimizationTime, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 53.4ms SsaConstructionTime, 208.9ms SatisfiabilityAnalysisTime, 1945.4ms InterpolantComputationTime, 719 NumberOfCodeBlocks, 673 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 601 ConstructedInterpolants, 0 QuantifiedInterpolants, 1107 SizeOfPredicates, 15 NumberOfNonLiveVariables, 672 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 2448/2834 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-26 08:46:00,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...