./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 f4b24e32 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-?-f4b24e3 [2022-07-13 18:06:46,966 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 18:06:46,968 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 18:06:46,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 18:06:46,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 18:06:46,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 18:06:46,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 18:06:46,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 18:06:46,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 18:06:46,991 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 18:06:46,992 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 18:06:46,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 18:06:46,993 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 18:06:46,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 18:06:46,994 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 18:06:46,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 18:06:46,996 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 18:06:46,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 18:06:47,000 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 18:06:47,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 18:06:47,005 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 18:06:47,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 18:06:47,006 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 18:06:47,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 18:06:47,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 18:06:47,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 18:06:47,010 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 18:06:47,010 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 18:06:47,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 18:06:47,011 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 18:06:47,012 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 18:06:47,012 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 18:06:47,013 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 18:06:47,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 18:06:47,014 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 18:06:47,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 18:06:47,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 18:06:47,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 18:06:47,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 18:06:47,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 18:06:47,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 18:06:47,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 18:06:47,017 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 18:06:47,031 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 18:06:47,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 18:06:47,032 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 18:06:47,032 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 18:06:47,033 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 18:06:47,033 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 18:06:47,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 18:06:47,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 18:06:47,034 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 18:06:47,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 18:06:47,034 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 18:06:47,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 18:06:47,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 18:06:47,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 18:06:47,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 18:06:47,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 18:06:47,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 18:06:47,036 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 18:06:47,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 18:06:47,036 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 18:06:47,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 18:06:47,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 18:06:47,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 18:06:47,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 18:06:47,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:06:47,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 18:06:47,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 18:06:47,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 18:06:47,038 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 18:06:47,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 18:06:47,038 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 18:06:47,039 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 18:06:47,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 18:06:47,039 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-13 18:06:47,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 18:06:47,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 18:06:47,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 18:06:47,244 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 18:06:47,245 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 18:06:47,246 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-13 18:06:47,288 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47b8eca4b/dfb311299fbb488ba573d94db398eb07/FLAGb6a200711 [2022-07-13 18:06:47,616 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 18:06:47,617 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2022-07-13 18:06:47,623 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47b8eca4b/dfb311299fbb488ba573d94db398eb07/FLAGb6a200711 [2022-07-13 18:06:47,635 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47b8eca4b/dfb311299fbb488ba573d94db398eb07 [2022-07-13 18:06:47,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 18:06:47,638 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 18:06:47,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 18:06:47,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 18:06:47,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 18:06:47,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:06:47" (1/1) ... [2022-07-13 18:06:47,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e40ad45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:06:47, skipping insertion in model container [2022-07-13 18:06:47,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:06:47" (1/1) ... [2022-07-13 18:06:47,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 18:06:47,659 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 18:06:47,796 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-13 18:06:47,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:06:47,803 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 18:06:47,819 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-13 18:06:47,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:06:47,830 INFO L208 MainTranslator]: Completed translation [2022-07-13 18:06:47,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:06:47 WrapperNode [2022-07-13 18:06:47,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 18:06:47,831 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 18:06:47,831 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 18:06:47,832 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 18:06:47,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:06:47" (1/1) ... [2022-07-13 18:06:47,841 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:06:47" (1/1) ... [2022-07-13 18:06:47,852 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-07-13 18:06:47,852 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 18:06:47,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 18:06:47,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 18:06:47,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 18:06:47,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:06:47" (1/1) ... [2022-07-13 18:06:47,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:06:47" (1/1) ... [2022-07-13 18:06:47,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:06:47" (1/1) ... [2022-07-13 18:06:47,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:06:47" (1/1) ... [2022-07-13 18:06:47,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:06:47" (1/1) ... [2022-07-13 18:06:47,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:06:47" (1/1) ... [2022-07-13 18:06:47,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:06:47" (1/1) ... [2022-07-13 18:06:47,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 18:06:47,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 18:06:47,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 18:06:47,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 18:06:47,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:06:47" (1/1) ... [2022-07-13 18:06:47,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:06:47,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:06:47,904 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-13 18:06:47,946 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-13 18:06:47,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 18:06:47,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 18:06:47,957 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2022-07-13 18:06:47,957 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2022-07-13 18:06:47,957 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2022-07-13 18:06:47,957 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2022-07-13 18:06:47,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 18:06:47,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 18:06:47,994 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 18:06:47,996 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 18:06:48,113 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 18:06:48,119 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 18:06:48,120 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 18:06:48,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:06:48 BoogieIcfgContainer [2022-07-13 18:06:48,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 18:06:48,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 18:06:48,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 18:06:48,126 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 18:06:48,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 06:06:47" (1/3) ... [2022-07-13 18:06:48,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c66a58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:06:48, skipping insertion in model container [2022-07-13 18:06:48,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:06:47" (2/3) ... [2022-07-13 18:06:48,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c66a58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:06:48, skipping insertion in model container [2022-07-13 18:06:48,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:06:48" (3/3) ... [2022-07-13 18:06:48,129 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2022-07-13 18:06:48,138 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 18:06:48,138 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 18:06:48,180 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 18:06:48,186 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@14ab3196, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@db478ad [2022-07-13 18:06:48,186 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 18:06:48,189 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-13 18:06:48,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 18:06:48,201 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:06:48,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:06:48,202 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:06:48,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:06:48,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2022-07-13 18:06:48,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:06:48,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496746395] [2022-07-13 18:06:48,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:06:48,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:06:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:48,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:06:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:48,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:06:48,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:06:48,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496746395] [2022-07-13 18:06:48,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496746395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:06:48,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:06:48,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 18:06:48,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536121933] [2022-07-13 18:06:48,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:06:48,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:06:48,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:06:48,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:06:48,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:06:48,406 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-13 18:06:48,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:06:48,447 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-07-13 18:06:48,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:06:48,449 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-13 18:06:48,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:06:48,454 INFO L225 Difference]: With dead ends: 43 [2022-07-13 18:06:48,455 INFO L226 Difference]: Without dead ends: 27 [2022-07-13 18:06:48,457 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-13 18:06:48,460 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-13 18:06:48,461 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-13 18:06:48,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-13 18:06:48,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-13 18:06:48,489 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-13 18:06:48,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-07-13 18:06:48,491 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2022-07-13 18:06:48,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:06:48,492 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-07-13 18:06:48,492 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-13 18:06:48,492 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-07-13 18:06:48,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 18:06:48,494 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:06:48,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:06:48,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 18:06:48,494 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:06:48,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:06:48,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2022-07-13 18:06:48,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:06:48,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511757005] [2022-07-13 18:06:48,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:06:48,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:06:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:48,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:06:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:48,534 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-13 18:06:48,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:06:48,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511757005] [2022-07-13 18:06:48,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511757005] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:06:48,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:06:48,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 18:06:48,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806450569] [2022-07-13 18:06:48,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:06:48,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:06:48,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:06:48,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:06:48,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:06:48,538 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-13 18:06:48,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:06:48,564 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-07-13 18:06:48,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:06:48,565 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-13 18:06:48,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:06:48,566 INFO L225 Difference]: With dead ends: 33 [2022-07-13 18:06:48,566 INFO L226 Difference]: Without dead ends: 29 [2022-07-13 18:06:48,566 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-13 18:06:48,567 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-13 18:06:48,568 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-13 18:06:48,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-13 18:06:48,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-07-13 18:06:48,574 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-13 18:06:48,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-07-13 18:06:48,575 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2022-07-13 18:06:48,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:06:48,575 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-07-13 18:06:48,576 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-13 18:06:48,576 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-07-13 18:06:48,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 18:06:48,577 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:06:48,577 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-13 18:06:48,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 18:06:48,578 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:06:48,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:06:48,578 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2022-07-13 18:06:48,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:06:48,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188455628] [2022-07-13 18:06:48,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:06:48,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:06:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:48,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:06:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:48,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:48,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 18:06:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:48,647 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-13 18:06:48,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:06:48,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188455628] [2022-07-13 18:06:48,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188455628] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:06:48,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854239544] [2022-07-13 18:06:48,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:06:48,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:06:48,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:06:48,650 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-13 18:06:48,668 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-13 18:06:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:48,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 18:06:48,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:06:48,793 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-13 18:06:48,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:06:48,925 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-13 18:06:48,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854239544] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:06:48,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:06:48,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2022-07-13 18:06:48,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121116390] [2022-07-13 18:06:48,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:06:48,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 18:06:48,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:06:48,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 18:06:48,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-13 18:06:48,928 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-13 18:06:49,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:06:49,048 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2022-07-13 18:06:49,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 18:06:49,049 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-13 18:06:49,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:06:49,050 INFO L225 Difference]: With dead ends: 55 [2022-07-13 18:06:49,050 INFO L226 Difference]: Without dead ends: 31 [2022-07-13 18:06:49,051 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-13 18:06:49,051 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-13 18:06:49,052 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-13 18:06:49,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-13 18:06:49,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-07-13 18:06:49,056 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-13 18:06:49,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-07-13 18:06:49,057 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2022-07-13 18:06:49,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:06:49,057 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-07-13 18:06:49,057 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-13 18:06:49,057 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-07-13 18:06:49,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 18:06:49,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:06:49,058 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-13 18:06:49,099 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-13 18:06:49,300 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-13 18:06:49,300 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:06:49,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:06:49,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2022-07-13 18:06:49,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:06:49,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171621322] [2022-07-13 18:06:49,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:06:49,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:06:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:49,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:06:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:49,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:49,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:49,365 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-13 18:06:49,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:06:49,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171621322] [2022-07-13 18:06:49,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171621322] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:06:49,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290518001] [2022-07-13 18:06:49,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:06:49,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:06:49,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:06:49,367 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-13 18:06:49,404 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-13 18:06:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:49,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 18:06:49,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:06:49,435 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-13 18:06:49,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:06:49,528 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-13 18:06:49,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290518001] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:06:49,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:06:49,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-07-13 18:06:49,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671606106] [2022-07-13 18:06:49,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:06:49,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 18:06:49,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:06:49,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 18:06:49,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-13 18:06:49,530 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-13 18:06:49,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:06:49,629 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2022-07-13 18:06:49,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 18:06:49,630 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-13 18:06:49,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:06:49,632 INFO L225 Difference]: With dead ends: 51 [2022-07-13 18:06:49,632 INFO L226 Difference]: Without dead ends: 47 [2022-07-13 18:06:49,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-13 18:06:49,633 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-13 18:06:49,633 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-13 18:06:49,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-13 18:06:49,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-07-13 18:06:49,639 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-13 18:06:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2022-07-13 18:06:49,640 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2022-07-13 18:06:49,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:06:49,640 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-07-13 18:06:49,640 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-13 18:06:49,641 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-07-13 18:06:49,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 18:06:49,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:06:49,642 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-13 18:06:49,661 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-13 18:06:49,858 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-13 18:06:49,859 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:06:49,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:06:49,859 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2022-07-13 18:06:49,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:06:49,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580817691] [2022-07-13 18:06:49,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:06:49,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:06:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:49,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:06:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:49,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:49,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:49,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 18:06:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:49,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 18:06:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:49,979 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-13 18:06:49,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:06:49,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580817691] [2022-07-13 18:06:49,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580817691] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:06:49,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475663648] [2022-07-13 18:06:49,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:06:49,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:06:49,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:06:49,981 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-13 18:06:49,982 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-13 18:06:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:50,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 18:06:50,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:06:50,084 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-13 18:06:50,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:06:50,322 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-13 18:06:50,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475663648] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:06:50,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:06:50,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2022-07-13 18:06:50,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731422405] [2022-07-13 18:06:50,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:06:50,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 18:06:50,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:06:50,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 18:06:50,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-07-13 18:06:50,326 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-13 18:06:50,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:06:50,491 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2022-07-13 18:06:50,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 18:06:50,492 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-13 18:06:50,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:06:50,499 INFO L225 Difference]: With dead ends: 105 [2022-07-13 18:06:50,499 INFO L226 Difference]: Without dead ends: 63 [2022-07-13 18:06:50,502 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-13 18:06:50,504 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-13 18:06:50,505 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-13 18:06:50,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-13 18:06:50,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-07-13 18:06:50,517 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-13 18:06:50,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2022-07-13 18:06:50,518 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2022-07-13 18:06:50,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:06:50,520 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2022-07-13 18:06:50,520 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-13 18:06:50,520 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2022-07-13 18:06:50,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 18:06:50,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:06:50,521 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-13 18:06:50,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 18:06:50,734 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-13 18:06:50,735 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:06:50,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:06:50,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2022-07-13 18:06:50,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:06:50,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817320241] [2022-07-13 18:06:50,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:06:50,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:06:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:50,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:06:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:50,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:50,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:50,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:50,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:06:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:50,829 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-13 18:06:50,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:06:50,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817320241] [2022-07-13 18:06:50,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817320241] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:06:50,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824320564] [2022-07-13 18:06:50,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:06:50,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:06:50,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:06:50,832 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-13 18:06:50,833 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-13 18:06:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:50,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 18:06:50,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:06:50,919 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-13 18:06:50,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:06:51,122 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-13 18:06:51,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824320564] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:06:51,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:06:51,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2022-07-13 18:06:51,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551570990] [2022-07-13 18:06:51,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:06:51,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 18:06:51,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:06:51,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 18:06:51,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-07-13 18:06:51,125 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-13 18:06:51,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:06:51,385 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2022-07-13 18:06:51,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 18:06:51,386 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-13 18:06:51,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:06:51,390 INFO L225 Difference]: With dead ends: 177 [2022-07-13 18:06:51,390 INFO L226 Difference]: Without dead ends: 117 [2022-07-13 18:06:51,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2022-07-13 18:06:51,396 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 60 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:06:51,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 222 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:06:51,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-13 18:06:51,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2022-07-13 18:06:51,418 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-13 18:06:51,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2022-07-13 18:06:51,423 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2022-07-13 18:06:51,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:06:51,425 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2022-07-13 18:06:51,425 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-13 18:06:51,425 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2022-07-13 18:06:51,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-13 18:06:51,430 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:06:51,430 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-13 18:06:51,453 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-13 18:06:51,647 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-13 18:06:51,647 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:06:51,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:06:51,647 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2022-07-13 18:06:51,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:06:51,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725272446] [2022-07-13 18:06:51,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:06:51,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:06:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:51,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:06:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:51,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:51,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:51,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:51,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:51,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:06:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:51,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 18:06:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:51,733 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-13 18:06:51,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:06:51,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725272446] [2022-07-13 18:06:51,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725272446] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:06:51,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12027243] [2022-07-13 18:06:51,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:06:51,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:06:51,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:06:51,735 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-13 18:06:51,736 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-13 18:06:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:51,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 18:06:51,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:06:51,836 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-13 18:06:51,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:06:52,177 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-13 18:06:52,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12027243] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:06:52,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:06:52,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2022-07-13 18:06:52,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414259839] [2022-07-13 18:06:52,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:06:52,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 18:06:52,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:06:52,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 18:06:52,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-07-13 18:06:52,179 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-13 18:06:52,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:06:52,501 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2022-07-13 18:06:52,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 18:06:52,502 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-13 18:06:52,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:06:52,504 INFO L225 Difference]: With dead ends: 255 [2022-07-13 18:06:52,504 INFO L226 Difference]: Without dead ends: 155 [2022-07-13 18:06:52,505 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-13 18:06:52,505 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 76 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:06:52,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 227 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:06:52,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-13 18:06:52,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2022-07-13 18:06:52,521 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-13 18:06:52,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2022-07-13 18:06:52,522 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2022-07-13 18:06:52,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:06:52,523 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2022-07-13 18:06:52,535 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-13 18:06:52,535 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2022-07-13 18:06:52,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-13 18:06:52,537 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:06:52,537 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-13 18:06:52,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 18:06:52,753 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-13 18:06:52,754 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:06:52,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:06:52,754 INFO L85 PathProgramCache]: Analyzing trace with hash -586612948, now seen corresponding path program 1 times [2022-07-13 18:06:52,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:06:52,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727469277] [2022-07-13 18:06:52,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:06:52,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:06:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:52,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:06:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:52,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:52,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:52,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:52,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:52,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:52,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:06:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:52,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:06:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:52,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:06:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:52,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:52,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:52,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:52,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:06:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:52,958 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-13 18:06:52,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:06:52,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727469277] [2022-07-13 18:06:52,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727469277] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:06:52,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990306663] [2022-07-13 18:06:52,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:06:52,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:06:52,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:06:52,963 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-13 18:06:52,964 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-13 18:06:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:53,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 18:06:53,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:06:53,131 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-13 18:06:53,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:06:53,715 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-13 18:06:53,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990306663] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:06:53,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:06:53,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 24 [2022-07-13 18:06:53,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626162014] [2022-07-13 18:06:53,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:06:53,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-13 18:06:53,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:06:53,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 18:06:53,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2022-07-13 18:06:53,717 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-13 18:06:54,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:06:54,197 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2022-07-13 18:06:54,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-13 18:06:54,197 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-13 18:06:54,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:06:54,199 INFO L225 Difference]: With dead ends: 240 [2022-07-13 18:06:54,199 INFO L226 Difference]: Without dead ends: 107 [2022-07-13 18:06:54,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2022-07-13 18:06:54,200 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 111 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 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.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:06:54,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 209 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 18:06:54,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-13 18:06:54,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2022-07-13 18:06:54,207 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-13 18:06:54,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2022-07-13 18:06:54,208 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 93 [2022-07-13 18:06:54,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:06:54,208 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2022-07-13 18:06:54,208 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-13 18:06:54,208 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2022-07-13 18:06:54,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-13 18:06:54,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:06:54,209 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-13 18:06:54,228 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-13 18:06:54,426 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-13 18:06:54,426 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:06:54,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:06:54,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1129417830, now seen corresponding path program 1 times [2022-07-13 18:06:54,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:06:54,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753990623] [2022-07-13 18:06:54,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:06:54,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:06:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:54,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:06:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:54,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:54,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:54,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:54,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:54,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:54,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:54,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:06:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:54,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:06:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:54,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:06:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:54,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:54,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:54,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:54,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:54,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:06:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:54,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:06:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:54,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 18:06:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:54,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:54,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:54,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:54,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:06:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:54,627 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-13 18:06:54,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:06:54,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753990623] [2022-07-13 18:06:54,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753990623] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:06:54,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842551894] [2022-07-13 18:06:54,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:06:54,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:06:54,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:06:54,648 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-13 18:06:54,683 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-13 18:06:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:54,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 18:06:54,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:06:54,896 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-13 18:06:54,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:06:55,761 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-13 18:06:55,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842551894] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:06:55,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:06:55,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 26 [2022-07-13 18:06:55,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759487643] [2022-07-13 18:06:55,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:06:55,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 18:06:55,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:06:55,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 18:06:55,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2022-07-13 18:06:55,764 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-13 18:06:56,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:06:56,230 INFO L93 Difference]: Finished difference Result 214 states and 372 transitions. [2022-07-13 18:06:56,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-13 18:06:56,231 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-13 18:06:56,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:06:56,232 INFO L225 Difference]: With dead ends: 214 [2022-07-13 18:06:56,232 INFO L226 Difference]: Without dead ends: 134 [2022-07-13 18:06:56,234 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-13 18:06:56,234 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 108 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:06:56,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 235 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:06:56,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-13 18:06:56,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2022-07-13 18:06:56,241 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-13 18:06:56,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2022-07-13 18:06:56,242 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 148 [2022-07-13 18:06:56,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:06:56,242 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2022-07-13 18:06:56,242 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-13 18:06:56,242 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2022-07-13 18:06:56,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-07-13 18:06:56,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:06:56,244 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-13 18:06:56,263 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-13 18:06:56,447 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-13 18:06:56,448 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:06:56,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:06:56,448 INFO L85 PathProgramCache]: Analyzing trace with hash -399650163, now seen corresponding path program 2 times [2022-07-13 18:06:56,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:06:56,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22802685] [2022-07-13 18:06:56,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:06:56,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:06:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:06:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:06:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:06:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:06:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 18:06:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:06:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 18:06:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:06:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:06:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:06:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 18:06:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:06:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:56,875 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-13 18:06:56,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:06:56,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22802685] [2022-07-13 18:06:56,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22802685] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:06:56,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445967790] [2022-07-13 18:06:56,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 18:06:56,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:06:56,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:06:56,887 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-13 18:06:56,889 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-13 18:06:56,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 18:06:56,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:06:57,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-13 18:06:57,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:06:57,126 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-13 18:06:57,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:06:58,421 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-13 18:06:58,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445967790] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:06:58,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:06:58,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 27 [2022-07-13 18:06:58,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963802294] [2022-07-13 18:06:58,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:06:58,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 18:06:58,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:06:58,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 18:06:58,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2022-07-13 18:06:58,424 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-13 18:06:58,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:06:58,871 INFO L93 Difference]: Finished difference Result 260 states and 447 transitions. [2022-07-13 18:06:58,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-13 18:06:58,871 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-13 18:06:58,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:06:58,873 INFO L225 Difference]: With dead ends: 260 [2022-07-13 18:06:58,873 INFO L226 Difference]: Without dead ends: 155 [2022-07-13 18:06:58,874 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-13 18:06:58,875 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 109 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:06:58,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 270 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:06:58,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-13 18:06:58,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2022-07-13 18:06:58,887 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-13 18:06:58,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 224 transitions. [2022-07-13 18:06:58,889 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 224 transitions. Word has length 271 [2022-07-13 18:06:58,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:06:58,889 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 224 transitions. [2022-07-13 18:06:58,890 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-13 18:06:58,890 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 224 transitions. [2022-07-13 18:06:58,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2022-07-13 18:06:58,895 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:06:58,895 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-13 18:06:58,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 18:06:59,115 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-13 18:06:59,116 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:06:59,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:06:59,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1123052726, now seen corresponding path program 3 times [2022-07-13 18:06:59,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:06:59,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097548564] [2022-07-13 18:06:59,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:06:59,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:06:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:06:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:06:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:06:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:06:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 18:06:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:06:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:06:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:06:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-13 18:06:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:06:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:06:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-13 18:06:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:06:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:06:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:06:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:06:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 18:06:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:06:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:06:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:06:59,640 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-13 18:06:59,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:06:59,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097548564] [2022-07-13 18:06:59,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097548564] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:06:59,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793378194] [2022-07-13 18:06:59,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 18:06:59,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:06:59,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:06:59,656 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-13 18:06:59,657 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-13 18:06:59,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-13 18:06:59,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:06:59,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 18:06:59,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:06:59,821 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-13 18:06:59,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:07:00,416 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-13 18:07:00,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793378194] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:07:00,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:07:00,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 19 [2022-07-13 18:07:00,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793944129] [2022-07-13 18:07:00,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:07:00,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 18:07:00,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:07:00,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 18:07:00,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-07-13 18:07:00,420 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-13 18:07:00,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:07:00,573 INFO L93 Difference]: Finished difference Result 283 states and 457 transitions. [2022-07-13 18:07:00,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 18:07:00,574 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-13 18:07:00,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:07:00,576 INFO L225 Difference]: With dead ends: 283 [2022-07-13 18:07:00,577 INFO L226 Difference]: Without dead ends: 147 [2022-07-13 18:07:00,578 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-13 18:07:00,578 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-13 18:07:00,578 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-13 18:07:00,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-13 18:07:00,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2022-07-13 18:07:00,585 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-13 18:07:00,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 213 transitions. [2022-07-13 18:07:00,588 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 213 transitions. Word has length 394 [2022-07-13 18:07:00,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:07:00,589 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 213 transitions. [2022-07-13 18:07:00,589 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-13 18:07:00,589 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 213 transitions. [2022-07-13 18:07:00,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2022-07-13 18:07:00,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:07:00,595 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-13 18:07:00,627 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-13 18:07:00,809 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-13 18:07:00,809 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:07:00,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:07:00,809 INFO L85 PathProgramCache]: Analyzing trace with hash -2090861273, now seen corresponding path program 4 times [2022-07-13 18:07:00,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:07:00,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585320728] [2022-07-13 18:07:00,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:07:00,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:07:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:07:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:07:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:07:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:07:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 18:07:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:07:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:07:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:07:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:07:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-13 18:07:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:07:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:07:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:07:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:07:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 18:07:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:07:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:07:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:07:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:07:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2022-07-13 18:07:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:07:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:07:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:07:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:07:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:01,821 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-13 18:07:01,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:07:01,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585320728] [2022-07-13 18:07:01,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585320728] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:07:01,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259442027] [2022-07-13 18:07:01,822 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 18:07:01,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:07:01,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:07:01,836 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-13 18:07:01,898 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-13 18:07:02,064 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 18:07:02,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:07:02,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-13 18:07:02,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:07:02,256 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-13 18:07:02,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:07:04,513 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-13 18:07:04,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259442027] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:07:04,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:07:04,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13, 19] total 42 [2022-07-13 18:07:04,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076164424] [2022-07-13 18:07:04,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:07:04,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-13 18:07:04,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:07:04,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-13 18:07:04,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1485, Unknown=0, NotChecked=0, Total=1722 [2022-07-13 18:07:04,516 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-13 18:07:05,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:07:05,486 INFO L93 Difference]: Finished difference Result 355 states and 619 transitions. [2022-07-13 18:07:05,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-13 18:07:05,486 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-13 18:07:05,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:07:05,488 INFO L225 Difference]: With dead ends: 355 [2022-07-13 18:07:05,488 INFO L226 Difference]: Without dead ends: 183 [2022-07-13 18:07:05,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1285 GetRequests, 1222 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=535, Invalid=3371, Unknown=0, NotChecked=0, Total=3906 [2022-07-13 18:07:05,490 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 175 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 18:07:05,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 464 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 18:07:05,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-07-13 18:07:05,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 155. [2022-07-13 18:07:05,497 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-13 18:07:05,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 190 transitions. [2022-07-13 18:07:05,498 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 190 transitions. Word has length 542 [2022-07-13 18:07:05,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:07:05,498 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 190 transitions. [2022-07-13 18:07:05,499 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-13 18:07:05,499 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 190 transitions. [2022-07-13 18:07:05,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2022-07-13 18:07:05,503 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:07:05,503 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-13 18:07:05,522 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-13 18:07:05,720 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-13 18:07:05,720 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:07:05,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:07:05,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1387676979, now seen corresponding path program 5 times [2022-07-13 18:07:05,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:07:05,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319560006] [2022-07-13 18:07:05,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:07:05,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:07:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:05,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:07:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:05,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:05,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:05,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:07:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:07:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:07:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:07:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 18:07:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:07:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:07:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-13 18:07:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:07:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:07:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:07:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:07:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-13 18:07:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:07:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:07:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:07:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:07:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 18:07:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:07:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:07:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:07:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:07:06,294 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-13 18:07:06,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:07:06,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319560006] [2022-07-13 18:07:06,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319560006] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:07:06,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162551652] [2022-07-13 18:07:06,294 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 18:07:06,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:07:06,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:07:06,295 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-13 18:07:06,297 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-13 18:07:06,498 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-07-13 18:07:06,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:07:06,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 18:07:06,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:07:06,639 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-13 18:07:06,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:07:07,659 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-13 18:07:07,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162551652] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:07:07,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:07:07,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 13, 15] total 41 [2022-07-13 18:07:07,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419130275] [2022-07-13 18:07:07,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:07:07,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-13 18:07:07,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:07:07,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-13 18:07:07,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1407, Unknown=0, NotChecked=0, Total=1640 [2022-07-13 18:07:07,663 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-13 18:07:08,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:07:08,243 INFO L93 Difference]: Finished difference Result 333 states and 423 transitions. [2022-07-13 18:07:08,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-13 18:07:08,243 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-13 18:07:08,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:07:08,246 INFO L225 Difference]: With dead ends: 333 [2022-07-13 18:07:08,246 INFO L226 Difference]: Without dead ends: 185 [2022-07-13 18:07:08,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1031 GetRequests, 977 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=416, Invalid=2446, Unknown=0, NotChecked=0, Total=2862 [2022-07-13 18:07:08,248 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 132 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:07:08,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 584 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 18:07:08,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-13 18:07:08,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 159. [2022-07-13 18:07:08,257 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-13 18:07:08,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 189 transitions. [2022-07-13 18:07:08,258 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 189 transitions. Word has length 433 [2022-07-13 18:07:08,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:07:08,260 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 189 transitions. [2022-07-13 18:07:08,260 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-13 18:07:08,260 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 189 transitions. [2022-07-13 18:07:08,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2022-07-13 18:07:08,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:07:08,263 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-13 18:07:08,285 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-13 18:07:08,480 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-13 18:07:08,481 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:07:08,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:07:08,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1402769443, now seen corresponding path program 6 times [2022-07-13 18:07:08,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:07:08,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626420006] [2022-07-13 18:07:08,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:07:08,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:07:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 18:07:08,525 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 18:07:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 18:07:08,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 18:07:08,615 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 18:07:08,616 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 18:07:08,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 18:07:08,619 INFO L356 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:07:08,623 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 18:07:08,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 06:07:08 BoogieIcfgContainer [2022-07-13 18:07:08,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 18:07:08,719 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 18:07:08,719 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 18:07:08,719 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 18:07:08,720 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:06:48" (3/4) ... [2022-07-13 18:07:08,721 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 18:07:08,795 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 18:07:08,795 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 18:07:08,796 INFO L158 Benchmark]: Toolchain (without parser) took 21157.99ms. Allocated memory was 96.5MB in the beginning and 362.8MB in the end (delta: 266.3MB). Free memory was 68.5MB in the beginning and 235.7MB in the end (delta: -167.2MB). Peak memory consumption was 99.1MB. Max. memory is 16.1GB. [2022-07-13 18:07:08,796 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 53.5MB in the beginning and 53.5MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 18:07:08,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.33ms. Allocated memory is still 96.5MB. Free memory was 68.2MB in the beginning and 72.8MB in the end (delta: -4.6MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2022-07-13 18:07:08,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.18ms. Allocated memory is still 96.5MB. Free memory was 72.8MB in the beginning and 71.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 18:07:08,797 INFO L158 Benchmark]: Boogie Preprocessor took 10.92ms. Allocated memory is still 96.5MB. Free memory was 71.4MB in the beginning and 70.6MB in the end (delta: 793.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 18:07:08,797 INFO L158 Benchmark]: RCFGBuilder took 256.61ms. Allocated memory is still 96.5MB. Free memory was 70.6MB in the beginning and 61.3MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 18:07:08,797 INFO L158 Benchmark]: TraceAbstraction took 20596.09ms. Allocated memory was 96.5MB in the beginning and 362.8MB in the end (delta: 266.3MB). Free memory was 60.9MB in the beginning and 246.1MB in the end (delta: -185.2MB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB. [2022-07-13 18:07:08,798 INFO L158 Benchmark]: Witness Printer took 76.42ms. Allocated memory is still 362.8MB. Free memory was 246.1MB in the beginning and 235.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 18:07:08,801 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.17ms. Allocated memory is still 96.5MB. Free memory was 53.5MB in the beginning and 53.5MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.33ms. Allocated memory is still 96.5MB. Free memory was 68.2MB in the beginning and 72.8MB in the end (delta: -4.6MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.18ms. Allocated memory is still 96.5MB. Free memory was 72.8MB in the beginning and 71.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 10.92ms. Allocated memory is still 96.5MB. Free memory was 71.4MB in the beginning and 70.6MB in the end (delta: 793.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 256.61ms. Allocated memory is still 96.5MB. Free memory was 70.6MB in the beginning and 61.3MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 20596.09ms. Allocated memory was 96.5MB in the beginning and 362.8MB in the end (delta: 266.3MB). Free memory was 60.9MB in the beginning and 246.1MB in the end (delta: -185.2MB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB. * Witness Printer took 76.42ms. Allocated memory is still 362.8MB. Free memory was 246.1MB in the beginning and 235.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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.5s, OverallIterations: 14, TraceHistogramMax: 43, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1049 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 977 mSDsluCounter, 2916 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2514 mSDsCounter, 1245 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6173 IncrementalHoareTripleChecker+Invalid, 7418 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1245 mSolverCounterUnsat, 402 mSDtfsCounter, 6173 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4962 GetRequests, 4594 SyntacticMatches, 15 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3354 ImplicationChecksByTransitivity, 2.6s 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.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 176 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 11.9s 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-13 18:07:08,869 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