./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_2calls_4_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive-simple/fibo_2calls_4_false-unreach-call_true-termination.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7a7b79fb8a331a00295fb9ddfb653e17bda3c30d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.1.24-0ed9222-m [2019-01-12 14:57:45,901 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:57:45,902 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:57:45,914 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:57:45,914 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:57:45,915 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:57:45,917 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:57:45,919 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:57:45,921 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:57:45,922 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:57:45,923 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:57:45,923 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:57:45,924 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:57:45,925 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:57:45,926 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:57:45,927 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:57:45,928 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:57:45,930 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:57:45,932 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:57:45,934 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:57:45,935 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:57:45,936 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:57:45,939 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:57:45,939 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:57:45,939 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:57:45,940 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:57:45,942 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:57:45,942 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:57:45,943 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:57:45,944 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:57:45,945 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:57:45,946 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:57:45,946 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:57:45,946 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:57:45,947 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:57:45,948 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:57:45,948 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:57:45,963 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:57:45,964 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:57:45,965 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:57:45,965 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:57:45,965 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:57:45,966 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:57:45,966 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:57:45,966 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:57:45,967 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:57:45,967 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:57:45,967 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:57:45,967 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:57:45,967 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:57:45,968 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:57:45,969 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:57:45,969 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:57:45,969 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:57:45,969 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:57:45,969 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:57:45,970 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:57:45,970 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:57:45,970 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:57:45,970 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:57:45,970 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:57:45,970 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:57:45,972 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:57:45,972 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:57:45,972 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:57:45,972 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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(__VERIFIER_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 -> 7a7b79fb8a331a00295fb9ddfb653e17bda3c30d [2019-01-12 14:57:46,008 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:57:46,020 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:57:46,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:57:46,025 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:57:46,026 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:57:46,027 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_2calls_4_false-unreach-call_true-termination.c [2019-01-12 14:57:46,088 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56f5261f2/2652e82950e645fe97c0be04f84d264c/FLAG725a7cbff [2019-01-12 14:57:46,537 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:57:46,538 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_2calls_4_false-unreach-call_true-termination.c [2019-01-12 14:57:46,544 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56f5261f2/2652e82950e645fe97c0be04f84d264c/FLAG725a7cbff [2019-01-12 14:57:46,923 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56f5261f2/2652e82950e645fe97c0be04f84d264c [2019-01-12 14:57:46,928 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:57:46,930 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:57:46,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:57:46,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:57:46,936 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:57:46,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:57:46" (1/1) ... [2019-01-12 14:57:46,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53dcd39b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:46, skipping insertion in model container [2019-01-12 14:57:46,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:57:46" (1/1) ... [2019-01-12 14:57:46,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:57:46,971 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:57:47,141 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:57:47,145 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:57:47,161 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:57:47,173 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:57:47,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:47 WrapperNode [2019-01-12 14:57:47,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:57:47,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:57:47,175 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:57:47,175 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:57:47,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:47" (1/1) ... [2019-01-12 14:57:47,190 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:47" (1/1) ... [2019-01-12 14:57:47,209 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:57:47,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:57:47,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:57:47,210 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:57:47,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:47" (1/1) ... [2019-01-12 14:57:47,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:47" (1/1) ... [2019-01-12 14:57:47,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:47" (1/1) ... [2019-01-12 14:57:47,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:47" (1/1) ... [2019-01-12 14:57:47,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:47" (1/1) ... [2019-01-12 14:57:47,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:47" (1/1) ... [2019-01-12 14:57:47,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:47" (1/1) ... [2019-01-12 14:57:47,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:57:47,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:57:47,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:57:47,232 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:57:47,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:57:47,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:57:47,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:57:47,350 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-01-12 14:57:47,350 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-01-12 14:57:47,350 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-01-12 14:57:47,350 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-01-12 14:57:47,691 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:57:47,691 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 14:57:47,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:57:47 BoogieIcfgContainer [2019-01-12 14:57:47,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:57:47,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:57:47,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:57:47,700 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:57:47,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:57:46" (1/3) ... [2019-01-12 14:57:47,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@745fb2ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:57:47, skipping insertion in model container [2019-01-12 14:57:47,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:57:47" (2/3) ... [2019-01-12 14:57:47,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@745fb2ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:57:47, skipping insertion in model container [2019-01-12 14:57:47,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:57:47" (3/3) ... [2019-01-12 14:57:47,705 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4_false-unreach-call_true-termination.c [2019-01-12 14:57:47,713 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:57:47,720 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 14:57:47,733 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 14:57:47,764 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:57:47,765 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:57:47,765 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:57:47,765 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:57:47,765 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:57:47,765 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:57:47,765 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:57:47,766 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:57:47,766 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:57:47,789 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-01-12 14:57:47,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 14:57:47,795 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:47,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:47,802 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:47,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:47,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-01-12 14:57:47,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:47,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:47,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:47,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:47,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:47,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:57:47,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:57:47,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:57:48,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:57:48,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:57:48,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:57:48,015 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2019-01-12 14:57:48,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:48,181 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-01-12 14:57:48,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:57:48,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 14:57:48,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:48,195 INFO L225 Difference]: With dead ends: 38 [2019-01-12 14:57:48,195 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 14:57:48,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:57:48,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 14:57:48,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 14:57:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 14:57:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-01-12 14:57:48,246 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-01-12 14:57:48,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:48,246 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-12 14:57:48,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:57:48,246 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-01-12 14:57:48,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 14:57:48,248 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:48,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:48,251 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:48,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:48,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-01-12 14:57:48,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:48,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:48,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:48,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:48,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:48,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:57:48,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:57:48,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:57:48,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:57:48,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:57:48,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:57:48,377 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2019-01-12 14:57:48,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:48,680 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-01-12 14:57:48,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:57:48,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-12 14:57:48,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:48,682 INFO L225 Difference]: With dead ends: 32 [2019-01-12 14:57:48,683 INFO L226 Difference]: Without dead ends: 28 [2019-01-12 14:57:48,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:57:48,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-12 14:57:48,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-01-12 14:57:48,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 14:57:48,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-01-12 14:57:48,694 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-01-12 14:57:48,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:48,694 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-12 14:57:48,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:57:48,695 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-01-12 14:57:48,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:57:48,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:48,696 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:48,696 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:48,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:48,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-01-12 14:57:48,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:48,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:48,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:48,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:48,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:48,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 14:57:48,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:48,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:48,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:48,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 14:57:49,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:49,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2019-01-12 14:57:49,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 14:57:49,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 14:57:49,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:57:49,042 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 9 states. [2019-01-12 14:57:49,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:49,672 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2019-01-12 14:57:49,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 14:57:49,673 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-01-12 14:57:49,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:49,675 INFO L225 Difference]: With dead ends: 54 [2019-01-12 14:57:49,675 INFO L226 Difference]: Without dead ends: 30 [2019-01-12 14:57:49,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-01-12 14:57:49,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-12 14:57:49,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-01-12 14:57:49,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 14:57:49,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-01-12 14:57:49,700 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2019-01-12 14:57:49,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:49,701 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-01-12 14:57:49,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 14:57:49,701 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-01-12 14:57:49,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 14:57:49,706 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:49,706 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:49,707 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:49,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:49,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2019-01-12 14:57:49,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:49,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:49,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:49,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:49,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 14:57:49,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:49,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:49,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:49,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:49,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 14:57:49,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:49,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-12 14:57:49,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 14:57:49,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 14:57:49,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:57:49,972 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 7 states. [2019-01-12 14:57:50,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:50,184 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-01-12 14:57:50,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:57:50,185 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-01-12 14:57:50,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:50,187 INFO L225 Difference]: With dead ends: 39 [2019-01-12 14:57:50,188 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 14:57:50,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:57:50,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 14:57:50,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-01-12 14:57:50,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-12 14:57:50,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2019-01-12 14:57:50,198 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2019-01-12 14:57:50,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:50,198 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-01-12 14:57:50,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 14:57:50,199 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2019-01-12 14:57:50,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 14:57:50,200 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:50,201 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:50,201 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:50,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:50,201 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-01-12 14:57:50,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:50,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:50,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:50,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:50,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:50,305 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 14:57:50,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:50,306 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:50,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:50,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:50,485 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 14:57:50,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:50,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2019-01-12 14:57:50,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 14:57:50,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 14:57:50,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:57:50,516 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 10 states. [2019-01-12 14:57:50,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:50,838 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2019-01-12 14:57:50,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 14:57:50,841 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-01-12 14:57:50,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:50,843 INFO L225 Difference]: With dead ends: 66 [2019-01-12 14:57:50,843 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 14:57:50,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-01-12 14:57:50,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 14:57:50,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-12 14:57:50,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-12 14:57:50,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2019-01-12 14:57:50,854 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 35 [2019-01-12 14:57:50,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:50,857 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2019-01-12 14:57:50,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 14:57:50,858 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2019-01-12 14:57:50,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 14:57:50,861 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:50,862 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:50,862 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:50,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:50,862 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2019-01-12 14:57:50,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:50,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:50,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:50,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:50,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 14:57:50,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:50,951 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:50,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:50,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:51,078 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 14:57:51,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:51,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2019-01-12 14:57:51,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 14:57:51,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 14:57:51,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:57:51,108 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 10 states. [2019-01-12 14:57:51,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:51,383 INFO L93 Difference]: Finished difference Result 57 states and 86 transitions. [2019-01-12 14:57:51,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 14:57:51,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-01-12 14:57:51,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:51,386 INFO L225 Difference]: With dead ends: 57 [2019-01-12 14:57:51,387 INFO L226 Difference]: Without dead ends: 53 [2019-01-12 14:57:51,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-01-12 14:57:51,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-12 14:57:51,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2019-01-12 14:57:51,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-12 14:57:51,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2019-01-12 14:57:51,399 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 36 [2019-01-12 14:57:51,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:51,400 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2019-01-12 14:57:51,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 14:57:51,400 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2019-01-12 14:57:51,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-12 14:57:51,402 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:51,402 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:51,403 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:51,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:51,403 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2019-01-12 14:57:51,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:51,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:51,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:51,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:51,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-12 14:57:51,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:51,499 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:51,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:51,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:51,606 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-12 14:57:51,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:51,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2019-01-12 14:57:51,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 14:57:51,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 14:57:51,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:57:51,626 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand 9 states. [2019-01-12 14:57:51,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:51,910 INFO L93 Difference]: Finished difference Result 62 states and 100 transitions. [2019-01-12 14:57:51,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:57:51,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-01-12 14:57:51,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:51,912 INFO L225 Difference]: With dead ends: 62 [2019-01-12 14:57:51,913 INFO L226 Difference]: Without dead ends: 58 [2019-01-12 14:57:51,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-01-12 14:57:51,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-12 14:57:51,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2019-01-12 14:57:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-12 14:57:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2019-01-12 14:57:51,928 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 50 [2019-01-12 14:57:51,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:51,929 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2019-01-12 14:57:51,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 14:57:51,929 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2019-01-12 14:57:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-12 14:57:51,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:51,934 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:51,935 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:51,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:51,936 INFO L82 PathProgramCache]: Analyzing trace with hash -26046796, now seen corresponding path program 1 times [2019-01-12 14:57:51,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:51,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:51,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:51,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:51,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:57:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:57:51,997 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:57:52,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:57:52 BoogieIcfgContainer [2019-01-12 14:57:52,028 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:57:52,029 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:57:52,029 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:57:52,029 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:57:52,029 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:57:47" (3/4) ... [2019-01-12 14:57:52,031 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:57:52,092 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:57:52,092 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:57:52,093 INFO L168 Benchmark]: Toolchain (without parser) took 5164.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 951.3 MB in the beginning and 825.8 MB in the end (delta: 125.6 MB). Peak memory consumption was 243.0 MB. Max. memory is 11.5 GB. [2019-01-12 14:57:52,095 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:57:52,096 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.39 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:57:52,096 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.78 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:57:52,097 INFO L168 Benchmark]: Boogie Preprocessor took 21.47 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:57:52,097 INFO L168 Benchmark]: RCFGBuilder took 460.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -146.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-01-12 14:57:52,098 INFO L168 Benchmark]: TraceAbstraction took 4334.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 825.8 MB in the end (delta: 261.1 MB). Peak memory consumption was 261.1 MB. Max. memory is 11.5 GB. [2019-01-12 14:57:52,098 INFO L168 Benchmark]: Witness Printer took 63.99 ms. Allocated memory is still 1.1 GB. Free memory is still 825.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:57:52,102 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 243.39 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.78 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.47 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 460.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -146.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4334.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 825.8 MB in the end (delta: 261.1 MB). Peak memory consumption was 261.1 MB. Max. memory is 11.5 GB. * Witness Printer took 63.99 ms. Allocated memory is still 1.1 GB. Free memory is still 825.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 4; [L37] CALL, EXPR fibo1(x) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) [L37] int result = fibo1(x); [L38] COND TRUE result == 3 [L39] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. UNSAFE Result, 4.2s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 140 SDtfs, 133 SDslu, 497 SDs, 0 SdLazy, 568 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 171 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 35 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 415 NumberOfCodeBlocks, 415 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 339 ConstructedInterpolants, 0 QuantifiedInterpolants, 20815 SizeOfPredicates, 18 NumberOfNonLiveVariables, 384 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 116/170 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...