./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 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-simple/fibo_2calls_8-2.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 f63c6229f0a09709710be77b7ac5a08c2c6f5392 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.0-5485861 [2020-10-25 23:11:19,765 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 23:11:19,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 23:11:19,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 23:11:19,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 23:11:19,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 23:11:19,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 23:11:19,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 23:11:19,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 23:11:19,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 23:11:19,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 23:11:19,847 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 23:11:19,848 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 23:11:19,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 23:11:19,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 23:11:19,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 23:11:19,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 23:11:19,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 23:11:19,861 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 23:11:19,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 23:11:19,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 23:11:19,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 23:11:19,874 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 23:11:19,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 23:11:19,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 23:11:19,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 23:11:19,881 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 23:11:19,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 23:11:19,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 23:11:19,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 23:11:19,885 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 23:11:19,885 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 23:11:19,887 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 23:11:19,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 23:11:19,889 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 23:11:19,889 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 23:11:19,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 23:11:19,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 23:11:19,893 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 23:11:19,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 23:11:19,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 23:11:19,896 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 23:11:19,957 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 23:11:19,958 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 23:11:19,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 23:11:19,961 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 23:11:19,961 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 23:11:19,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 23:11:19,962 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 23:11:19,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 23:11:19,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 23:11:19,963 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 23:11:19,964 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 23:11:19,964 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 23:11:19,964 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 23:11:19,965 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 23:11:19,965 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 23:11:19,965 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 23:11:19,965 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 23:11:19,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 23:11:19,966 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 23:11:19,966 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 23:11:19,967 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 23:11:19,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 23:11:19,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 23:11:19,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 23:11:19,968 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 23:11:19,968 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 23:11:19,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 23:11:19,968 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 23:11:19,969 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 23:11:19,969 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 -> f63c6229f0a09709710be77b7ac5a08c2c6f5392 [2020-10-25 23:11:20,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 23:11:20,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 23:11:20,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 23:11:20,381 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 23:11:20,382 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 23:11:20,383 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2020-10-25 23:11:20,469 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a63ccef82/59cbbcc93d5444bd94fd197dec9d993e/FLAGb2b15e372 [2020-10-25 23:11:21,129 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 23:11:21,130 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2020-10-25 23:11:21,138 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a63ccef82/59cbbcc93d5444bd94fd197dec9d993e/FLAGb2b15e372 [2020-10-25 23:11:21,516 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a63ccef82/59cbbcc93d5444bd94fd197dec9d993e [2020-10-25 23:11:21,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 23:11:21,530 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 23:11:21,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 23:11:21,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 23:11:21,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 23:11:21,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 11:11:21" (1/1) ... [2020-10-25 23:11:21,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@210236b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:21, skipping insertion in model container [2020-10-25 23:11:21,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 11:11:21" (1/1) ... [2020-10-25 23:11:21,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 23:11:21,617 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 23:11:21,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 23:11:21,819 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 23:11:21,849 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 23:11:21,870 INFO L208 MainTranslator]: Completed translation [2020-10-25 23:11:21,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:21 WrapperNode [2020-10-25 23:11:21,872 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 23:11:21,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 23:11:21,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 23:11:21,878 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 23:11:21,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:21" (1/1) ... [2020-10-25 23:11:21,900 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:21" (1/1) ... [2020-10-25 23:11:21,933 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 23:11:21,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 23:11:21,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 23:11:21,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 23:11:21,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:21" (1/1) ... [2020-10-25 23:11:21,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:21" (1/1) ... [2020-10-25 23:11:21,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:21" (1/1) ... [2020-10-25 23:11:21,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:21" (1/1) ... [2020-10-25 23:11:21,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:21" (1/1) ... [2020-10-25 23:11:21,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:21" (1/1) ... [2020-10-25 23:11:21,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:21" (1/1) ... [2020-10-25 23:11:21,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 23:11:21,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 23:11:21,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 23:11:21,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 23:11:21,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:21" (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 [2020-10-25 23:11:22,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 23:11:22,100 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-10-25 23:11:22,100 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-10-25 23:11:22,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 23:11:22,102 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-10-25 23:11:22,102 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-10-25 23:11:22,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 23:11:22,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 23:11:22,386 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 23:11:22,386 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-25 23:11:22,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:11:22 BoogieIcfgContainer [2020-10-25 23:11:22,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 23:11:22,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 23:11:22,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 23:11:22,395 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 23:11:22,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 11:11:21" (1/3) ... [2020-10-25 23:11:22,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228e2211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 11:11:22, skipping insertion in model container [2020-10-25 23:11:22,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:21" (2/3) ... [2020-10-25 23:11:22,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228e2211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 11:11:22, skipping insertion in model container [2020-10-25 23:11:22,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:11:22" (3/3) ... [2020-10-25 23:11:22,399 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2020-10-25 23:11:22,418 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 23:11:22,424 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 23:11:22,449 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 23:11:22,500 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 23:11:22,500 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 23:11:22,501 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 23:11:22,501 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 23:11:22,501 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 23:11:22,501 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 23:11:22,502 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 23:11:22,502 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 23:11:22,522 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-10-25 23:11:22,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-25 23:11:22,528 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:11:22,529 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:11:22,530 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:11:22,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:11:22,538 INFO L82 PathProgramCache]: Analyzing trace with hash -2146840844, now seen corresponding path program 1 times [2020-10-25 23:11:22,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:11:22,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053186337] [2020-10-25 23:11:22,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:11:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:22,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:11:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:22,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:11:22,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053186337] [2020-10-25 23:11:22,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:11:22,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 23:11:22,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486385030] [2020-10-25 23:11:22,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:11:22,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:11:22,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:11:22,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:11:22,925 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2020-10-25 23:11:23,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:11:23,036 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2020-10-25 23:11:23,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:11:23,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-25 23:11:23,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:11:23,058 INFO L225 Difference]: With dead ends: 44 [2020-10-25 23:11:23,059 INFO L226 Difference]: Without dead ends: 27 [2020-10-25 23:11:23,066 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:11:23,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-10-25 23:11:23,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-10-25 23:11:23,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-25 23:11:23,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-10-25 23:11:23,127 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2020-10-25 23:11:23,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:11:23,127 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-10-25 23:11:23,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:11:23,128 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2020-10-25 23:11:23,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-25 23:11:23,130 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:11:23,130 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:11:23,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 23:11:23,131 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:11:23,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:11:23,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1412337332, now seen corresponding path program 1 times [2020-10-25 23:11:23,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:11:23,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192561705] [2020-10-25 23:11:23,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:11:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:23,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:11:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:23,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:11:23,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192561705] [2020-10-25 23:11:23,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:11:23,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 23:11:23,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390335393] [2020-10-25 23:11:23,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:11:23,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:11:23,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:11:23,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:11:23,238 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 5 states. [2020-10-25 23:11:23,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:11:23,264 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2020-10-25 23:11:23,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:11:23,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-25 23:11:23,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:11:23,266 INFO L225 Difference]: With dead ends: 33 [2020-10-25 23:11:23,266 INFO L226 Difference]: Without dead ends: 29 [2020-10-25 23:11:23,267 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:11:23,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-10-25 23:11:23,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2020-10-25 23:11:23,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-25 23:11:23,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-10-25 23:11:23,275 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2020-10-25 23:11:23,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:11:23,276 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-10-25 23:11:23,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:11:23,276 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2020-10-25 23:11:23,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-25 23:11:23,277 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:11:23,278 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:11:23,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 23:11:23,278 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:11:23,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:11:23,279 INFO L82 PathProgramCache]: Analyzing trace with hash -888595213, now seen corresponding path program 1 times [2020-10-25 23:11:23,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:11:23,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227326157] [2020-10-25 23:11:23,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:11:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:23,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:11:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:23,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:23,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-25 23:11:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:23,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 23:11:23,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227326157] [2020-10-25 23:11:23,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411856811] [2020-10-25 23:11:23,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:11:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:23,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-25 23:11:23,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:11:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 23:11:23,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:11:23,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2020-10-25 23:11:23,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623362241] [2020-10-25 23:11:23,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-25 23:11:23,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:11:23,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-25 23:11:23,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-10-25 23:11:23,647 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 10 states. [2020-10-25 23:11:24,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:11:24,083 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2020-10-25 23:11:24,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-25 23:11:24,084 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-10-25 23:11:24,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:11:24,085 INFO L225 Difference]: With dead ends: 55 [2020-10-25 23:11:24,085 INFO L226 Difference]: Without dead ends: 31 [2020-10-25 23:11:24,087 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-10-25 23:11:24,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-10-25 23:11:24,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2020-10-25 23:11:24,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-25 23:11:24,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2020-10-25 23:11:24,096 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2020-10-25 23:11:24,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:11:24,096 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-10-25 23:11:24,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-25 23:11:24,097 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2020-10-25 23:11:24,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-25 23:11:24,098 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:11:24,099 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:11:24,308 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-10-25 23:11:24,309 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:11:24,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:11:24,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1502460051, now seen corresponding path program 1 times [2020-10-25 23:11:24,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:11:24,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794920329] [2020-10-25 23:11:24,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:11:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:24,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:11:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:24,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:24,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:24,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 23:11:24,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794920329] [2020-10-25 23:11:24,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515083687] [2020-10-25 23:11:24,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:11:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:24,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-25 23:11:24,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:11:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 23:11:24,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:11:24,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-25 23:11:24,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898199499] [2020-10-25 23:11:24,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-25 23:11:24,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:11:24,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-25 23:11:24,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-25 23:11:24,643 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand 9 states. [2020-10-25 23:11:24,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:11:24,877 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2020-10-25 23:11:24,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-25 23:11:24,878 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-10-25 23:11:24,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:11:24,881 INFO L225 Difference]: With dead ends: 51 [2020-10-25 23:11:24,881 INFO L226 Difference]: Without dead ends: 47 [2020-10-25 23:11:24,882 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-25 23:11:24,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-25 23:11:24,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2020-10-25 23:11:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-25 23:11:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2020-10-25 23:11:24,895 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2020-10-25 23:11:24,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:11:24,895 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2020-10-25 23:11:24,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-25 23:11:24,896 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2020-10-25 23:11:24,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-25 23:11:24,898 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:11:24,898 INFO L422 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] [2020-10-25 23:11:25,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:11:25,114 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:11:25,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:11:25,115 INFO L82 PathProgramCache]: Analyzing trace with hash -801267146, now seen corresponding path program 1 times [2020-10-25 23:11:25,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:11:25,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140843673] [2020-10-25 23:11:25,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:11:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:25,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:11:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:25,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:25,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:25,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-25 23:11:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:25,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-25 23:11:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:25,313 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-25 23:11:25,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140843673] [2020-10-25 23:11:25,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035841375] [2020-10-25 23:11:25,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:11:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:25,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-25 23:11:25,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:11:25,473 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-25 23:11:25,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:11:25,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2020-10-25 23:11:25,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052159679] [2020-10-25 23:11:25,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-25 23:11:25,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:11:25,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-25 23:11:25,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-25 23:11:25,476 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand 11 states. [2020-10-25 23:11:25,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:11:25,781 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2020-10-25 23:11:25,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-25 23:11:25,782 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2020-10-25 23:11:25,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:11:25,784 INFO L225 Difference]: With dead ends: 105 [2020-10-25 23:11:25,784 INFO L226 Difference]: Without dead ends: 63 [2020-10-25 23:11:25,786 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-10-25 23:11:25,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-25 23:11:25,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-25 23:11:25,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-25 23:11:25,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2020-10-25 23:11:25,809 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2020-10-25 23:11:25,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:11:25,810 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2020-10-25 23:11:25,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-25 23:11:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2020-10-25 23:11:25,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-25 23:11:25,818 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:11:25,818 INFO L422 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, 1] [2020-10-25 23:11:26,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:11:26,020 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:11:26,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:11:26,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1583643682, now seen corresponding path program 1 times [2020-10-25 23:11:26,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:11:26,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477409877] [2020-10-25 23:11:26,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:11:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:26,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:11:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:26,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:26,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:26,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:26,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:26,169 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 23:11:26,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477409877] [2020-10-25 23:11:26,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215187107] [2020-10-25 23:11:26,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:11:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:26,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-25 23:11:26,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:11:26,341 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-25 23:11:26,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:11:26,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2020-10-25 23:11:26,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615034369] [2020-10-25 23:11:26,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-25 23:11:26,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:11:26,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-25 23:11:26,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-10-25 23:11:26,344 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand 13 states. [2020-10-25 23:11:26,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:11:26,914 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2020-10-25 23:11:26,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-25 23:11:26,914 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2020-10-25 23:11:26,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:11:26,919 INFO L225 Difference]: With dead ends: 177 [2020-10-25 23:11:26,919 INFO L226 Difference]: Without dead ends: 117 [2020-10-25 23:11:26,922 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2020-10-25 23:11:26,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-10-25 23:11:26,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2020-10-25 23:11:26,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-25 23:11:26,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2020-10-25 23:11:26,951 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2020-10-25 23:11:26,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:11:26,951 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2020-10-25 23:11:26,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-25 23:11:26,951 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2020-10-25 23:11:26,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-10-25 23:11:26,955 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:11:26,955 INFO L422 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, 1] [2020-10-25 23:11:27,169 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:11:27,169 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:11:27,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:11:27,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1063158393, now seen corresponding path program 1 times [2020-10-25 23:11:27,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:11:27,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603026463] [2020-10-25 23:11:27,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:11:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:27,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:11:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:27,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:27,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:27,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:27,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:27,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:27,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-10-25 23:11:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:27,427 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-25 23:11:27,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603026463] [2020-10-25 23:11:27,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020173973] [2020-10-25 23:11:27,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:11:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:27,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-25 23:11:27,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:11:27,631 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-10-25 23:11:27,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:11:27,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2020-10-25 23:11:27,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879594948] [2020-10-25 23:11:27,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-25 23:11:27,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:11:27,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-25 23:11:27,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-10-25 23:11:27,634 INFO L87 Difference]: Start difference. First operand 103 states and 166 transitions. Second operand 14 states. [2020-10-25 23:11:28,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:11:28,251 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2020-10-25 23:11:28,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-25 23:11:28,251 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2020-10-25 23:11:28,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:11:28,258 INFO L225 Difference]: With dead ends: 255 [2020-10-25 23:11:28,258 INFO L226 Difference]: Without dead ends: 155 [2020-10-25 23:11:28,264 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2020-10-25 23:11:28,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-10-25 23:11:28,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2020-10-25 23:11:28,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-25 23:11:28,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2020-10-25 23:11:28,324 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2020-10-25 23:11:28,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:11:28,325 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2020-10-25 23:11:28,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-25 23:11:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2020-10-25 23:11:28,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-25 23:11:28,336 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:11:28,336 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:11:28,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-10-25 23:11:28,537 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:11:28,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:11:28,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1732889556, now seen corresponding path program 1 times [2020-10-25 23:11:28,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:11:28,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771723045] [2020-10-25 23:11:28,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:11:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:28,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:11:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:28,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:28,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:28,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:28,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:28,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:28,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:28,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:11:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:28,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-25 23:11:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:28,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:28,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:28,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:28,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:28,863 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2020-10-25 23:11:28,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771723045] [2020-10-25 23:11:28,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959817097] [2020-10-25 23:11:28,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:11:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:28,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-25 23:11:28,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:11:29,138 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 92 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2020-10-25 23:11:29,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:11:29,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2020-10-25 23:11:29,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316394222] [2020-10-25 23:11:29,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-25 23:11:29,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:11:29,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-25 23:11:29,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-10-25 23:11:29,144 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand 16 states. [2020-10-25 23:11:29,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:11:29,877 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2020-10-25 23:11:29,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-25 23:11:29,879 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 93 [2020-10-25 23:11:29,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:11:29,882 INFO L225 Difference]: With dead ends: 240 [2020-10-25 23:11:29,882 INFO L226 Difference]: Without dead ends: 107 [2020-10-25 23:11:29,885 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2020-10-25 23:11:29,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-25 23:11:29,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2020-10-25 23:11:29,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-10-25 23:11:29,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2020-10-25 23:11:29,901 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 93 [2020-10-25 23:11:29,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:11:29,902 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2020-10-25 23:11:29,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-25 23:11:29,902 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2020-10-25 23:11:29,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-10-25 23:11:29,904 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:11:29,904 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 10, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:11:30,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:11:30,118 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:11:30,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:11:30,119 INFO L82 PathProgramCache]: Analyzing trace with hash 740260986, now seen corresponding path program 2 times [2020-10-25 23:11:30,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:11:30,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352649782] [2020-10-25 23:11:30,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:11:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:30,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:11:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:30,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:30,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:30,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:30,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:30,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:30,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:30,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:30,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:11:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:30,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-25 23:11:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:30,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:30,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:30,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:30,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:30,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-10-25 23:11:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:30,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:30,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:30,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:30,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-10-25 23:11:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:30,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:30,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:30,493 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 67 proven. 142 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2020-10-25 23:11:30,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352649782] [2020-10-25 23:11:30,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168371208] [2020-10-25 23:11:30,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:11:30,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-25 23:11:30,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 23:11:30,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-25 23:11:30,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:11:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 30 proven. 217 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2020-10-25 23:11:30,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:11:30,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2020-10-25 23:11:30,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597409374] [2020-10-25 23:11:30,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-25 23:11:30,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:11:30,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-25 23:11:30,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-10-25 23:11:30,816 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand 17 states. [2020-10-25 23:11:31,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:11:31,594 INFO L93 Difference]: Finished difference Result 214 states and 372 transitions. [2020-10-25 23:11:31,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-25 23:11:31,594 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 148 [2020-10-25 23:11:31,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:11:31,597 INFO L225 Difference]: With dead ends: 214 [2020-10-25 23:11:31,597 INFO L226 Difference]: Without dead ends: 134 [2020-10-25 23:11:31,600 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=872, Unknown=0, NotChecked=0, Total=1056 [2020-10-25 23:11:31,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-10-25 23:11:31,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2020-10-25 23:11:31,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-10-25 23:11:31,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2020-10-25 23:11:31,618 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 148 [2020-10-25 23:11:31,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:11:31,618 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2020-10-25 23:11:31,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-25 23:11:31,619 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2020-10-25 23:11:31,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2020-10-25 23:11:31,622 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:11:31,622 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 15, 14, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:11:31,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:11:31,838 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:11:31,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:11:31,839 INFO L82 PathProgramCache]: Analyzing trace with hash 341307334, now seen corresponding path program 3 times [2020-10-25 23:11:31,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:11:31,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027843180] [2020-10-25 23:11:31,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:11:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:31,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:11:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:11:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:11:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-25 23:11:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:11:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-10-25 23:11:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:11:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:11:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:32,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1780 backedges. 170 proven. 320 refuted. 0 times theorem prover too weak. 1290 trivial. 0 not checked. [2020-10-25 23:11:32,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027843180] [2020-10-25 23:11:32,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481818600] [2020-10-25 23:11:32,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:11:32,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-10-25 23:11:32,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 23:11:32,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-25 23:11:32,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:11:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1780 backedges. 460 proven. 33 refuted. 0 times theorem prover too weak. 1287 trivial. 0 not checked. [2020-10-25 23:11:32,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:11:32,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2020-10-25 23:11:32,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467358880] [2020-10-25 23:11:32,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-25 23:11:32,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:11:32,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-25 23:11:32,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2020-10-25 23:11:32,810 INFO L87 Difference]: Start difference. First operand 114 states and 169 transitions. Second operand 20 states. [2020-10-25 23:11:33,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:11:33,491 INFO L93 Difference]: Finished difference Result 239 states and 381 transitions. [2020-10-25 23:11:33,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-25 23:11:33,495 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 255 [2020-10-25 23:11:33,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:11:33,497 INFO L225 Difference]: With dead ends: 239 [2020-10-25 23:11:33,497 INFO L226 Difference]: Without dead ends: 130 [2020-10-25 23:11:33,500 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2020-10-25 23:11:33,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-10-25 23:11:33,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2020-10-25 23:11:33,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-25 23:11:33,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 177 transitions. [2020-10-25 23:11:33,515 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 177 transitions. Word has length 255 [2020-10-25 23:11:33,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:11:33,515 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 177 transitions. [2020-10-25 23:11:33,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-25 23:11:33,515 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 177 transitions. [2020-10-25 23:11:33,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2020-10-25 23:11:33,524 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:11:33,524 INFO L422 BasicCegarLoop]: trace histogram [34, 34, 29, 29, 26, 25, 17, 17, 17, 17, 17, 17, 17, 14, 14, 14, 14, 14, 14, 14, 12, 8, 8, 4, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:11:33,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-10-25 23:11:33,738 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:11:33,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:11:33,739 INFO L82 PathProgramCache]: Analyzing trace with hash 829071849, now seen corresponding path program 4 times [2020-10-25 23:11:33,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:11:33,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425821086] [2020-10-25 23:11:33,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:11:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:33,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:11:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:11:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:11:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-25 23:11:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:11:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:11:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2020-10-25 23:11:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:11:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:11:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-25 23:11:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:11:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:11:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:34,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:35,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5401 backedges. 309 proven. 1208 refuted. 0 times theorem prover too weak. 3884 trivial. 0 not checked. [2020-10-25 23:11:35,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425821086] [2020-10-25 23:11:35,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887088207] [2020-10-25 23:11:35,038 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:11:35,186 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-25 23:11:35,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 23:11:35,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-25 23:11:35,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:11:35,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5401 backedges. 130 proven. 938 refuted. 0 times theorem prover too weak. 4333 trivial. 0 not checked. [2020-10-25 23:11:35,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:11:35,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 20 [2020-10-25 23:11:35,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89492946] [2020-10-25 23:11:35,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-25 23:11:35,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:11:35,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-25 23:11:35,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2020-10-25 23:11:35,433 INFO L87 Difference]: Start difference. First operand 130 states and 177 transitions. Second operand 20 states. [2020-10-25 23:11:36,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:11:36,634 INFO L93 Difference]: Finished difference Result 298 states and 484 transitions. [2020-10-25 23:11:36,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-10-25 23:11:36,634 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 433 [2020-10-25 23:11:36,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:11:36,644 INFO L225 Difference]: With dead ends: 298 [2020-10-25 23:11:36,645 INFO L226 Difference]: Without dead ends: 177 [2020-10-25 23:11:36,647 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 556 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=268, Invalid=1454, Unknown=0, NotChecked=0, Total=1722 [2020-10-25 23:11:36,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-10-25 23:11:36,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 167. [2020-10-25 23:11:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2020-10-25 23:11:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 246 transitions. [2020-10-25 23:11:36,671 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 246 transitions. Word has length 433 [2020-10-25 23:11:36,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:11:36,673 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 246 transitions. [2020-10-25 23:11:36,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-25 23:11:36,673 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 246 transitions. [2020-10-25 23:11:36,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2020-10-25 23:11:36,684 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:11:36,684 INFO L422 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 26, 25, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 11, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:11:36,898 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:11:36,899 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:11:36,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:11:36,900 INFO L82 PathProgramCache]: Analyzing trace with hash 902497613, now seen corresponding path program 5 times [2020-10-25 23:11:36,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:11:36,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025040541] [2020-10-25 23:11:36,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:11:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:11:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:11:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:11:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-25 23:11:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:11:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-10-25 23:11:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:11:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:11:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-10-25 23:11:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:11:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:11:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-25 23:11:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,425 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 1102 proven. 902 refuted. 0 times theorem prover too weak. 3365 trivial. 0 not checked. [2020-10-25 23:11:38,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025040541] [2020-10-25 23:11:38,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075594195] [2020-10-25 23:11:38,426 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:11:38,615 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2020-10-25 23:11:38,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 23:11:38,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-25 23:11:38,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:11:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 918 proven. 135 refuted. 0 times theorem prover too weak. 4316 trivial. 0 not checked. [2020-10-25 23:11:38,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:11:38,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13] total 28 [2020-10-25 23:11:38,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389592308] [2020-10-25 23:11:38,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-10-25 23:11:38,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:11:38,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-10-25 23:11:38,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2020-10-25 23:11:38,948 INFO L87 Difference]: Start difference. First operand 167 states and 246 transitions. Second operand 28 states. [2020-10-25 23:11:40,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:11:40,345 INFO L93 Difference]: Finished difference Result 357 states and 602 transitions. [2020-10-25 23:11:40,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-10-25 23:11:40,346 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 433 [2020-10-25 23:11:40,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:11:40,352 INFO L225 Difference]: With dead ends: 357 [2020-10-25 23:11:40,352 INFO L226 Difference]: Without dead ends: 208 [2020-10-25 23:11:40,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 554 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=311, Invalid=1945, Unknown=0, NotChecked=0, Total=2256 [2020-10-25 23:11:40,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-10-25 23:11:40,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 194. [2020-10-25 23:11:40,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-10-25 23:11:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 279 transitions. [2020-10-25 23:11:40,373 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 279 transitions. Word has length 433 [2020-10-25 23:11:40,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:11:40,374 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 279 transitions. [2020-10-25 23:11:40,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-10-25 23:11:40,374 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 279 transitions. [2020-10-25 23:11:40,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2020-10-25 23:11:40,384 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:11:40,385 INFO L422 BasicCegarLoop]: trace histogram [33, 33, 30, 30, 26, 25, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 11, 9, 7, 5, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:11:40,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:11:40,600 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:11:40,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:11:40,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1878610003, now seen corresponding path program 6 times [2020-10-25 23:11:40,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:11:40,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947359367] [2020-10-25 23:11:40,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:11:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:40,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:11:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:40,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:11:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:11:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-25 23:11:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:11:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:11:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2020-10-25 23:11:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:11:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:11:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2020-10-25 23:11:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:11:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:11:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:42,147 INFO L134 CoverageAnalysis]: Checked inductivity of 5377 backedges. 849 proven. 1278 refuted. 0 times theorem prover too weak. 3250 trivial. 0 not checked. [2020-10-25 23:11:42,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947359367] [2020-10-25 23:11:42,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313422030] [2020-10-25 23:11:42,148 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:11:42,296 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2020-10-25 23:11:42,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 23:11:42,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-25 23:11:42,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:11:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5377 backedges. 660 proven. 100 refuted. 0 times theorem prover too weak. 4617 trivial. 0 not checked. [2020-10-25 23:11:42,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:11:42,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10] total 24 [2020-10-25 23:11:42,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312654677] [2020-10-25 23:11:42,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-25 23:11:42,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:11:42,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-25 23:11:42,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2020-10-25 23:11:42,603 INFO L87 Difference]: Start difference. First operand 194 states and 279 transitions. Second operand 24 states. [2020-10-25 23:11:43,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:11:43,945 INFO L93 Difference]: Finished difference Result 409 states and 617 transitions. [2020-10-25 23:11:43,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-10-25 23:11:43,946 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 433 [2020-10-25 23:11:43,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:11:43,950 INFO L225 Difference]: With dead ends: 409 [2020-10-25 23:11:43,951 INFO L226 Difference]: Without dead ends: 229 [2020-10-25 23:11:43,953 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 558 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=328, Invalid=2024, Unknown=0, NotChecked=0, Total=2352 [2020-10-25 23:11:43,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-10-25 23:11:43,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 187. [2020-10-25 23:11:43,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-10-25 23:11:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 265 transitions. [2020-10-25 23:11:43,972 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 265 transitions. Word has length 433 [2020-10-25 23:11:43,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:11:43,973 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 265 transitions. [2020-10-25 23:11:43,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-25 23:11:43,973 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 265 transitions. [2020-10-25 23:11:43,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2020-10-25 23:11:43,977 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:11:43,978 INFO L422 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:11:44,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-10-25 23:11:44,194 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:11:44,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:11:44,195 INFO L82 PathProgramCache]: Analyzing trace with hash -232840799, now seen corresponding path program 7 times [2020-10-25 23:11:44,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:11:44,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47288030] [2020-10-25 23:11:44,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:11:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 23:11:44,284 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 23:11:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 23:11:44,362 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 23:11:44,512 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 23:11:44,513 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 23:11:44,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-25 23:11:44,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 11:11:44 BoogieIcfgContainer [2020-10-25 23:11:44,777 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 23:11:44,778 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 23:11:44,778 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 23:11:44,778 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 23:11:44,779 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:11:22" (3/4) ... [2020-10-25 23:11:44,781 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-25 23:11:44,988 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 23:11:44,988 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 23:11:44,991 INFO L168 Benchmark]: Toolchain (without parser) took 23466.17 ms. Allocated memory was 44.0 MB in the beginning and 570.4 MB in the end (delta: 526.4 MB). Free memory was 21.1 MB in the beginning and 381.2 MB in the end (delta: -360.2 MB). Peak memory consumption was 167.6 MB. Max. memory is 16.1 GB. [2020-10-25 23:11:44,992 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 44.0 MB. Free memory was 26.8 MB in the beginning and 26.8 MB in the end (delta: 33.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 23:11:44,993 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.70 ms. Allocated memory is still 44.0 MB. Free memory was 20.5 MB in the beginning and 20.5 MB in the end (delta: 33.6 kB). Peak memory consumption was 3.2 MB. Max. memory is 16.1 GB. [2020-10-25 23:11:44,994 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.86 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 20.4 MB in the beginning and 39.5 MB in the end (delta: -19.1 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. [2020-10-25 23:11:44,994 INFO L168 Benchmark]: Boogie Preprocessor took 54.59 ms. Allocated memory is still 54.5 MB. Free memory was 39.5 MB in the beginning and 38.4 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 23:11:44,995 INFO L168 Benchmark]: RCFGBuilder took 398.10 ms. Allocated memory is still 54.5 MB. Free memory was 38.4 MB in the beginning and 25.9 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-10-25 23:11:44,995 INFO L168 Benchmark]: TraceAbstraction took 22386.18 ms. Allocated memory was 54.5 MB in the beginning and 570.4 MB in the end (delta: 515.9 MB). Free memory was 25.5 MB in the beginning and 401.2 MB in the end (delta: -375.7 MB). Peak memory consumption was 140.8 MB. Max. memory is 16.1 GB. [2020-10-25 23:11:44,996 INFO L168 Benchmark]: Witness Printer took 211.06 ms. Allocated memory is still 570.4 MB. Free memory was 401.2 MB in the beginning and 381.2 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-10-25 23:11:44,998 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.25 ms. Allocated memory is still 44.0 MB. Free memory was 26.8 MB in the beginning and 26.8 MB in the end (delta: 33.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 340.70 ms. Allocated memory is still 44.0 MB. Free memory was 20.5 MB in the beginning and 20.5 MB in the end (delta: 33.6 kB). Peak memory consumption was 3.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 56.86 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 20.4 MB in the beginning and 39.5 MB in the end (delta: -19.1 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 54.59 ms. Allocated memory is still 54.5 MB. Free memory was 39.5 MB in the beginning and 38.4 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 398.10 ms. Allocated memory is still 54.5 MB. Free memory was 38.4 MB in the beginning and 25.9 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 22386.18 ms. Allocated memory was 54.5 MB in the beginning and 570.4 MB in the end (delta: 515.9 MB). Free memory was 25.5 MB in the beginning and 401.2 MB in the end (delta: -375.7 MB). Peak memory consumption was 140.8 MB. Max. memory is 16.1 GB. * Witness Printer took 211.06 ms. Allocated memory is still 570.4 MB. Free memory was 401.2 MB in the beginning and 381.2 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L38] int x = 8; [L39] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) [L39] int result = fibo1(x); [L40] COND TRUE result == 21 [L4] __assert_fail("0", "fibo_2calls_8-2.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 22.0s, OverallIterations: 14, TraceHistogramMax: 34, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 410 SDtfs, 782 SDslu, 3020 SDs, 0 SdLazy, 5105 SolverSat, 870 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2823 GetRequests, 2513 SyntacticMatches, 3 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1834 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 175 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 4413 NumberOfCodeBlocks, 3952 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 3929 ConstructedInterpolants, 0 QuantifiedInterpolants, 1770547 SizeOfPredicates, 59 NumberOfNonLiveVariables, 3562 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 32054/37540 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! Received shutdown request...