./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 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-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.1-dev-20ed64e [2021-08-26 09:00:08,194 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 09:00:08,195 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 09:00:08,217 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 09:00:08,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 09:00:08,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 09:00:08,220 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 09:00:08,222 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 09:00:08,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 09:00:08,224 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 09:00:08,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 09:00:08,225 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 09:00:08,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 09:00:08,227 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 09:00:08,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 09:00:08,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 09:00:08,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 09:00:08,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 09:00:08,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 09:00:08,242 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 09:00:08,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 09:00:08,244 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 09:00:08,245 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 09:00:08,246 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 09:00:08,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 09:00:08,248 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 09:00:08,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 09:00:08,249 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 09:00:08,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 09:00:08,251 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 09:00:08,251 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 09:00:08,252 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 09:00:08,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 09:00:08,253 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 09:00:08,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 09:00:08,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 09:00:08,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 09:00:08,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 09:00:08,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 09:00:08,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 09:00:08,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 09:00:08,257 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 09:00:08,276 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 09:00:08,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 09:00:08,277 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 09:00:08,277 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 09:00:08,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 09:00:08,278 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 09:00:08,278 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 09:00:08,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 09:00:08,279 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 09:00:08,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 09:00:08,279 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 09:00:08,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 09:00:08,280 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 09:00:08,280 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 09:00:08,280 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 09:00:08,280 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 09:00:08,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 09:00:08,281 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 09:00:08,281 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 09:00:08,281 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 09:00:08,281 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 09:00:08,282 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 09:00:08,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 09:00:08,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 09:00:08,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 09:00:08,288 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 09:00:08,289 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 09:00:08,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 09:00:08,289 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 09:00:08,289 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 09:00:08,289 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 [2021-08-26 09:00:08,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 09:00:08,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 09:00:08,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 09:00:08,588 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 09:00:08,588 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 09:00:08,589 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 [2021-08-26 09:00:08,642 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/431296856/19ae6a01b0784950b1a395d03854b65b/FLAG288742c7d [2021-08-26 09:00:08,975 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 09:00:08,976 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2021-08-26 09:00:08,981 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/431296856/19ae6a01b0784950b1a395d03854b65b/FLAG288742c7d [2021-08-26 09:00:08,992 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/431296856/19ae6a01b0784950b1a395d03854b65b [2021-08-26 09:00:08,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 09:00:08,996 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 09:00:08,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 09:00:08,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 09:00:09,000 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 09:00:09,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:00:08" (1/1) ... [2021-08-26 09:00:09,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b5f40cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:09, skipping insertion in model container [2021-08-26 09:00:09,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:00:08" (1/1) ... [2021-08-26 09:00:09,006 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 09:00:09,015 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 09:00:09,139 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2021-08-26 09:00:09,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 09:00:09,147 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 09:00:09,170 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2021-08-26 09:00:09,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 09:00:09,197 INFO L208 MainTranslator]: Completed translation [2021-08-26 09:00:09,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:09 WrapperNode [2021-08-26 09:00:09,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 09:00:09,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 09:00:09,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 09:00:09,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 09:00:09,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:09" (1/1) ... [2021-08-26 09:00:09,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:09" (1/1) ... [2021-08-26 09:00:09,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 09:00:09,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 09:00:09,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 09:00:09,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 09:00:09,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:09" (1/1) ... [2021-08-26 09:00:09,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:09" (1/1) ... [2021-08-26 09:00:09,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:09" (1/1) ... [2021-08-26 09:00:09,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:09" (1/1) ... [2021-08-26 09:00:09,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:09" (1/1) ... [2021-08-26 09:00:09,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:09" (1/1) ... [2021-08-26 09:00:09,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:09" (1/1) ... [2021-08-26 09:00:09,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 09:00:09,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 09:00:09,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 09:00:09,251 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 09:00:09,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:09" (1/1) ... [2021-08-26 09:00:09,257 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 09:00:09,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:00:09,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 09:00:09,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 09:00:09,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 09:00:09,532 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2021-08-26 09:00:09,532 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2021-08-26 09:00:09,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 09:00:09,532 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2021-08-26 09:00:09,533 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2021-08-26 09:00:09,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 09:00:09,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 09:00:09,731 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 09:00:09,731 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-26 09:00:09,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:00:09 BoogieIcfgContainer [2021-08-26 09:00:09,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 09:00:09,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 09:00:09,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 09:00:09,760 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 09:00:09,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:00:08" (1/3) ... [2021-08-26 09:00:09,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39526972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:00:09, skipping insertion in model container [2021-08-26 09:00:09,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:00:09" (2/3) ... [2021-08-26 09:00:09,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39526972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:00:09, skipping insertion in model container [2021-08-26 09:00:09,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:00:09" (3/3) ... [2021-08-26 09:00:09,762 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2021-08-26 09:00:09,765 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 09:00:09,765 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 09:00:09,808 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 09:00:09,812 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 09:00:09,819 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 09:00:09,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-26 09:00:09,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-26 09:00:09,833 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:00:09,833 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:00:09,834 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:00:09,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:00:09,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2021-08-26 09:00:09,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:00:09,845 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059313320] [2021-08-26 09:00:09,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:09,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:00:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:09,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 09:00:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:00:10,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:00:10,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059313320] [2021-08-26 09:00:10,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059313320] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:00:10,053 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:00:10,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 09:00:10,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688908165] [2021-08-26 09:00:10,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 09:00:10,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:00:10,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 09:00:10,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:00:10,075 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-26 09:00:10,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:00:10,117 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2021-08-26 09:00:10,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 09:00:10,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-08-26 09:00:10,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:00:10,125 INFO L225 Difference]: With dead ends: 43 [2021-08-26 09:00:10,125 INFO L226 Difference]: Without dead ends: 27 [2021-08-26 09:00:10,128 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.8ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:00:10,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-08-26 09:00:10,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-08-26 09:00:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-08-26 09:00:10,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2021-08-26 09:00:10,162 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2021-08-26 09:00:10,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:00:10,162 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-08-26 09:00:10,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-26 09:00:10,162 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2021-08-26 09:00:10,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 09:00:10,163 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:00:10,163 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:00:10,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 09:00:10,163 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:00:10,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:00:10,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2021-08-26 09:00:10,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:00:10,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831331948] [2021-08-26 09:00:10,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:10,164 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:00:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:10,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 09:00:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:10,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:00:10,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:00:10,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831331948] [2021-08-26 09:00:10,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831331948] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:00:10,214 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:00:10,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 09:00:10,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461394556] [2021-08-26 09:00:10,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 09:00:10,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:00:10,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 09:00:10,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:00:10,216 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-26 09:00:10,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:00:10,227 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2021-08-26 09:00:10,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 09:00:10,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-08-26 09:00:10,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:00:10,228 INFO L225 Difference]: With dead ends: 33 [2021-08-26 09:00:10,228 INFO L226 Difference]: Without dead ends: 29 [2021-08-26 09:00:10,229 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:00:10,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-08-26 09:00:10,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-08-26 09:00:10,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-08-26 09:00:10,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2021-08-26 09:00:10,233 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2021-08-26 09:00:10,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:00:10,234 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-08-26 09:00:10,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-26 09:00:10,234 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2021-08-26 09:00:10,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-26 09:00:10,235 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:00:10,235 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:00:10,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 09:00:10,235 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:00:10,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:00:10,235 INFO L82 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2021-08-26 09:00:10,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:00:10,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665608026] [2021-08-26 09:00:10,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:10,236 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:00:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:10,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 09:00:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:10,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:10,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-26 09:00:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:10,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 09:00:10,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:00:10,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665608026] [2021-08-26 09:00:10,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665608026] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:10,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632823347] [2021-08-26 09:00:10,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:10,359 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:10,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:00:10,389 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:00:10,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-26 09:00:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:10,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-26 09:00:10,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:00:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 09:00:10,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632823347] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:10,600 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:00:10,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2021-08-26 09:00:10,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983115340] [2021-08-26 09:00:10,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 09:00:10,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:00:10,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 09:00:10,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-08-26 09:00:10,618 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 10 states, 8 states have (on average 3.25) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) [2021-08-26 09:00:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:00:10,779 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2021-08-26 09:00:10,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 09:00:10,779 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.25) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) Word has length 23 [2021-08-26 09:00:10,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:00:10,781 INFO L225 Difference]: With dead ends: 55 [2021-08-26 09:00:10,781 INFO L226 Difference]: Without dead ends: 31 [2021-08-26 09:00:10,789 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 91.4ms TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-08-26 09:00:10,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-08-26 09:00:10,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2021-08-26 09:00:10,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-08-26 09:00:10,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2021-08-26 09:00:10,801 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2021-08-26 09:00:10,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:00:10,801 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2021-08-26 09:00:10,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.25) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) [2021-08-26 09:00:10,802 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2021-08-26 09:00:10,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-26 09:00:10,806 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:00:10,807 INFO L512 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] [2021-08-26 09:00:10,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-26 09:00:11,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:11,024 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:00:11,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:00:11,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2021-08-26 09:00:11,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:00:11,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246843948] [2021-08-26 09:00:11,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:11,026 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:00:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:11,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 09:00:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:11,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:11,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:11,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 09:00:11,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:00:11,179 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246843948] [2021-08-26 09:00:11,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246843948] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:11,179 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404669038] [2021-08-26 09:00:11,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:11,180 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:11,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:00:11,188 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:00:11,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-26 09:00:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:11,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-26 09:00:11,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:00:11,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 09:00:11,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404669038] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:11,341 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:00:11,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2021-08-26 09:00:11,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554016583] [2021-08-26 09:00:11,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 09:00:11,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:00:11,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 09:00:11,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-08-26 09:00:11,343 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-26 09:00:11,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:00:11,469 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2021-08-26 09:00:11,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 09:00:11,470 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Word has length 24 [2021-08-26 09:00:11,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:00:11,471 INFO L225 Difference]: With dead ends: 51 [2021-08-26 09:00:11,471 INFO L226 Difference]: Without dead ends: 47 [2021-08-26 09:00:11,472 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 58.8ms TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-08-26 09:00:11,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-08-26 09:00:11,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2021-08-26 09:00:11,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2021-08-26 09:00:11,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2021-08-26 09:00:11,478 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2021-08-26 09:00:11,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:00:11,479 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2021-08-26 09:00:11,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-26 09:00:11,479 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2021-08-26 09:00:11,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-26 09:00:11,480 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:00:11,480 INFO L512 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] [2021-08-26 09:00:11,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-26 09:00:11,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-08-26 09:00:11,685 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:00:11,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:00:11,685 INFO L82 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2021-08-26 09:00:11,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:00:11,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113450510] [2021-08-26 09:00:11,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:11,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:00:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:11,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 09:00:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:11,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:11,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:11,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-26 09:00:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:11,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-08-26 09:00:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:11,768 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-26 09:00:11,768 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:00:11,768 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113450510] [2021-08-26 09:00:11,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113450510] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:11,769 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585938582] [2021-08-26 09:00:11,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:11,769 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:11,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:00:11,781 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:00:11,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-26 09:00:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:11,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-26 09:00:11,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:00:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-26 09:00:12,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585938582] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:12,036 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:00:12,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2021-08-26 09:00:12,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024557966] [2021-08-26 09:00:12,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-26 09:00:12,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:00:12,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-26 09:00:12,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-08-26 09:00:12,038 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 11 states have internal predecessors, (38), 8 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (10), 3 states have call predecessors, (10), 8 states have call successors, (10) [2021-08-26 09:00:12,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:00:12,227 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2021-08-26 09:00:12,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-26 09:00:12,228 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 11 states have internal predecessors, (38), 8 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (10), 3 states have call predecessors, (10), 8 states have call successors, (10) Word has length 36 [2021-08-26 09:00:12,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:00:12,230 INFO L225 Difference]: With dead ends: 105 [2021-08-26 09:00:12,230 INFO L226 Difference]: Without dead ends: 63 [2021-08-26 09:00:12,231 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 109.4ms TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2021-08-26 09:00:12,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-08-26 09:00:12,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-08-26 09:00:12,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2021-08-26 09:00:12,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2021-08-26 09:00:12,238 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2021-08-26 09:00:12,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:00:12,239 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2021-08-26 09:00:12,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 11 states have internal predecessors, (38), 8 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (10), 3 states have call predecessors, (10), 8 states have call successors, (10) [2021-08-26 09:00:12,239 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2021-08-26 09:00:12,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-26 09:00:12,240 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:00:12,240 INFO L512 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] [2021-08-26 09:00:12,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-08-26 09:00:12,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:12,452 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:00:12,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:00:12,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2021-08-26 09:00:12,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:00:12,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298241816] [2021-08-26 09:00:12,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:12,453 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:00:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:12,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 09:00:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:12,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:12,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:12,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:12,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-26 09:00:12,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:00:12,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298241816] [2021-08-26 09:00:12,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298241816] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:12,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048930598] [2021-08-26 09:00:12,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:12,580 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:12,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:00:12,593 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:00:12,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-26 09:00:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:12,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-26 09:00:12,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:00:12,863 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-26 09:00:12,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048930598] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:12,864 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:00:12,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-08-26 09:00:12,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457415273] [2021-08-26 09:00:12,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-26 09:00:12,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:00:12,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-26 09:00:12,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-08-26 09:00:12,866 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 8 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (10), 6 states have call predecessors, (10), 8 states have call successors, (10) [2021-08-26 09:00:13,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:00:13,196 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2021-08-26 09:00:13,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-26 09:00:13,197 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 8 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (10), 6 states have call predecessors, (10), 8 states have call successors, (10) Word has length 37 [2021-08-26 09:00:13,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:00:13,199 INFO L225 Difference]: With dead ends: 177 [2021-08-26 09:00:13,199 INFO L226 Difference]: Without dead ends: 117 [2021-08-26 09:00:13,200 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 126.4ms TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2021-08-26 09:00:13,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-08-26 09:00:13,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2021-08-26 09:00:13,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 69 states have internal predecessors, (80), 21 states have call successors, (21), 7 states have call predecessors, (21), 15 states have return successors, (65), 26 states have call predecessors, (65), 21 states have call successors, (65) [2021-08-26 09:00:13,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2021-08-26 09:00:13,212 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2021-08-26 09:00:13,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:00:13,213 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2021-08-26 09:00:13,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 8 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (10), 6 states have call predecessors, (10), 8 states have call successors, (10) [2021-08-26 09:00:13,214 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2021-08-26 09:00:13,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-26 09:00:13,216 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:00:13,216 INFO L512 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] [2021-08-26 09:00:13,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-26 09:00:13,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:13,429 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:00:13,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:00:13,430 INFO L82 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2021-08-26 09:00:13,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:00:13,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109851393] [2021-08-26 09:00:13,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:13,430 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:00:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:13,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 09:00:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:13,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:13,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:13,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:13,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:13,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:13,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-26 09:00:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-26 09:00:13,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:00:13,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109851393] [2021-08-26 09:00:13,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109851393] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:13,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057540277] [2021-08-26 09:00:13,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:13,581 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:13,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:00:13,585 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:00:13,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-26 09:00:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:13,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-26 09:00:13,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:00:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-26 09:00:13,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057540277] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:13,928 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:00:13,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-08-26 09:00:13,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742499559] [2021-08-26 09:00:13,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 09:00:13,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:00:13,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 09:00:13,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-08-26 09:00:13,930 INFO L87 Difference]: Start difference. First operand 103 states and 166 transitions. Second operand has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 15 states have internal predecessors, (47), 10 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2021-08-26 09:00:14,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:00:14,344 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2021-08-26 09:00:14,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-26 09:00:14,345 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 15 states have internal predecessors, (47), 10 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) Word has length 51 [2021-08-26 09:00:14,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:00:14,347 INFO L225 Difference]: With dead ends: 255 [2021-08-26 09:00:14,347 INFO L226 Difference]: Without dead ends: 155 [2021-08-26 09:00:14,348 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 156.8ms TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2021-08-26 09:00:14,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-08-26 09:00:14,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2021-08-26 09:00:14,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (66), 27 states have call predecessors, (66), 24 states have call successors, (66) [2021-08-26 09:00:14,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2021-08-26 09:00:14,364 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2021-08-26 09:00:14,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:00:14,364 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2021-08-26 09:00:14,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 15 states have internal predecessors, (47), 10 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2021-08-26 09:00:14,365 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2021-08-26 09:00:14,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-08-26 09:00:14,367 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:00:14,368 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:00:14,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-26 09:00:14,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:14,585 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:00:14,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:00:14,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1770426885, now seen corresponding path program 1 times [2021-08-26 09:00:14,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:00:14,585 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772968557] [2021-08-26 09:00:14,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:14,586 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:00:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:14,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 09:00:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:14,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:14,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:14,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:14,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:14,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:14,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:14,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:14,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-26 09:00:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:14,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:14,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:14,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:14,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:14,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:14,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:14,816 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 44 proven. 79 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-08-26 09:00:14,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:00:14,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772968557] [2021-08-26 09:00:14,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772968557] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:14,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977894925] [2021-08-26 09:00:14,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:14,816 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:14,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:00:14,829 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:00:14,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-26 09:00:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:14,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 09:00:14,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:00:15,322 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 17 proven. 119 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2021-08-26 09:00:15,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977894925] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:15,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:00:15,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2021-08-26 09:00:15,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607384030] [2021-08-26 09:00:15,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-26 09:00:15,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:00:15,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-26 09:00:15,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-08-26 09:00:15,324 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 13 states have call successors, (18), 1 states have call predecessors, (18), 9 states have return successors, (22), 11 states have call predecessors, (22), 13 states have call successors, (22) [2021-08-26 09:00:15,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:00:15,803 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2021-08-26 09:00:15,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-08-26 09:00:15,803 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 13 states have call successors, (18), 1 states have call predecessors, (18), 9 states have return successors, (22), 11 states have call predecessors, (22), 13 states have call successors, (22) Word has length 107 [2021-08-26 09:00:15,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:00:15,805 INFO L225 Difference]: With dead ends: 240 [2021-08-26 09:00:15,805 INFO L226 Difference]: Without dead ends: 107 [2021-08-26 09:00:15,806 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 221.5ms TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2021-08-26 09:00:15,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-08-26 09:00:15,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2021-08-26 09:00:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 58 states have internal predecessors, (67), 14 states have call successors, (14), 8 states have call predecessors, (14), 12 states have return successors, (35), 17 states have call predecessors, (35), 14 states have call successors, (35) [2021-08-26 09:00:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2021-08-26 09:00:15,818 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 107 [2021-08-26 09:00:15,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:00:15,819 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2021-08-26 09:00:15,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 13 states have call successors, (18), 1 states have call predecessors, (18), 9 states have return successors, (22), 11 states have call predecessors, (22), 13 states have call successors, (22) [2021-08-26 09:00:15,819 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2021-08-26 09:00:15,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-08-26 09:00:15,820 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:00:15,821 INFO L512 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:00:15,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-26 09:00:16,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:16,025 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:00:16,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:00:16,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1129417830, now seen corresponding path program 1 times [2021-08-26 09:00:16,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:00:16,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983112074] [2021-08-26 09:00:16,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:16,026 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:00:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:16,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 09:00:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:16,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:16,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:16,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:16,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:16,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:16,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:16,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:16,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:16,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-26 09:00:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:16,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:16,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:16,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:16,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:16,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:16,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:16,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-08-26 09:00:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:16,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:16,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:16,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:16,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:16,302 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 73 proven. 135 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2021-08-26 09:00:16,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:00:16,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983112074] [2021-08-26 09:00:16,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983112074] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:16,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588496622] [2021-08-26 09:00:16,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:16,302 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:16,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:00:16,309 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:00:16,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-26 09:00:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:16,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-26 09:00:16,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:00:16,978 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 36 proven. 211 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2021-08-26 09:00:16,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588496622] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:16,979 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:00:16,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2021-08-26 09:00:16,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164636279] [2021-08-26 09:00:16,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-26 09:00:16,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:00:16,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-26 09:00:16,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-08-26 09:00:16,981 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 14 states have call successors, (19), 1 states have call predecessors, (19), 10 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) [2021-08-26 09:00:17,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:00:17,462 INFO L93 Difference]: Finished difference Result 214 states and 372 transitions. [2021-08-26 09:00:17,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-08-26 09:00:17,463 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 14 states have call successors, (19), 1 states have call predecessors, (19), 10 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) Word has length 148 [2021-08-26 09:00:17,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:00:17,464 INFO L225 Difference]: With dead ends: 214 [2021-08-26 09:00:17,464 INFO L226 Difference]: Without dead ends: 134 [2021-08-26 09:00:17,465 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 262.5ms TimeCoverageRelationStatistics Valid=184, Invalid=872, Unknown=0, NotChecked=0, Total=1056 [2021-08-26 09:00:17,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-08-26 09:00:17,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2021-08-26 09:00:17,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 78 states have internal predecessors, (93), 20 states have call successors, (20), 11 states have call predecessors, (20), 16 states have return successors, (56), 24 states have call predecessors, (56), 20 states have call successors, (56) [2021-08-26 09:00:17,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2021-08-26 09:00:17,473 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 148 [2021-08-26 09:00:17,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:00:17,473 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2021-08-26 09:00:17,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 14 states have call successors, (19), 1 states have call predecessors, (19), 10 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) [2021-08-26 09:00:17,473 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2021-08-26 09:00:17,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2021-08-26 09:00:17,475 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:00:17,475 INFO L512 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 14, 13, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:00:17,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-26 09:00:17,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:17,689 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:00:17,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:00:17,689 INFO L82 PathProgramCache]: Analyzing trace with hash -19152416, now seen corresponding path program 1 times [2021-08-26 09:00:17,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:00:17,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381249307] [2021-08-26 09:00:17,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:17,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:00:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:17,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 09:00:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:17,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:17,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:17,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:17,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:17,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:17,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:17,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:17,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:17,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:17,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:17,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:17,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 09:00:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:17,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:17,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:17,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-08-26 09:00:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:17,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:17,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:17,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:17,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:17,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:17,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:17,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:18,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:18,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-08-26 09:00:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:18,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:18,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:18,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:18,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:18,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:18,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:18,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:18,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:18,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 167 proven. 262 refuted. 0 times theorem prover too weak. 988 trivial. 0 not checked. [2021-08-26 09:00:18,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:00:18,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381249307] [2021-08-26 09:00:18,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381249307] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:18,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552195209] [2021-08-26 09:00:18,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:18,027 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:18,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:00:18,037 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:00:18,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-26 09:00:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:18,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-26 09:00:18,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:00:18,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 77 proven. 422 refuted. 0 times theorem prover too weak. 918 trivial. 0 not checked. [2021-08-26 09:00:18,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552195209] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:18,998 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:00:18,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2021-08-26 09:00:18,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337393591] [2021-08-26 09:00:18,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-26 09:00:18,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:00:18,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-26 09:00:19,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2021-08-26 09:00:19,000 INFO L87 Difference]: Start difference. First operand 114 states and 169 transitions. Second operand has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 15 states have call successors, (21), 1 states have call predecessors, (21), 11 states have return successors, (30), 14 states have call predecessors, (30), 15 states have call successors, (30) [2021-08-26 09:00:19,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:00:19,565 INFO L93 Difference]: Finished difference Result 260 states and 447 transitions. [2021-08-26 09:00:19,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-08-26 09:00:19,565 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 15 states have call successors, (21), 1 states have call predecessors, (21), 11 states have return successors, (30), 14 states have call predecessors, (30), 15 states have call successors, (30) Word has length 229 [2021-08-26 09:00:19,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:00:19,567 INFO L225 Difference]: With dead ends: 260 [2021-08-26 09:00:19,567 INFO L226 Difference]: Without dead ends: 155 [2021-08-26 09:00:19,568 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 300.9ms TimeCoverageRelationStatistics Valid=221, Invalid=1111, Unknown=0, NotChecked=0, Total=1332 [2021-08-26 09:00:19,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-08-26 09:00:19,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2021-08-26 09:00:19,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 101 states have (on average 1.2376237623762376) internal successors, (125), 99 states have internal predecessors, (125), 26 states have call successors, (26), 18 states have call predecessors, (26), 17 states have return successors, (73), 27 states have call predecessors, (73), 26 states have call successors, (73) [2021-08-26 09:00:19,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 224 transitions. [2021-08-26 09:00:19,576 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 224 transitions. Word has length 229 [2021-08-26 09:00:19,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:00:19,576 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 224 transitions. [2021-08-26 09:00:19,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 15 states have call successors, (21), 1 states have call predecessors, (21), 11 states have return successors, (30), 14 states have call predecessors, (30), 15 states have call successors, (30) [2021-08-26 09:00:19,576 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 224 transitions. [2021-08-26 09:00:19,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2021-08-26 09:00:19,579 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:00:19,579 INFO L512 BasicCegarLoop]: trace histogram [30, 30, 25, 25, 22, 22, 15, 15, 15, 15, 15, 15, 15, 12, 12, 12, 12, 12, 12, 12, 10, 8, 7, 3, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:00:19,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-26 09:00:19,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-08-26 09:00:19,793 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:00:19,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:00:19,793 INFO L82 PathProgramCache]: Analyzing trace with hash -854779469, now seen corresponding path program 2 times [2021-08-26 09:00:19,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:00:19,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952407978] [2021-08-26 09:00:19,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:19,793 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:00:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:19,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 09:00:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:19,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 09:00:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-08-26 09:00:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-08-26 09:00:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 09:00:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2021-08-26 09:00:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 09:00:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 09:00:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:20,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4086 backedges. 245 proven. 607 refuted. 0 times theorem prover too weak. 3234 trivial. 0 not checked. [2021-08-26 09:00:20,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:00:20,288 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952407978] [2021-08-26 09:00:20,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952407978] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:20,288 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697122576] [2021-08-26 09:00:20,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 09:00:20,288 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:20,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:00:20,293 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:00:20,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-26 09:00:20,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 09:00:20,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 09:00:20,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-26 09:00:20,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:00:21,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4086 backedges. 193 proven. 610 refuted. 0 times theorem prover too weak. 3283 trivial. 0 not checked. [2021-08-26 09:00:21,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697122576] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:21,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:00:21,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2021-08-26 09:00:21,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119366657] [2021-08-26 09:00:21,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-26 09:00:21,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:00:21,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-26 09:00:21,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2021-08-26 09:00:21,631 INFO L87 Difference]: Start difference. First operand 145 states and 224 transitions. Second operand has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 13 states have call successors, (20), 1 states have call predecessors, (20), 10 states have return successors, (28), 14 states have call predecessors, (28), 13 states have call successors, (28) [2021-08-26 09:00:22,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:00:22,109 INFO L93 Difference]: Finished difference Result 323 states and 534 transitions. [2021-08-26 09:00:22,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-08-26 09:00:22,110 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 13 states have call successors, (20), 1 states have call predecessors, (20), 10 states have return successors, (28), 14 states have call predecessors, (28), 13 states have call successors, (28) Word has length 378 [2021-08-26 09:00:22,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:00:22,113 INFO L225 Difference]: With dead ends: 323 [2021-08-26 09:00:22,113 INFO L226 Difference]: Without dead ends: 188 [2021-08-26 09:00:22,114 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 226.5ms TimeCoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2021-08-26 09:00:22,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-08-26 09:00:22,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 145. [2021-08-26 09:00:22,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 101 states have (on average 1.198019801980198) internal successors, (121), 99 states have internal predecessors, (121), 26 states have call successors, (26), 18 states have call predecessors, (26), 17 states have return successors, (68), 27 states have call predecessors, (68), 26 states have call successors, (68) [2021-08-26 09:00:22,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2021-08-26 09:00:22,124 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 378 [2021-08-26 09:00:22,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:00:22,125 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2021-08-26 09:00:22,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 13 states have call successors, (20), 1 states have call predecessors, (20), 10 states have return successors, (28), 14 states have call predecessors, (28), 13 states have call successors, (28) [2021-08-26 09:00:22,125 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2021-08-26 09:00:22,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2021-08-26 09:00:22,129 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:00:22,129 INFO L512 BasicCegarLoop]: trace histogram [31, 31, 26, 26, 24, 22, 15, 15, 15, 15, 15, 15, 15, 13, 13, 13, 13, 13, 13, 13, 11, 7, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:00:22,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-26 09:00:22,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:22,339 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:00:22,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:00:22,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1076218468, now seen corresponding path program 3 times [2021-08-26 09:00:22,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:00:22,339 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043531275] [2021-08-26 09:00:22,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:22,339 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:00:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 09:00:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 09:00:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 09:00:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 09:00:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2021-08-26 09:00:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-08-26 09:00:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:22,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:23,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:23,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:23,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:23,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:23,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:23,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:23,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:23,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:23,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 09:00:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:23,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:23,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:23,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:23,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:23,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4399 backedges. 542 proven. 693 refuted. 0 times theorem prover too weak. 3164 trivial. 0 not checked. [2021-08-26 09:00:23,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:00:23,034 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043531275] [2021-08-26 09:00:23,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043531275] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:23,034 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860079064] [2021-08-26 09:00:23,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 09:00:23,034 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:23,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:00:23,045 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:00:23,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-26 09:00:23,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-08-26 09:00:23,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 09:00:23,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 09:00:23,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:00:24,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4399 backedges. 590 proven. 94 refuted. 0 times theorem prover too weak. 3715 trivial. 0 not checked. [2021-08-26 09:00:24,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860079064] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:24,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:00:24,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10] total 29 [2021-08-26 09:00:24,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518599106] [2021-08-26 09:00:24,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-08-26 09:00:24,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:00:24,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-08-26 09:00:24,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2021-08-26 09:00:24,488 INFO L87 Difference]: Start difference. First operand 145 states and 215 transitions. Second operand has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 29 states have internal predecessors, (78), 16 states have call successors, (23), 1 states have call predecessors, (23), 15 states have return successors, (31), 23 states have call predecessors, (31), 16 states have call successors, (31) [2021-08-26 09:00:25,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:00:25,334 INFO L93 Difference]: Finished difference Result 372 states and 608 transitions. [2021-08-26 09:00:25,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-08-26 09:00:25,334 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 29 states have internal predecessors, (78), 16 states have call successors, (23), 1 states have call predecessors, (23), 15 states have return successors, (31), 23 states have call predecessors, (31), 16 states have call successors, (31) Word has length 392 [2021-08-26 09:00:25,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:00:25,336 INFO L225 Difference]: With dead ends: 372 [2021-08-26 09:00:25,336 INFO L226 Difference]: Without dead ends: 225 [2021-08-26 09:00:25,338 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 477.2ms TimeCoverageRelationStatistics Valid=329, Invalid=2221, Unknown=0, NotChecked=0, Total=2550 [2021-08-26 09:00:25,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-08-26 09:00:25,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 167. [2021-08-26 09:00:25,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 117 states have (on average 1.2222222222222223) internal successors, (143), 115 states have internal predecessors, (143), 32 states have call successors, (32), 23 states have call predecessors, (32), 17 states have return successors, (71), 28 states have call predecessors, (71), 32 states have call successors, (71) [2021-08-26 09:00:25,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 246 transitions. [2021-08-26 09:00:25,348 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 246 transitions. Word has length 392 [2021-08-26 09:00:25,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:00:25,348 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 246 transitions. [2021-08-26 09:00:25,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 29 states have internal predecessors, (78), 16 states have call successors, (23), 1 states have call predecessors, (23), 15 states have return successors, (31), 23 states have call predecessors, (31), 16 states have call successors, (31) [2021-08-26 09:00:25,348 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 246 transitions. [2021-08-26 09:00:25,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2021-08-26 09:00:25,355 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:00:25,355 INFO L512 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 31, 31, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 12, 12, 8, 7, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:00:25,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-08-26 09:00:25,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-08-26 09:00:25,569 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:00:25,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:00:25,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1128768692, now seen corresponding path program 4 times [2021-08-26 09:00:25,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:00:25,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011519813] [2021-08-26 09:00:25,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:25,569 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:00:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:25,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 09:00:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:25,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:25,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:25,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 09:00:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 09:00:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-26 09:00:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 09:00:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 09:00:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2021-08-26 09:00:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 09:00:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 09:00:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 8074 backedges. 545 proven. 1546 refuted. 0 times theorem prover too weak. 5983 trivial. 0 not checked. [2021-08-26 09:00:26,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:00:26,487 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011519813] [2021-08-26 09:00:26,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011519813] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:26,487 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95516649] [2021-08-26 09:00:26,487 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-26 09:00:26,488 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:26,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:00:26,488 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:00:26,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-26 09:00:27,192 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-26 09:00:27,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 09:00:27,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-26 09:00:27,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:00:28,467 INFO L134 CoverageAnalysis]: Checked inductivity of 8074 backedges. 664 proven. 866 refuted. 0 times theorem prover too weak. 6544 trivial. 0 not checked. [2021-08-26 09:00:28,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95516649] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:28,468 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:00:28,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13] total 32 [2021-08-26 09:00:28,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041565277] [2021-08-26 09:00:28,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-08-26 09:00:28,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:00:28,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-08-26 09:00:28,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2021-08-26 09:00:28,469 INFO L87 Difference]: Start difference. First operand 167 states and 246 transitions. Second operand has 32 states, 31 states have (on average 2.838709677419355) internal successors, (88), 32 states have internal predecessors, (88), 22 states have call successors, (28), 1 states have call predecessors, (28), 17 states have return successors, (42), 26 states have call predecessors, (42), 22 states have call successors, (42) [2021-08-26 09:00:29,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:00:29,682 INFO L93 Difference]: Finished difference Result 445 states and 793 transitions. [2021-08-26 09:00:29,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-26 09:00:29,683 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.838709677419355) internal successors, (88), 32 states have internal predecessors, (88), 22 states have call successors, (28), 1 states have call predecessors, (28), 17 states have return successors, (42), 26 states have call predecessors, (42), 22 states have call successors, (42) Word has length 528 [2021-08-26 09:00:29,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:00:29,686 INFO L225 Difference]: With dead ends: 445 [2021-08-26 09:00:29,686 INFO L226 Difference]: Without dead ends: 255 [2021-08-26 09:00:29,688 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 676 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 509.4ms TimeCoverageRelationStatistics Valid=467, Invalid=3073, Unknown=0, NotChecked=0, Total=3540 [2021-08-26 09:00:29,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-08-26 09:00:29,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 211. [2021-08-26 09:00:29,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 150 states have (on average 1.1266666666666667) internal successors, (169), 146 states have internal predecessors, (169), 42 states have call successors, (42), 34 states have call predecessors, (42), 18 states have return successors, (93), 30 states have call predecessors, (93), 42 states have call successors, (93) [2021-08-26 09:00:29,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 304 transitions. [2021-08-26 09:00:29,701 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 304 transitions. Word has length 528 [2021-08-26 09:00:29,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:00:29,702 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 304 transitions. [2021-08-26 09:00:29,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.838709677419355) internal successors, (88), 32 states have internal predecessors, (88), 22 states have call successors, (28), 1 states have call predecessors, (28), 17 states have return successors, (42), 26 states have call predecessors, (42), 22 states have call successors, (42) [2021-08-26 09:00:29,703 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 304 transitions. [2021-08-26 09:00:29,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2021-08-26 09:00:29,705 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:00:29,706 INFO L512 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 34, 33, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 14, 12, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:00:29,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-08-26 09:00:29,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-08-26 09:00:29,921 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:00:29,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:00:29,921 INFO L82 PathProgramCache]: Analyzing trace with hash -106761143, now seen corresponding path program 5 times [2021-08-26 09:00:29,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:00:29,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464395611] [2021-08-26 09:00:29,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:29,922 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:00:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-26 09:00:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 09:00:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 09:00:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-26 09:00:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 09:00:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-08-26 09:00:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 09:00:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-26 09:00:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-08-26 09:00:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-26 09:00:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-26 09:00:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-26 09:00:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-26 09:00:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-26 09:00:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:00:30,924 INFO L134 CoverageAnalysis]: Checked inductivity of 9413 backedges. 835 proven. 1688 refuted. 0 times theorem prover too weak. 6890 trivial. 0 not checked. [2021-08-26 09:00:30,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:00:30,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464395611] [2021-08-26 09:00:30,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464395611] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:30,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396217614] [2021-08-26 09:00:30,926 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-26 09:00:30,926 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:00:30,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:00:30,927 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:00:30,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-08-26 09:00:31,835 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2021-08-26 09:00:31,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 09:00:31,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 1107 conjuncts, 24 conjunts are in the unsatisfiable core [2021-08-26 09:00:31,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:00:33,145 INFO L134 CoverageAnalysis]: Checked inductivity of 9413 backedges. 1177 proven. 1149 refuted. 0 times theorem prover too weak. 7087 trivial. 0 not checked. [2021-08-26 09:00:33,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396217614] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:00:33,145 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:00:33,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18] total 38 [2021-08-26 09:00:33,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857437440] [2021-08-26 09:00:33,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-08-26 09:00:33,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:00:33,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-08-26 09:00:33,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1225, Unknown=0, NotChecked=0, Total=1406 [2021-08-26 09:00:33,147 INFO L87 Difference]: Start difference. First operand 211 states and 304 transitions. Second operand has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 38 states have internal predecessors, (101), 25 states have call successors, (34), 1 states have call predecessors, (34), 19 states have return successors, (48), 32 states have call predecessors, (48), 25 states have call successors, (48) [2021-08-26 09:00:34,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:00:34,288 INFO L93 Difference]: Finished difference Result 462 states and 728 transitions. [2021-08-26 09:00:34,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-08-26 09:00:34,289 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 38 states have internal predecessors, (101), 25 states have call successors, (34), 1 states have call predecessors, (34), 19 states have return successors, (48), 32 states have call predecessors, (48), 25 states have call successors, (48) Word has length 569 [2021-08-26 09:00:34,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:00:34,291 INFO L225 Difference]: With dead ends: 462 [2021-08-26 09:00:34,291 INFO L226 Difference]: Without dead ends: 256 [2021-08-26 09:00:34,293 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 798 GetRequests, 726 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1705 ImplicationChecksByTransitivity, 789.8ms TimeCoverageRelationStatistics Valid=691, Invalid=4711, Unknown=0, NotChecked=0, Total=5402 [2021-08-26 09:00:34,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-08-26 09:00:34,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 211. [2021-08-26 09:00:34,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 150 states have (on average 1.1) internal successors, (165), 145 states have internal predecessors, (165), 42 states have call successors, (42), 34 states have call predecessors, (42), 18 states have return successors, (77), 31 states have call predecessors, (77), 42 states have call successors, (77) [2021-08-26 09:00:34,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 284 transitions. [2021-08-26 09:00:34,304 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 284 transitions. Word has length 569 [2021-08-26 09:00:34,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:00:34,305 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 284 transitions. [2021-08-26 09:00:34,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 38 states have internal predecessors, (101), 25 states have call successors, (34), 1 states have call predecessors, (34), 19 states have return successors, (48), 32 states have call predecessors, (48), 25 states have call successors, (48) [2021-08-26 09:00:34,305 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 284 transitions. [2021-08-26 09:00:34,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2021-08-26 09:00:34,308 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:00:34,308 INFO L512 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] [2021-08-26 09:00:34,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-08-26 09:00:34,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-08-26 09:00:34,525 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:00:34,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:00:34,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1402769443, now seen corresponding path program 6 times [2021-08-26 09:00:34,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:00:34,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986129558] [2021-08-26 09:00:34,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:00:34,525 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:00:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 09:00:34,567 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 09:00:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 09:00:34,689 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 09:00:34,689 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 09:00:34,690 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:00:34,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-26 09:00:34,697 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 09:00:34,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:00:34 BoogieIcfgContainer [2021-08-26 09:00:34,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 09:00:34,818 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 09:00:34,818 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 09:00:34,818 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 09:00:34,819 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:00:09" (3/4) ... [2021-08-26 09:00:34,821 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-26 09:00:34,906 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 09:00:34,906 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 09:00:34,907 INFO L168 Benchmark]: Toolchain (without parser) took 25910.89 ms. Allocated memory was 56.6 MB in the beginning and 383.8 MB in the end (delta: 327.2 MB). Free memory was 35.9 MB in the beginning and 99.7 MB in the end (delta: -63.7 MB). Peak memory consumption was 261.4 MB. Max. memory is 16.1 GB. [2021-08-26 09:00:34,908 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 56.6 MB. Free memory was 38.7 MB in the beginning and 38.7 MB in the end (delta: 1.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 09:00:34,908 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.09 ms. Allocated memory is still 56.6 MB. Free memory was 35.7 MB in the beginning and 40.4 MB in the end (delta: -4.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-26 09:00:34,909 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.34 ms. Allocated memory is still 56.6 MB. Free memory was 40.3 MB in the beginning and 38.9 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 09:00:34,909 INFO L168 Benchmark]: Boogie Preprocessor took 24.60 ms. Allocated memory is still 56.6 MB. Free memory was 38.9 MB in the beginning and 37.9 MB in the end (delta: 969.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 09:00:34,909 INFO L168 Benchmark]: RCFGBuilder took 481.88 ms. Allocated memory is still 56.6 MB. Free memory was 37.9 MB in the beginning and 24.8 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-26 09:00:34,909 INFO L168 Benchmark]: TraceAbstraction took 25059.66 ms. Allocated memory was 71.3 MB in the beginning and 383.8 MB in the end (delta: 312.5 MB). Free memory was 54.6 MB in the beginning and 119.6 MB in the end (delta: -65.0 MB). Peak memory consumption was 246.8 MB. Max. memory is 16.1 GB. [2021-08-26 09:00:34,910 INFO L168 Benchmark]: Witness Printer took 88.27 ms. Allocated memory is still 383.8 MB. Free memory was 118.5 MB in the beginning and 99.7 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-08-26 09:00:34,911 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.27 ms. Allocated memory is still 56.6 MB. Free memory was 38.7 MB in the beginning and 38.7 MB in the end (delta: 1.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 200.09 ms. Allocated memory is still 56.6 MB. Free memory was 35.7 MB in the beginning and 40.4 MB in the end (delta: -4.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 26.34 ms. Allocated memory is still 56.6 MB. Free memory was 40.3 MB in the beginning and 38.9 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 24.60 ms. Allocated memory is still 56.6 MB. Free memory was 38.9 MB in the beginning and 37.9 MB in the end (delta: 969.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 481.88 ms. Allocated memory is still 56.6 MB. Free memory was 37.9 MB in the beginning and 24.8 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 25059.66 ms. Allocated memory was 71.3 MB in the beginning and 383.8 MB in the end (delta: 312.5 MB). Free memory was 54.6 MB in the beginning and 119.6 MB in the end (delta: -65.0 MB). Peak memory consumption was 246.8 MB. Max. memory is 16.1 GB. * Witness Printer took 88.27 ms. Allocated memory is still 383.8 MB. Free memory was 118.5 MB in the beginning and 99.7 MB in the end (delta: 18.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: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_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 [L41] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24888.6ms, OverallIterations: 15, TraceHistogramMax: 42, EmptinessCheckTime: 39.7ms, AutomataDifference: 6557.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 445 SDtfs, 1030 SDslu, 3494 SDs, 0 SdLazy, 7130 SolverSat, 1314 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3279.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3612 GetRequests, 3221 SyntacticMatches, 2 SemanticMatches, 389 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4387 ImplicationChecksByTransitivity, 3366.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=13, InterpolantAutomatonStates: 340, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 148.3ms AutomataMinimizationTime, 14 MinimizatonAttempts, 309 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 238.0ms SsaConstructionTime, 827.8ms SatisfiabilityAnalysisTime, 11354.5ms InterpolantComputationTime, 5525 NumberOfCodeBlocks, 5109 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 5039 ConstructedInterpolants, 0 QuantifiedInterpolants, 7119 SizeOfPredicates, 62 NumberOfNonLiveVariables, 4916 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 48083/56628 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-26 09:00:34,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...