./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 35987657 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 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 05:07:52,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 05:07:52,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 05:07:52,883 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 05:07:52,883 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 05:07:52,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 05:07:52,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 05:07:52,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 05:07:52,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 05:07:52,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 05:07:52,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 05:07:52,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 05:07:52,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 05:07:52,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 05:07:52,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 05:07:52,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 05:07:52,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 05:07:52,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 05:07:52,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 05:07:52,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 05:07:52,896 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 05:07:52,901 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 05:07:52,902 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 05:07:52,903 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 05:07:52,903 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 05:07:52,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 05:07:52,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 05:07:52,905 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 05:07:52,906 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 05:07:52,906 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 05:07:52,907 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 05:07:52,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 05:07:52,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 05:07:52,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 05:07:52,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 05:07:52,909 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 05:07:52,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 05:07:52,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 05:07:52,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 05:07:52,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 05:07:52,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 05:07:52,917 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 05:07:52,917 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 05:07:52,933 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 05:07:52,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 05:07:52,934 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 05:07:52,934 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 05:07:52,934 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 05:07:52,934 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 05:07:52,935 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 05:07:52,935 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 05:07:52,935 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 05:07:52,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 05:07:52,935 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 05:07:52,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 05:07:52,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 05:07:52,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 05:07:52,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 05:07:52,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 05:07:52,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 05:07:52,936 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 05:07:52,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 05:07:52,936 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 05:07:52,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 05:07:52,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 05:07:52,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 05:07:52,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 05:07:52,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 05:07:52,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 05:07:52,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 05:07:52,937 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 05:07:52,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 05:07:52,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 05:07:52,937 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 05:07:52,937 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 05:07:52,937 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 05:07:52,937 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 -> 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 [2022-07-21 05:07:53,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 05:07:53,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 05:07:53,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 05:07:53,259 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 05:07:53,260 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 05:07:53,262 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 [2022-07-21 05:07:53,304 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/399486c67/4495382efc6345419e7c3c634c50e109/FLAG1c39dfb80 [2022-07-21 05:07:53,686 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 05:07:53,687 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2022-07-21 05:07:53,691 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/399486c67/4495382efc6345419e7c3c634c50e109/FLAG1c39dfb80 [2022-07-21 05:07:54,138 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/399486c67/4495382efc6345419e7c3c634c50e109 [2022-07-21 05:07:54,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 05:07:54,142 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 05:07:54,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 05:07:54,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 05:07:54,147 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 05:07:54,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:07:54" (1/1) ... [2022-07-21 05:07:54,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee5d668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:07:54, skipping insertion in model container [2022-07-21 05:07:54,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:07:54" (1/1) ... [2022-07-21 05:07:54,153 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 05:07:54,163 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 05:07:54,250 WARN L230 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] [2022-07-21 05:07:54,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 05:07:54,256 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 05:07:54,265 WARN L230 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] [2022-07-21 05:07:54,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 05:07:54,275 INFO L208 MainTranslator]: Completed translation [2022-07-21 05:07:54,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:07:54 WrapperNode [2022-07-21 05:07:54,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 05:07:54,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 05:07:54,276 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 05:07:54,276 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 05:07:54,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:07:54" (1/1) ... [2022-07-21 05:07:54,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:07:54" (1/1) ... [2022-07-21 05:07:54,324 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-07-21 05:07:54,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 05:07:54,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 05:07:54,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 05:07:54,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 05:07:54,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:07:54" (1/1) ... [2022-07-21 05:07:54,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:07:54" (1/1) ... [2022-07-21 05:07:54,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:07:54" (1/1) ... [2022-07-21 05:07:54,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:07:54" (1/1) ... [2022-07-21 05:07:54,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:07:54" (1/1) ... [2022-07-21 05:07:54,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:07:54" (1/1) ... [2022-07-21 05:07:54,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:07:54" (1/1) ... [2022-07-21 05:07:54,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 05:07:54,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 05:07:54,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 05:07:54,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 05:07:54,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:07:54" (1/1) ... [2022-07-21 05:07:54,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 05:07:54,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:07:54,376 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) [2022-07-21 05:07:54,398 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 [2022-07-21 05:07:54,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 05:07:54,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 05:07:54,416 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2022-07-21 05:07:54,417 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2022-07-21 05:07:54,417 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2022-07-21 05:07:54,417 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2022-07-21 05:07:54,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 05:07:54,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 05:07:54,464 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 05:07:54,465 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 05:07:54,588 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 05:07:54,592 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 05:07:54,592 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 05:07:54,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:07:54 BoogieIcfgContainer [2022-07-21 05:07:54,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 05:07:54,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 05:07:54,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 05:07:54,602 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 05:07:54,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:07:54" (1/3) ... [2022-07-21 05:07:54,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6832fefb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:07:54, skipping insertion in model container [2022-07-21 05:07:54,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:07:54" (2/3) ... [2022-07-21 05:07:54,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6832fefb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:07:54, skipping insertion in model container [2022-07-21 05:07:54,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:07:54" (3/3) ... [2022-07-21 05:07:54,604 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2022-07-21 05:07:54,614 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 05:07:54,615 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 05:07:54,675 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 05:07:54,682 INFO L357 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, mAutomataTypeConcurrency=PETRI_NET, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@228fef07, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@c52c4b0 [2022-07-21 05:07:54,682 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 05:07:54,684 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) [2022-07-21 05:07:54,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 05:07:54,702 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:07:54,703 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:07:54,703 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:07:54,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:07:54,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2022-07-21 05:07:54,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:07:54,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890490362] [2022-07-21 05:07:54,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:07:54,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:07:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:54,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:07:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:54,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 05:07:54,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:07:54,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890490362] [2022-07-21 05:07:54,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890490362] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:07:54,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:07:54,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 05:07:54,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137930269] [2022-07-21 05:07:54,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:07:54,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 05:07:54,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:07:54,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 05:07:54,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:07:54,900 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) [2022-07-21 05:07:54,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:07:54,950 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-07-21 05:07:54,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 05:07:54,952 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 [2022-07-21 05:07:54,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:07:54,957 INFO L225 Difference]: With dead ends: 43 [2022-07-21 05:07:54,957 INFO L226 Difference]: Without dead ends: 27 [2022-07-21 05:07:54,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:07:54,961 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:07:54,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 123 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:07:54,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-21 05:07:54,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-21 05:07:54,986 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) [2022-07-21 05:07:54,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-07-21 05:07:54,988 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2022-07-21 05:07:54,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:07:54,988 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-07-21 05:07:54,988 INFO L496 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) [2022-07-21 05:07:54,988 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-07-21 05:07:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 05:07:54,989 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:07:54,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:07:54,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 05:07:54,990 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:07:54,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:07:54,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2022-07-21 05:07:54,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:07:54,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001239438] [2022-07-21 05:07:54,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:07:54,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:07:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:55,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:07:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:55,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 05:07:55,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:07:55,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001239438] [2022-07-21 05:07:55,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001239438] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:07:55,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:07:55,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 05:07:55,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020525130] [2022-07-21 05:07:55,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:07:55,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 05:07:55,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:07:55,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 05:07:55,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:07:55,037 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) [2022-07-21 05:07:55,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:07:55,059 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-07-21 05:07:55,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 05:07:55,060 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 [2022-07-21 05:07:55,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:07:55,061 INFO L225 Difference]: With dead ends: 33 [2022-07-21 05:07:55,061 INFO L226 Difference]: Without dead ends: 29 [2022-07-21 05:07:55,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:07:55,065 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:07:55,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:07:55,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-21 05:07:55,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-07-21 05:07:55,076 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) [2022-07-21 05:07:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-07-21 05:07:55,077 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2022-07-21 05:07:55,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:07:55,077 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-07-21 05:07:55,078 INFO L496 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) [2022-07-21 05:07:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-07-21 05:07:55,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-21 05:07:55,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:07:55,079 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:07:55,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 05:07:55,079 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:07:55,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:07:55,080 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2022-07-21 05:07:55,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:07:55,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923058349] [2022-07-21 05:07:55,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:07:55,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:07:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:55,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:07:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:55,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:07:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:55,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 05:07:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 05:07:55,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:07:55,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923058349] [2022-07-21 05:07:55,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923058349] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:07:55,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689965642] [2022-07-21 05:07:55,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:07:55,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:07:55,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:07:55,179 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) [2022-07-21 05:07:55,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 05:07:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:55,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 05:07:55,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:07:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 05:07:55,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:07:55,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 05:07:55,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689965642] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:07:55,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:07:55,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2022-07-21 05:07:55,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596547503] [2022-07-21 05:07:55,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:07:55,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 05:07:55,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:07:55,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 05:07:55,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-21 05:07:55,428 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 05:07:55,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:07:55,620 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2022-07-21 05:07:55,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 05:07:55,620 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2022-07-21 05:07:55,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:07:55,623 INFO L225 Difference]: With dead ends: 55 [2022-07-21 05:07:55,623 INFO L226 Difference]: Without dead ends: 31 [2022-07-21 05:07:55,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-07-21 05:07:55,627 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:07:55,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 112 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:07:55,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-21 05:07:55,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-07-21 05:07:55,635 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) [2022-07-21 05:07:55,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-07-21 05:07:55,638 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2022-07-21 05:07:55,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:07:55,638 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-07-21 05:07:55,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 05:07:55,639 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-07-21 05:07:55,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 05:07:55,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:07:55,643 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:07:55,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-21 05:07:55,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:07:55,861 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:07:55,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:07:55,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2022-07-21 05:07:55,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:07:55,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588902847] [2022-07-21 05:07:55,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:07:55,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:07:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:55,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:07:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:55,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:07:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:55,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:07:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:55,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 05:07:55,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:07:55,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588902847] [2022-07-21 05:07:55,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588902847] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:07:55,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449565908] [2022-07-21 05:07:55,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:07:55,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:07:55,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:07:55,943 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) [2022-07-21 05:07:55,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 05:07:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:55,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 05:07:55,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:07:56,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 05:07:56,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:07:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 05:07:56,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449565908] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:07:56,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:07:56,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-07-21 05:07:56,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007672190] [2022-07-21 05:07:56,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:07:56,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 05:07:56,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:07:56,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 05:07:56,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-21 05:07:56,126 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-21 05:07:56,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:07:56,252 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2022-07-21 05:07:56,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 05:07:56,253 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 24 [2022-07-21 05:07:56,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:07:56,255 INFO L225 Difference]: With dead ends: 51 [2022-07-21 05:07:56,255 INFO L226 Difference]: Without dead ends: 47 [2022-07-21 05:07:56,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-21 05:07:56,256 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:07:56,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 92 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:07:56,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-21 05:07:56,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-07-21 05:07:56,262 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) [2022-07-21 05:07:56,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2022-07-21 05:07:56,263 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2022-07-21 05:07:56,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:07:56,263 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-07-21 05:07:56,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-21 05:07:56,264 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-07-21 05:07:56,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 05:07:56,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:07:56,265 INFO L195 NwaCegarLoop]: 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] [2022-07-21 05:07:56,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 05:07:56,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-21 05:07:56,483 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:07:56,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:07:56,483 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2022-07-21 05:07:56,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:07:56,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368570403] [2022-07-21 05:07:56,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:07:56,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:07:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:56,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:07:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:56,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:07:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:56,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:07:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:56,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 05:07:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:56,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 05:07:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:56,567 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-21 05:07:56,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:07:56,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368570403] [2022-07-21 05:07:56,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368570403] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:07:56,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191996294] [2022-07-21 05:07:56,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:07:56,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:07:56,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:07:56,569 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) [2022-07-21 05:07:56,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 05:07:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:56,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 05:07:56,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:07:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 05:07:56,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:07:56,888 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 05:07:56,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191996294] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:07:56,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:07:56,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2022-07-21 05:07:56,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869890219] [2022-07-21 05:07:56,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:07:56,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-21 05:07:56,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:07:56,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-21 05:07:56,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-07-21 05:07:56,890 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-21 05:07:57,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:07:57,038 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2022-07-21 05:07:57,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 05:07:57,039 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2022-07-21 05:07:57,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:07:57,040 INFO L225 Difference]: With dead ends: 105 [2022-07-21 05:07:57,040 INFO L226 Difference]: Without dead ends: 63 [2022-07-21 05:07:57,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2022-07-21 05:07:57,042 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 65 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:07:57,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 95 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:07:57,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-21 05:07:57,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-07-21 05:07:57,066 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) [2022-07-21 05:07:57,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2022-07-21 05:07:57,067 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2022-07-21 05:07:57,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:07:57,068 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2022-07-21 05:07:57,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-21 05:07:57,068 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2022-07-21 05:07:57,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-21 05:07:57,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:07:57,074 INFO L195 NwaCegarLoop]: 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] [2022-07-21 05:07:57,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-21 05:07:57,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:07:57,293 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:07:57,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:07:57,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2022-07-21 05:07:57,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:07:57,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934221235] [2022-07-21 05:07:57,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:07:57,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:07:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:57,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:07:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:57,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:07:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:57,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:07:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:57,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:07:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:57,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:07:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:57,374 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-21 05:07:57,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:07:57,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934221235] [2022-07-21 05:07:57,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934221235] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:07:57,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169541707] [2022-07-21 05:07:57,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:07:57,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:07:57,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:07:57,404 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) [2022-07-21 05:07:57,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 05:07:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:57,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 05:07:57,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:07:57,547 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-21 05:07:57,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:07:57,789 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 05:07:57,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169541707] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:07:57,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:07:57,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2022-07-21 05:07:57,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697911134] [2022-07-21 05:07:57,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:07:57,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 05:07:57,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:07:57,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 05:07:57,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-07-21 05:07:57,792 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-21 05:07:58,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:07:58,092 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2022-07-21 05:07:58,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 05:07:58,092 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 37 [2022-07-21 05:07:58,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:07:58,094 INFO L225 Difference]: With dead ends: 177 [2022-07-21 05:07:58,094 INFO L226 Difference]: Without dead ends: 117 [2022-07-21 05:07:58,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2022-07-21 05:07:58,096 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 60 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 05:07:58,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 222 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 05:07:58,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-21 05:07:58,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2022-07-21 05:07:58,120 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) [2022-07-21 05:07:58,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2022-07-21 05:07:58,121 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2022-07-21 05:07:58,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:07:58,121 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2022-07-21 05:07:58,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-21 05:07:58,121 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2022-07-21 05:07:58,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-21 05:07:58,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:07:58,123 INFO L195 NwaCegarLoop]: 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] [2022-07-21 05:07:58,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 05:07:58,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:07:58,323 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:07:58,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:07:58,324 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2022-07-21 05:07:58,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:07:58,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67634587] [2022-07-21 05:07:58,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:07:58,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:07:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:58,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:07:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:58,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:07:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:58,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:07:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:58,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:07:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:58,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:07:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:58,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:07:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:58,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 05:07:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-21 05:07:58,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:07:58,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67634587] [2022-07-21 05:07:58,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67634587] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:07:58,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656018338] [2022-07-21 05:07:58,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:07:58,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:07:58,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:07:58,432 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) [2022-07-21 05:07:58,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 05:07:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:58,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 05:07:58,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:07:58,530 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-21 05:07:58,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:07:58,880 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 05:07:58,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656018338] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:07:58,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:07:58,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2022-07-21 05:07:58,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963470731] [2022-07-21 05:07:58,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:07:58,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 05:07:58,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:07:58,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 05:07:58,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-07-21 05:07:58,882 INFO L87 Difference]: Start difference. First operand 103 states and 166 transitions. Second operand has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2022-07-21 05:07:59,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:07:59,215 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2022-07-21 05:07:59,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 05:07:59,216 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) Word has length 51 [2022-07-21 05:07:59,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:07:59,217 INFO L225 Difference]: With dead ends: 255 [2022-07-21 05:07:59,217 INFO L226 Difference]: Without dead ends: 155 [2022-07-21 05:07:59,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2022-07-21 05:07:59,219 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 76 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 05:07:59,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 227 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 05:07:59,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-21 05:07:59,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2022-07-21 05:07:59,231 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) [2022-07-21 05:07:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2022-07-21 05:07:59,232 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2022-07-21 05:07:59,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:07:59,232 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2022-07-21 05:07:59,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2022-07-21 05:07:59,233 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2022-07-21 05:07:59,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-21 05:07:59,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:07:59,234 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:07:59,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-21 05:07:59,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:07:59,449 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:07:59,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:07:59,449 INFO L85 PathProgramCache]: Analyzing trace with hash -586612948, now seen corresponding path program 1 times [2022-07-21 05:07:59,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:07:59,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496938112] [2022-07-21 05:07:59,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:07:59,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:07:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:59,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:07:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:59,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:07:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:59,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:07:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:59,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:07:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:59,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:07:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:59,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:07:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:59,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:07:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:59,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:07:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:59,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 05:07:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:59,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:07:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:59,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:07:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:59,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:07:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:59,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:07:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:59,622 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-21 05:07:59,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:07:59,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496938112] [2022-07-21 05:07:59,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496938112] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:07:59,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408906560] [2022-07-21 05:07:59,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:07:59,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:07:59,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:07:59,625 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) [2022-07-21 05:07:59,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 05:07:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:07:59,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 05:07:59,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:07:59,791 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 92 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-21 05:07:59,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:08:00,253 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 102 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-21 05:08:00,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408906560] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:08:00,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:08:00,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 24 [2022-07-21 05:08:00,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019663447] [2022-07-21 05:08:00,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:08:00,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-21 05:08:00,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:00,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-21 05:08:00,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2022-07-21 05:08:00,255 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand has 24 states, 22 states have (on average 3.5) internal successors, (77), 24 states have internal predecessors, (77), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) [2022-07-21 05:08:00,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:00,632 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2022-07-21 05:08:00,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-21 05:08:00,633 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.5) internal successors, (77), 24 states have internal predecessors, (77), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) Word has length 93 [2022-07-21 05:08:00,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:00,634 INFO L225 Difference]: With dead ends: 240 [2022-07-21 05:08:00,634 INFO L226 Difference]: Without dead ends: 107 [2022-07-21 05:08:00,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2022-07-21 05:08:00,636 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 111 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 05:08:00,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 209 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 05:08:00,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-21 05:08:00,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2022-07-21 05:08:00,643 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) [2022-07-21 05:08:00,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2022-07-21 05:08:00,644 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 93 [2022-07-21 05:08:00,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:00,644 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2022-07-21 05:08:00,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.5) internal successors, (77), 24 states have internal predecessors, (77), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) [2022-07-21 05:08:00,644 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2022-07-21 05:08:00,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-21 05:08:00,645 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:00,646 INFO L195 NwaCegarLoop]: 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] [2022-07-21 05:08:00,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 05:08:00,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:00,867 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:00,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:00,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1129417830, now seen corresponding path program 1 times [2022-07-21 05:08:00,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:00,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497355470] [2022-07-21 05:08:00,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:00,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:00,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:00,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:00,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:00,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:00,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:01,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:01,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:01,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:01,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:08:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:01,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 05:08:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:01,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:01,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:01,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:01,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:01,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:01,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:08:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:01,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-21 05:08:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:01,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:01,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:01,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:01,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:01,063 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 73 proven. 135 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2022-07-21 05:08:01,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:01,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497355470] [2022-07-21 05:08:01,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497355470] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:08:01,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413578268] [2022-07-21 05:08:01,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:01,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:01,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:01,065 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) [2022-07-21 05:08:01,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 05:08:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:01,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-21 05:08:01,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:08:01,284 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 36 proven. 211 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2022-07-21 05:08:01,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:08:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 36 proven. 227 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-07-21 05:08:02,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413578268] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:08:02,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:08:02,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 26 [2022-07-21 05:08:02,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578725639] [2022-07-21 05:08:02,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:08:02,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-21 05:08:02,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:02,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-21 05:08:02,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2022-07-21 05:08:02,234 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2022-07-21 05:08:02,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:02,663 INFO L93 Difference]: Finished difference Result 214 states and 372 transitions. [2022-07-21 05:08:02,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-21 05:08:02,664 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) Word has length 148 [2022-07-21 05:08:02,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:02,665 INFO L225 Difference]: With dead ends: 214 [2022-07-21 05:08:02,665 INFO L226 Difference]: Without dead ends: 134 [2022-07-21 05:08:02,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=1285, Unknown=0, NotChecked=0, Total=1560 [2022-07-21 05:08:02,666 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 108 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 05:08:02,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 235 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 05:08:02,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-21 05:08:02,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2022-07-21 05:08:02,673 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) [2022-07-21 05:08:02,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2022-07-21 05:08:02,674 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 148 [2022-07-21 05:08:02,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:02,674 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2022-07-21 05:08:02,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2022-07-21 05:08:02,674 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2022-07-21 05:08:02,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-07-21 05:08:02,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:02,683 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 18, 18, 17, 16, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:02,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 05:08:02,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:02,896 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:02,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:02,896 INFO L85 PathProgramCache]: Analyzing trace with hash -399650163, now seen corresponding path program 2 times [2022-07-21 05:08:02,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:02,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337759966] [2022-07-21 05:08:02,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:02,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:08:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:08:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 05:08:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-21 05:08:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:08:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:08:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 05:08:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 169 proven. 360 refuted. 0 times theorem prover too weak. 1503 trivial. 0 not checked. [2022-07-21 05:08:03,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:03,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337759966] [2022-07-21 05:08:03,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337759966] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:08:03,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505252975] [2022-07-21 05:08:03,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 05:08:03,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:03,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:03,269 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) [2022-07-21 05:08:03,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 05:08:03,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 05:08:03,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:08:03,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-21 05:08:03,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:08:03,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 79 proven. 543 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2022-07-21 05:08:03,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:08:04,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 79 proven. 567 refuted. 0 times theorem prover too weak. 1386 trivial. 0 not checked. [2022-07-21 05:08:04,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505252975] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:08:04,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:08:04,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 27 [2022-07-21 05:08:04,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945057492] [2022-07-21 05:08:04,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:08:04,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-21 05:08:04,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:04,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-21 05:08:04,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2022-07-21 05:08:04,868 INFO L87 Difference]: Start difference. First operand 114 states and 169 transitions. Second operand has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 27 states have internal predecessors, (90), 21 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) [2022-07-21 05:08:05,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:05,359 INFO L93 Difference]: Finished difference Result 260 states and 447 transitions. [2022-07-21 05:08:05,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-21 05:08:05,360 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 27 states have internal predecessors, (90), 21 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) Word has length 271 [2022-07-21 05:08:05,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:05,361 INFO L225 Difference]: With dead ends: 260 [2022-07-21 05:08:05,361 INFO L226 Difference]: Without dead ends: 155 [2022-07-21 05:08:05,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 605 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=339, Invalid=1553, Unknown=0, NotChecked=0, Total=1892 [2022-07-21 05:08:05,363 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 109 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 05:08:05,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 270 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 05:08:05,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-21 05:08:05,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2022-07-21 05:08:05,386 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) [2022-07-21 05:08:05,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 224 transitions. [2022-07-21 05:08:05,387 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 224 transitions. Word has length 271 [2022-07-21 05:08:05,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:05,387 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 224 transitions. [2022-07-21 05:08:05,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 27 states have internal predecessors, (90), 21 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) [2022-07-21 05:08:05,388 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 224 transitions. [2022-07-21 05:08:05,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2022-07-21 05:08:05,391 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:05,391 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 27, 27, 25, 23, 15, 15, 15, 15, 15, 15, 15, 13, 13, 13, 13, 13, 13, 13, 12, 8, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:05,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-21 05:08:05,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-21 05:08:05,608 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:05,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:05,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1123052726, now seen corresponding path program 3 times [2022-07-21 05:08:05,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:05,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483134315] [2022-07-21 05:08:05,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:05,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:05,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:05,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:05,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:05,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:05,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:05,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:05,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:05,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:05,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:05,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:05,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:08:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:05,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:05,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:05,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:08:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:05,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:05,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:05,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 05:08:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:08:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:08:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-21 05:08:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:08:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-21 05:08:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:08:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:08:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 05:08:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 264 proven. 626 refuted. 0 times theorem prover too weak. 3539 trivial. 0 not checked. [2022-07-21 05:08:06,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:06,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483134315] [2022-07-21 05:08:06,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483134315] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:08:06,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665264264] [2022-07-21 05:08:06,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 05:08:06,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:06,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:06,131 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) [2022-07-21 05:08:06,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 05:08:06,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-21 05:08:06,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:08:06,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 05:08:06,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:08:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 434 proven. 4 refuted. 0 times theorem prover too weak. 3991 trivial. 0 not checked. [2022-07-21 05:08:06,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:08:06,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 434 proven. 4 refuted. 0 times theorem prover too weak. 3991 trivial. 0 not checked. [2022-07-21 05:08:06,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665264264] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:08:06,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:08:06,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 19 [2022-07-21 05:08:06,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106307845] [2022-07-21 05:08:06,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:08:06,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-21 05:08:06,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:06,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-21 05:08:06,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-07-21 05:08:06,996 INFO L87 Difference]: Start difference. First operand 145 states and 224 transitions. Second operand has 19 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 19 states have internal predecessors, (60), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2022-07-21 05:08:07,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:07,152 INFO L93 Difference]: Finished difference Result 283 states and 457 transitions. [2022-07-21 05:08:07,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 05:08:07,153 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 19 states have internal predecessors, (60), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) Word has length 394 [2022-07-21 05:08:07,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:07,154 INFO L225 Difference]: With dead ends: 283 [2022-07-21 05:08:07,154 INFO L226 Difference]: Without dead ends: 147 [2022-07-21 05:08:07,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 919 GetRequests, 896 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2022-07-21 05:08:07,155 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 73 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:08:07,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 161 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:08:07,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-21 05:08:07,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2022-07-21 05:08:07,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 101 states have (on average 1.198019801980198) internal successors, (121), 98 states have internal predecessors, (121), 26 states have call successors, (26), 19 states have call predecessors, (26), 16 states have return successors, (66), 26 states have call predecessors, (66), 26 states have call successors, (66) [2022-07-21 05:08:07,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 213 transitions. [2022-07-21 05:08:07,162 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 213 transitions. Word has length 394 [2022-07-21 05:08:07,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:07,162 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 213 transitions. [2022-07-21 05:08:07,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 19 states have internal predecessors, (60), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2022-07-21 05:08:07,162 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 213 transitions. [2022-07-21 05:08:07,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2022-07-21 05:08:07,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:07,168 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 36, 36, 33, 31, 21, 21, 21, 21, 21, 21, 21, 18, 18, 18, 18, 18, 18, 18, 15, 10, 10, 5, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:07,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-21 05:08:07,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:07,385 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:07,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:07,385 INFO L85 PathProgramCache]: Analyzing trace with hash -2090861273, now seen corresponding path program 4 times [2022-07-21 05:08:07,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:07,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373538982] [2022-07-21 05:08:07,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:07,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:08:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:08:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 05:08:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:08:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:07,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:08:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-21 05:08:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:08:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:08:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 05:08:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:08:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:08:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2022-07-21 05:08:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:08:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:08:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 8577 backedges. 1090 proven. 942 refuted. 0 times theorem prover too weak. 6545 trivial. 0 not checked. [2022-07-21 05:08:08,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:08,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373538982] [2022-07-21 05:08:08,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373538982] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:08:08,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13719863] [2022-07-21 05:08:08,276 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 05:08:08,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:08,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:08,300 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) [2022-07-21 05:08:08,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-21 05:08:08,482 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 05:08:08,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:08:08,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-21 05:08:08,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:08:08,679 INFO L134 CoverageAnalysis]: Checked inductivity of 8577 backedges. 490 proven. 1080 refuted. 0 times theorem prover too weak. 7007 trivial. 0 not checked. [2022-07-21 05:08:08,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:08:10,825 INFO L134 CoverageAnalysis]: Checked inductivity of 8577 backedges. 492 proven. 1108 refuted. 0 times theorem prover too weak. 6977 trivial. 0 not checked. [2022-07-21 05:08:10,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13719863] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:08:10,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:08:10,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13, 19] total 42 [2022-07-21 05:08:10,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023712522] [2022-07-21 05:08:10,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:08:10,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-21 05:08:10,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:10,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-21 05:08:10,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1485, Unknown=0, NotChecked=0, Total=1722 [2022-07-21 05:08:10,828 INFO L87 Difference]: Start difference. First operand 144 states and 213 transitions. Second operand has 42 states, 40 states have (on average 2.8) internal successors, (112), 42 states have internal predecessors, (112), 29 states have call successors, (36), 1 states have call predecessors, (36), 18 states have return successors, (48), 28 states have call predecessors, (48), 29 states have call successors, (48) [2022-07-21 05:08:11,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:11,710 INFO L93 Difference]: Finished difference Result 355 states and 619 transitions. [2022-07-21 05:08:11,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-21 05:08:11,711 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 2.8) internal successors, (112), 42 states have internal predecessors, (112), 29 states have call successors, (36), 1 states have call predecessors, (36), 18 states have return successors, (48), 28 states have call predecessors, (48), 29 states have call successors, (48) Word has length 542 [2022-07-21 05:08:11,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:11,713 INFO L225 Difference]: With dead ends: 355 [2022-07-21 05:08:11,713 INFO L226 Difference]: Without dead ends: 183 [2022-07-21 05:08:11,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1285 GetRequests, 1222 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1189 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=535, Invalid=3371, Unknown=0, NotChecked=0, Total=3906 [2022-07-21 05:08:11,715 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 169 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1639 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 1639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 05:08:11,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 537 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 1639 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 05:08:11,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-07-21 05:08:11,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 155. [2022-07-21 05:08:11,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 109 states have (on average 1.091743119266055) internal successors, (119), 106 states have internal predecessors, (119), 29 states have call successors, (29), 22 states have call predecessors, (29), 16 states have return successors, (42), 26 states have call predecessors, (42), 29 states have call successors, (42) [2022-07-21 05:08:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 190 transitions. [2022-07-21 05:08:11,722 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 190 transitions. Word has length 542 [2022-07-21 05:08:11,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:11,722 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 190 transitions. [2022-07-21 05:08:11,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 2.8) internal successors, (112), 42 states have internal predecessors, (112), 29 states have call successors, (36), 1 states have call predecessors, (36), 18 states have return successors, (48), 28 states have call predecessors, (48), 29 states have call successors, (48) [2022-07-21 05:08:11,723 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 190 transitions. [2022-07-21 05:08:11,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2022-07-21 05:08:11,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:11,727 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 31, 31, 26, 25, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 11, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:11,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-21 05:08:11,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-21 05:08:11,945 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:11,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:11,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1387676979, now seen corresponding path program 5 times [2022-07-21 05:08:11,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:11,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864002677] [2022-07-21 05:08:11,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:11,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 05:08:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:08:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:08:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 05:08:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:08:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-21 05:08:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:08:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:08:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-21 05:08:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 05:08:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:08:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 05:08:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:08:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 05:08:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 05:08:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:08:12,573 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 1060 proven. 718 refuted. 0 times theorem prover too weak. 3591 trivial. 0 not checked. [2022-07-21 05:08:12,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:08:12,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864002677] [2022-07-21 05:08:12,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864002677] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:08:12,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815390138] [2022-07-21 05:08:12,573 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 05:08:12,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:08:12,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:08:12,575 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) [2022-07-21 05:08:12,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-21 05:08:12,790 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-07-21 05:08:12,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:08:12,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-21 05:08:12,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:08:12,909 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 918 proven. 135 refuted. 0 times theorem prover too weak. 4316 trivial. 0 not checked. [2022-07-21 05:08:12,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:08:14,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 920 proven. 137 refuted. 0 times theorem prover too weak. 4312 trivial. 0 not checked. [2022-07-21 05:08:14,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815390138] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:08:14,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:08:14,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 13, 15] total 41 [2022-07-21 05:08:14,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775902525] [2022-07-21 05:08:14,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:08:14,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-21 05:08:14,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:08:14,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-21 05:08:14,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1407, Unknown=0, NotChecked=0, Total=1640 [2022-07-21 05:08:14,278 INFO L87 Difference]: Start difference. First operand 155 states and 190 transitions. Second operand has 41 states, 40 states have (on average 2.775) internal successors, (111), 41 states have internal predecessors, (111), 23 states have call successors, (35), 1 states have call predecessors, (35), 16 states have return successors, (45), 29 states have call predecessors, (45), 23 states have call successors, (45) [2022-07-21 05:08:14,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:08:14,858 INFO L93 Difference]: Finished difference Result 333 states and 423 transitions. [2022-07-21 05:08:14,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-21 05:08:14,859 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.775) internal successors, (111), 41 states have internal predecessors, (111), 23 states have call successors, (35), 1 states have call predecessors, (35), 16 states have return successors, (45), 29 states have call predecessors, (45), 23 states have call successors, (45) Word has length 433 [2022-07-21 05:08:14,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:08:14,862 INFO L225 Difference]: With dead ends: 333 [2022-07-21 05:08:14,862 INFO L226 Difference]: Without dead ends: 185 [2022-07-21 05:08:14,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1031 GetRequests, 977 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=416, Invalid=2446, Unknown=0, NotChecked=0, Total=2862 [2022-07-21 05:08:14,866 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 132 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 05:08:14,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 584 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 05:08:14,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-21 05:08:14,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 159. [2022-07-21 05:08:14,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 112 states have (on average 1.0535714285714286) internal successors, (118), 110 states have internal predecessors, (118), 30 states have call successors, (30), 23 states have call predecessors, (30), 16 states have return successors, (41), 25 states have call predecessors, (41), 30 states have call successors, (41) [2022-07-21 05:08:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 189 transitions. [2022-07-21 05:08:14,879 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 189 transitions. Word has length 433 [2022-07-21 05:08:14,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:08:14,881 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 189 transitions. [2022-07-21 05:08:14,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.775) internal successors, (111), 41 states have internal predecessors, (111), 23 states have call successors, (35), 1 states have call predecessors, (35), 16 states have return successors, (45), 29 states have call predecessors, (45), 23 states have call successors, (45) [2022-07-21 05:08:14,882 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 189 transitions. [2022-07-21 05:08:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2022-07-21 05:08:14,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:08:14,884 INFO L195 NwaCegarLoop]: 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] [2022-07-21 05:08:14,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-21 05:08:15,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-21 05:08:15,103 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:08:15,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:08:15,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1402769443, now seen corresponding path program 6 times [2022-07-21 05:08:15,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:08:15,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679616003] [2022-07-21 05:08:15,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:08:15,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:08:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 05:08:15,143 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 05:08:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 05:08:15,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 05:08:15,234 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 05:08:15,235 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 05:08:15,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 05:08:15,240 INFO L356 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:08:15,244 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 05:08:15,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 05:08:15 BoogieIcfgContainer [2022-07-21 05:08:15,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 05:08:15,346 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 05:08:15,346 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 05:08:15,346 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 05:08:15,346 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:07:54" (3/4) ... [2022-07-21 05:08:15,348 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 05:08:15,429 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 05:08:15,430 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 05:08:15,430 INFO L158 Benchmark]: Toolchain (without parser) took 21288.24ms. Allocated memory was 60.8MB in the beginning and 287.3MB in the end (delta: 226.5MB). Free memory was 42.2MB in the beginning and 114.7MB in the end (delta: -72.5MB). Peak memory consumption was 152.1MB. Max. memory is 16.1GB. [2022-07-21 05:08:15,430 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 60.8MB. Free memory was 43.4MB in the beginning and 43.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 05:08:15,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 131.20ms. Allocated memory is still 60.8MB. Free memory was 42.0MB in the beginning and 32.4MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 05:08:15,431 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.79ms. Allocated memory is still 60.8MB. Free memory was 32.2MB in the beginning and 44.5MB in the end (delta: -12.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 05:08:15,431 INFO L158 Benchmark]: Boogie Preprocessor took 12.23ms. Allocated memory is still 60.8MB. Free memory was 44.5MB in the beginning and 43.5MB in the end (delta: 933.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 05:08:15,432 INFO L158 Benchmark]: RCFGBuilder took 255.54ms. Allocated memory is still 60.8MB. Free memory was 43.5MB in the beginning and 34.5MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 05:08:15,432 INFO L158 Benchmark]: TraceAbstraction took 20750.96ms. Allocated memory was 60.8MB in the beginning and 287.3MB in the end (delta: 226.5MB). Free memory was 34.1MB in the beginning and 125.2MB in the end (delta: -91.1MB). Peak memory consumption was 138.7MB. Max. memory is 16.1GB. [2022-07-21 05:08:15,432 INFO L158 Benchmark]: Witness Printer took 84.11ms. Allocated memory is still 287.3MB. Free memory was 125.2MB in the beginning and 114.7MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 05:08:15,435 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.28ms. Allocated memory is still 60.8MB. Free memory was 43.4MB in the beginning and 43.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 131.20ms. Allocated memory is still 60.8MB. Free memory was 42.0MB in the beginning and 32.4MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.79ms. Allocated memory is still 60.8MB. Free memory was 32.2MB in the beginning and 44.5MB in the end (delta: -12.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.23ms. Allocated memory is still 60.8MB. Free memory was 44.5MB in the beginning and 43.5MB in the end (delta: 933.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 255.54ms. Allocated memory is still 60.8MB. Free memory was 43.5MB in the beginning and 34.5MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 20750.96ms. Allocated memory was 60.8MB in the beginning and 287.3MB in the end (delta: 226.5MB). Free memory was 34.1MB in the beginning and 125.2MB in the end (delta: -91.1MB). Peak memory consumption was 138.7MB. Max. memory is 16.1GB. * Witness Printer took 84.11ms. Allocated memory is still 287.3MB. Free memory was 125.2MB in the beginning and 114.7MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s 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; VAL [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) VAL [fibo1(x)=21, x=8] [L39] int result = fibo1(x); [L40] COND TRUE result == 21 VAL [result=21, x=8] [L41] reach_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.6s, OverallIterations: 14, TraceHistogramMax: 43, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1038 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 971 mSDsluCounter, 2989 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2579 mSDsCounter, 1212 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6357 IncrementalHoareTripleChecker+Invalid, 7569 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1212 mSolverCounterUnsat, 410 mSDtfsCounter, 6357 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4962 GetRequests, 4594 SyntacticMatches, 15 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3353 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=13, InterpolantAutomatonStates: 260, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 176 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 4585 NumberOfCodeBlocks, 4111 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 6142 ConstructedInterpolants, 0 QuantifiedInterpolants, 9059 SizeOfPredicates, 48 NumberOfNonLiveVariables, 3660 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 35 InterpolantComputations, 2 PerfectInterpolantSequences, 56580/63747 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! [2022-07-21 05:08:15,481 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE