./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i25_o25-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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/id_i25_o25-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 76955366716759eb9478710f6ef46e3de93d252b9c3177ff4beaca56ee5c75a7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 17:32:13,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 17:32:13,097 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 17:32:13,133 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 17:32:13,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 17:32:13,134 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 17:32:13,136 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 17:32:13,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 17:32:13,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 17:32:13,142 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 17:32:13,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 17:32:13,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 17:32:13,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 17:32:13,146 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 17:32:13,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 17:32:13,149 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 17:32:13,149 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 17:32:13,150 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 17:32:13,151 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 17:32:13,155 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 17:32:13,157 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 17:32:13,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 17:32:13,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 17:32:13,159 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 17:32:13,160 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 17:32:13,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 17:32:13,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 17:32:13,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 17:32:13,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 17:32:13,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 17:32:13,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 17:32:13,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 17:32:13,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 17:32:13,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 17:32:13,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 17:32:13,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 17:32:13,171 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 17:32:13,171 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 17:32:13,171 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 17:32:13,171 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 17:32:13,172 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 17:32:13,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 17:32:13,175 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 17:32:13,198 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 17:32:13,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 17:32:13,199 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 17:32:13,199 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 17:32:13,200 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 17:32:13,200 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 17:32:13,200 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 17:32:13,200 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 17:32:13,201 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 17:32:13,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 17:32:13,201 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 17:32:13,202 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 17:32:13,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 17:32:13,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 17:32:13,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 17:32:13,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 17:32:13,202 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 17:32:13,202 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 17:32:13,203 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 17:32:13,203 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 17:32:13,204 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 17:32:13,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 17:32:13,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 17:32:13,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 17:32:13,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:32:13,204 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 17:32:13,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 17:32:13,205 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 17:32:13,205 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 17:32:13,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 17:32:13,205 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 17:32:13,205 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 17:32:13,206 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 17:32:13,206 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 -> 76955366716759eb9478710f6ef46e3de93d252b9c3177ff4beaca56ee5c75a7 [2022-07-19 17:32:13,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 17:32:13,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 17:32:13,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 17:32:13,385 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 17:32:13,386 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 17:32:13,387 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i25_o25-2.c [2022-07-19 17:32:13,437 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb2e6c091/6711315dcaea4750806d5cf8536a8802/FLAG466faa058 [2022-07-19 17:32:13,789 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 17:32:13,789 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i25_o25-2.c [2022-07-19 17:32:13,793 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb2e6c091/6711315dcaea4750806d5cf8536a8802/FLAG466faa058 [2022-07-19 17:32:13,801 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb2e6c091/6711315dcaea4750806d5cf8536a8802 [2022-07-19 17:32:13,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 17:32:13,804 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 17:32:13,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 17:32:13,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 17:32:13,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 17:32:13,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:32:13" (1/1) ... [2022-07-19 17:32:13,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@123e461a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:13, skipping insertion in model container [2022-07-19 17:32:13,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:32:13" (1/1) ... [2022-07-19 17:32:13,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 17:32:13,820 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 17:32:13,928 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/id_i25_o25-2.c[454,467] [2022-07-19 17:32:13,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:32:13,935 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 17:32:13,944 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/id_i25_o25-2.c[454,467] [2022-07-19 17:32:13,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:32:13,964 INFO L208 MainTranslator]: Completed translation [2022-07-19 17:32:13,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:13 WrapperNode [2022-07-19 17:32:13,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 17:32:13,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 17:32:13,968 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 17:32:13,968 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 17:32:13,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:13" (1/1) ... [2022-07-19 17:32:13,978 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:13" (1/1) ... [2022-07-19 17:32:13,991 INFO L137 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2022-07-19 17:32:13,991 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 17:32:13,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 17:32:13,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 17:32:13,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 17:32:13,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:13" (1/1) ... [2022-07-19 17:32:13,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:13" (1/1) ... [2022-07-19 17:32:13,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:13" (1/1) ... [2022-07-19 17:32:13,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:13" (1/1) ... [2022-07-19 17:32:14,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:13" (1/1) ... [2022-07-19 17:32:14,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:13" (1/1) ... [2022-07-19 17:32:14,006 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:13" (1/1) ... [2022-07-19 17:32:14,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 17:32:14,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 17:32:14,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 17:32:14,010 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 17:32:14,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:13" (1/1) ... [2022-07-19 17:32:14,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:32:14,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:32:14,033 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-19 17:32:14,052 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-19 17:32:14,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 17:32:14,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 17:32:14,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 17:32:14,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 17:32:14,069 INFO L130 BoogieDeclarations]: Found specification of procedure id [2022-07-19 17:32:14,069 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2022-07-19 17:32:14,107 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 17:32:14,108 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 17:32:14,167 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 17:32:14,170 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 17:32:14,171 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 17:32:14,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:32:14 BoogieIcfgContainer [2022-07-19 17:32:14,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 17:32:14,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 17:32:14,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 17:32:14,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 17:32:14,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 05:32:13" (1/3) ... [2022-07-19 17:32:14,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ea1def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:32:14, skipping insertion in model container [2022-07-19 17:32:14,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:32:13" (2/3) ... [2022-07-19 17:32:14,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ea1def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:32:14, skipping insertion in model container [2022-07-19 17:32:14,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:32:14" (3/3) ... [2022-07-19 17:32:14,177 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i25_o25-2.c [2022-07-19 17:32:14,187 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 17:32:14,188 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 17:32:14,217 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 17:32:14,222 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@6a401f91, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@66b5f717 [2022-07-19 17:32:14,222 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 17:32:14,225 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 17:32:14,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-19 17:32:14,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:32:14,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:32:14,230 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:32:14,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:32:14,234 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2022-07-19 17:32:14,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:32:14,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908325695] [2022-07-19 17:32:14,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:32:14,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:32:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:14,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:14,389 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-19 17:32:14,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:32:14,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908325695] [2022-07-19 17:32:14,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908325695] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:32:14,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:32:14,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 17:32:14,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014738315] [2022-07-19 17:32:14,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:32:14,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:32:14,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:32:14,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:32:14,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:32:14,437 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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-19 17:32:14,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:32:14,490 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-07-19 17:32:14,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 17:32:14,492 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-19 17:32:14,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:32:14,497 INFO L225 Difference]: With dead ends: 28 [2022-07-19 17:32:14,498 INFO L226 Difference]: Without dead ends: 15 [2022-07-19 17:32:14,500 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-19 17:32:14,505 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:32:14,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:32:14,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-19 17:32:14,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-19 17:32:14,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 17:32:14,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-07-19 17:32:14,535 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2022-07-19 17:32:14,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:32:14,536 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-07-19 17:32:14,536 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-19 17:32:14,536 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-07-19 17:32:14,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 17:32:14,538 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:32:14,539 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:32:14,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 17:32:14,539 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:32:14,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:32:14,541 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2022-07-19 17:32:14,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:32:14,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262055949] [2022-07-19 17:32:14,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:32:14,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:32:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:14,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:14,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 17:32:14,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:32:14,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262055949] [2022-07-19 17:32:14,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262055949] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:32:14,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913542848] [2022-07-19 17:32:14,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:32:14,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:32:14,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:32:14,635 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-19 17:32:14,636 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-19 17:32:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:14,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 17:32:14,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:32:14,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 17:32:14,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:32:14,854 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-19 17:32:14,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913542848] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:32:14,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:32:14,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2022-07-19 17:32:14,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102169403] [2022-07-19 17:32:14,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:32:14,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 17:32:14,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:32:14,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 17:32:14,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-19 17:32:14,857 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 17:32:14,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:32:14,896 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-07-19 17:32:14,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 17:32:14,897 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 16 [2022-07-19 17:32:14,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:32:14,897 INFO L225 Difference]: With dead ends: 22 [2022-07-19 17:32:14,898 INFO L226 Difference]: Without dead ends: 18 [2022-07-19 17:32:14,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:32:14,899 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:32:14,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:32:14,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-19 17:32:14,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-19 17:32:14,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 17:32:14,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-07-19 17:32:14,903 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2022-07-19 17:32:14,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:32:14,904 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-07-19 17:32:14,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 17:32:14,904 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-07-19 17:32:14,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-19 17:32:14,905 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:32:14,905 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:32:14,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 17:32:15,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:32:15,126 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:32:15,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:32:15,127 INFO L85 PathProgramCache]: Analyzing trace with hash -41010676, now seen corresponding path program 2 times [2022-07-19 17:32:15,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:32:15,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386811329] [2022-07-19 17:32:15,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:32:15,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:32:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:15,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:15,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:15,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:15,275 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 17:32:15,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:32:15,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386811329] [2022-07-19 17:32:15,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386811329] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:32:15,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883496525] [2022-07-19 17:32:15,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 17:32:15,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:32:15,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:32:15,279 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-19 17:32:15,280 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-19 17:32:15,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 17:32:15,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:32:15,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 17:32:15,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:32:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 17:32:15,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:32:15,600 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 17:32:15,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883496525] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:32:15,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:32:15,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 13 [2022-07-19 17:32:15,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268249216] [2022-07-19 17:32:15,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:32:15,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 17:32:15,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:32:15,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 17:32:15,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:32:15,608 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-19 17:32:15,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:32:15,660 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-07-19 17:32:15,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 17:32:15,661 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) Word has length 22 [2022-07-19 17:32:15,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:32:15,662 INFO L225 Difference]: With dead ends: 25 [2022-07-19 17:32:15,662 INFO L226 Difference]: Without dead ends: 21 [2022-07-19 17:32:15,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-07-19 17:32:15,666 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 35 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:32:15,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 46 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:32:15,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-19 17:32:15,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-19 17:32:15,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 17:32:15,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-07-19 17:32:15,675 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2022-07-19 17:32:15,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:32:15,675 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-07-19 17:32:15,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-19 17:32:15,675 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-07-19 17:32:15,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 17:32:15,677 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:32:15,677 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:32:15,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-19 17:32:15,891 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,SelfDestructingSolverStorable2 [2022-07-19 17:32:15,892 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:32:15,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:32:15,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 3 times [2022-07-19 17:32:15,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:32:15,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675011861] [2022-07-19 17:32:15,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:32:15,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:32:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:15,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:15,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:15,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:15,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:15,993 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 17:32:15,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:32:15,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675011861] [2022-07-19 17:32:15,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675011861] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:32:15,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094597525] [2022-07-19 17:32:15,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 17:32:15,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:32:15,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:32:15,995 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-19 17:32:15,996 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-19 17:32:16,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-19 17:32:16,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:32:16,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 17:32:16,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:32:16,118 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 17:32:16,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:32:16,432 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 17:32:16,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094597525] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:32:16,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:32:16,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 26 [2022-07-19 17:32:16,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714575035] [2022-07-19 17:32:16,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:32:16,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-19 17:32:16,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:32:16,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-19 17:32:16,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2022-07-19 17:32:16,434 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 26 states, 25 states have (on average 1.52) internal successors, (38), 18 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-19 17:32:16,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:32:16,651 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-07-19 17:32:16,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-19 17:32:16,652 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.52) internal successors, (38), 18 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) Word has length 28 [2022-07-19 17:32:16,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:32:16,653 INFO L225 Difference]: With dead ends: 39 [2022-07-19 17:32:16,653 INFO L226 Difference]: Without dead ends: 33 [2022-07-19 17:32:16,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=1388, Unknown=0, NotChecked=0, Total=1640 [2022-07-19 17:32:16,654 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:32:16,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 71 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:32:16,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-19 17:32:16,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-19 17:32:16,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 17:32:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-07-19 17:32:16,659 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2022-07-19 17:32:16,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:32:16,659 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-07-19 17:32:16,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.52) internal successors, (38), 18 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-19 17:32:16,660 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-07-19 17:32:16,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-19 17:32:16,661 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:32:16,661 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:32:16,680 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-19 17:32:16,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:32:16,880 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:32:16,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:32:16,881 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 4 times [2022-07-19 17:32:16,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:32:16,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257227662] [2022-07-19 17:32:16,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:32:16,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:32:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:16,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:16,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:16,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:17,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:17,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:17,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:17,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:17,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:17,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-19 17:32:17,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:32:17,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257227662] [2022-07-19 17:32:17,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257227662] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:32:17,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087680467] [2022-07-19 17:32:17,158 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 17:32:17,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:32:17,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:32:17,159 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-19 17:32:17,160 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-19 17:32:17,196 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 17:32:17,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:32:17,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-19 17:32:17,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:32:17,283 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-19 17:32:17,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:32:18,646 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-19 17:32:18,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087680467] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:32:18,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:32:18,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 23 [2022-07-19 17:32:18,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483254180] [2022-07-19 17:32:18,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:32:18,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-19 17:32:18,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:32:18,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-19 17:32:18,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2022-07-19 17:32:18,649 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 23 states have internal predecessors, (44), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2022-07-19 17:32:18,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:32:18,742 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-07-19 17:32:18,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 17:32:18,743 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 23 states have internal predecessors, (44), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) Word has length 52 [2022-07-19 17:32:18,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:32:18,744 INFO L225 Difference]: With dead ends: 40 [2022-07-19 17:32:18,744 INFO L226 Difference]: Without dead ends: 36 [2022-07-19 17:32:18,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=302, Invalid=628, Unknown=0, NotChecked=0, Total=930 [2022-07-19 17:32:18,745 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 92 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:32:18,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 89 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:32:18,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-19 17:32:18,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-19 17:32:18,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (10), 9 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 17:32:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-07-19 17:32:18,749 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 52 [2022-07-19 17:32:18,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:32:18,750 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-07-19 17:32:18,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 23 states have internal predecessors, (44), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2022-07-19 17:32:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-07-19 17:32:18,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-19 17:32:18,751 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:32:18,751 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:32:18,768 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-19 17:32:18,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:32:18,966 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:32:18,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:32:18,967 INFO L85 PathProgramCache]: Analyzing trace with hash -960511412, now seen corresponding path program 5 times [2022-07-19 17:32:18,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:32:18,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097688588] [2022-07-19 17:32:18,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:32:18,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:32:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:19,140 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-19 17:32:19,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:32:19,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097688588] [2022-07-19 17:32:19,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097688588] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:32:19,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075632880] [2022-07-19 17:32:19,141 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 17:32:19,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:32:19,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:32:19,143 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-19 17:32:19,175 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-19 17:32:19,221 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-07-19 17:32:19,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:32:19,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-19 17:32:19,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:32:19,418 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-19 17:32:19,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:32:21,262 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-19 17:32:21,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075632880] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:32:21,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:32:21,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 21] total 51 [2022-07-19 17:32:21,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624086325] [2022-07-19 17:32:21,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:32:21,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-19 17:32:21,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:32:21,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-19 17:32:21,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=2140, Unknown=0, NotChecked=0, Total=2550 [2022-07-19 17:32:21,265 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 51 states, 50 states have (on average 1.36) internal successors, (68), 33 states have internal predecessors, (68), 3 states have call successors, (4), 1 states have call predecessors, (4), 27 states have return successors, (27), 27 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-19 17:32:21,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:32:21,835 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-07-19 17:32:21,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-19 17:32:21,835 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.36) internal successors, (68), 33 states have internal predecessors, (68), 3 states have call successors, (4), 1 states have call predecessors, (4), 27 states have return successors, (27), 27 states have call predecessors, (27), 3 states have call successors, (27) Word has length 58 [2022-07-19 17:32:21,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:32:21,837 INFO L225 Difference]: With dead ends: 69 [2022-07-19 17:32:21,837 INFO L226 Difference]: Without dead ends: 63 [2022-07-19 17:32:21,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1152, Invalid=6158, Unknown=0, NotChecked=0, Total=7310 [2022-07-19 17:32:21,843 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:32:21,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 143 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:32:21,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-19 17:32:21,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-07-19 17:32:21,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 43 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 18 states have return successors, (19), 18 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-19 17:32:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2022-07-19 17:32:21,855 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 58 [2022-07-19 17:32:21,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:32:21,855 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2022-07-19 17:32:21,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.36) internal successors, (68), 33 states have internal predecessors, (68), 3 states have call successors, (4), 1 states have call predecessors, (4), 27 states have return successors, (27), 27 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-19 17:32:21,856 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-07-19 17:32:21,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-19 17:32:21,857 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:32:21,857 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:32:21,873 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-19 17:32:22,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:32:22,059 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:32:22,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:32:22,060 INFO L85 PathProgramCache]: Analyzing trace with hash -2122437418, now seen corresponding path program 6 times [2022-07-19 17:32:22,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:32:22,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334470413] [2022-07-19 17:32:22,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:32:22,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:32:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:22,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:22,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:22,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:22,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:22,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:22,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:22,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:22,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:22,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:22,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:22,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:22,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:22,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:22,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:22,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:22,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:22,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:22,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:32:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:32:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-07-19 17:32:22,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:32:22,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334470413] [2022-07-19 17:32:22,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334470413] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:32:22,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554253990] [2022-07-19 17:32:22,471 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-19 17:32:22,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:32:22,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:32:22,473 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-19 17:32:22,474 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-19 17:32:22,584 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-07-19 17:32:22,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:32:22,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-19 17:32:22,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:32:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-07-19 17:32:23,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:32:35,510 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-07-19 17:32:35,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554253990] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:32:35,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:32:35,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 39, 39] total 75 [2022-07-19 17:32:35,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64235021] [2022-07-19 17:32:35,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:32:35,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-19 17:32:35,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:32:35,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-19 17:32:35,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=878, Invalid=4672, Unknown=0, NotChecked=0, Total=5550 [2022-07-19 17:32:35,513 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 75 states, 74 states have (on average 1.364864864864865) internal successors, (101), 49 states have internal predecessors, (101), 3 states have call successors, (4), 1 states have call predecessors, (4), 43 states have return successors, (44), 44 states have call predecessors, (44), 3 states have call successors, (44) [2022-07-19 17:32:36,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:32:36,560 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-07-19 17:32:36,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-19 17:32:36,561 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 1.364864864864865) internal successors, (101), 49 states have internal predecessors, (101), 3 states have call successors, (4), 1 states have call predecessors, (4), 43 states have return successors, (44), 44 states have call predecessors, (44), 3 states have call successors, (44) Word has length 112 [2022-07-19 17:32:36,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:32:36,563 INFO L225 Difference]: With dead ends: 93 [2022-07-19 17:32:36,563 INFO L226 Difference]: Without dead ends: 87 [2022-07-19 17:32:36,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3864 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2558, Invalid=13192, Unknown=0, NotChecked=0, Total=15750 [2022-07-19 17:32:36,567 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 31 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:32:36,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 121 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:32:36,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-19 17:32:36,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-07-19 17:32:36,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 59 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 26 states have return successors, (27), 26 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-19 17:32:36,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2022-07-19 17:32:36,574 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 112 [2022-07-19 17:32:36,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:32:36,574 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2022-07-19 17:32:36,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 1.364864864864865) internal successors, (101), 49 states have internal predecessors, (101), 3 states have call successors, (4), 1 states have call predecessors, (4), 43 states have return successors, (44), 44 states have call predecessors, (44), 3 states have call successors, (44) [2022-07-19 17:32:36,575 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2022-07-19 17:32:36,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-19 17:32:36,576 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:32:36,576 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:32:36,593 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-19 17:32:36,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:32:36,788 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:32:36,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:32:36,789 INFO L85 PathProgramCache]: Analyzing trace with hash -678635050, now seen corresponding path program 7 times [2022-07-19 17:32:36,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:32:36,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228786357] [2022-07-19 17:32:36,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:32:36,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:32:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 17:32:36,819 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 17:32:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 17:32:36,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 17:32:36,877 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 17:32:36,877 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 17:32:36,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 17:32:36,881 INFO L356 BasicCegarLoop]: Path program histogram: [7, 1] [2022-07-19 17:32:36,884 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 17:32:36,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 05:32:36 BoogieIcfgContainer [2022-07-19 17:32:36,920 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 17:32:36,920 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 17:32:36,920 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 17:32:36,920 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 17:32:36,921 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:32:14" (3/4) ... [2022-07-19 17:32:36,922 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 17:32:36,952 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 17:32:36,952 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 17:32:36,952 INFO L158 Benchmark]: Toolchain (without parser) took 23148.23ms. Allocated memory was 98.6MB in the beginning and 209.7MB in the end (delta: 111.1MB). Free memory was 67.7MB in the beginning and 96.0MB in the end (delta: -28.3MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2022-07-19 17:32:36,953 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 98.6MB. Free memory was 53.1MB in the beginning and 53.1MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 17:32:36,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.11ms. Allocated memory is still 98.6MB. Free memory was 67.5MB in the beginning and 74.8MB in the end (delta: -7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 17:32:36,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.64ms. Allocated memory is still 98.6MB. Free memory was 74.8MB in the beginning and 73.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 17:32:36,953 INFO L158 Benchmark]: Boogie Preprocessor took 16.37ms. Allocated memory is still 98.6MB. Free memory was 73.5MB in the beginning and 72.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 17:32:36,953 INFO L158 Benchmark]: RCFGBuilder took 163.03ms. Allocated memory is still 98.6MB. Free memory was 72.5MB in the beginning and 64.3MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 17:32:36,954 INFO L158 Benchmark]: TraceAbstraction took 22746.54ms. Allocated memory was 98.6MB in the beginning and 209.7MB in the end (delta: 111.1MB). Free memory was 63.7MB in the beginning and 100.2MB in the end (delta: -36.5MB). Peak memory consumption was 76.5MB. Max. memory is 16.1GB. [2022-07-19 17:32:36,954 INFO L158 Benchmark]: Witness Printer took 31.95ms. Allocated memory is still 209.7MB. Free memory was 100.2MB in the beginning and 96.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 17:32:36,955 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 98.6MB. Free memory was 53.1MB in the beginning and 53.1MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 161.11ms. Allocated memory is still 98.6MB. Free memory was 67.5MB in the beginning and 74.8MB in the end (delta: -7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.64ms. Allocated memory is still 98.6MB. Free memory was 74.8MB in the beginning and 73.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.37ms. Allocated memory is still 98.6MB. Free memory was 73.5MB in the beginning and 72.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 163.03ms. Allocated memory is still 98.6MB. Free memory was 72.5MB in the beginning and 64.3MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 22746.54ms. Allocated memory was 98.6MB in the beginning and 209.7MB in the end (delta: 111.1MB). Free memory was 63.7MB in the beginning and 100.2MB in the end (delta: -36.5MB). Peak memory consumption was 76.5MB. Max. memory is 16.1GB. * Witness Printer took 31.95ms. Allocated memory is still 209.7MB. Free memory was 100.2MB in the beginning and 96.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] int input = 25; VAL [input=25] [L13] CALL, EXPR id(input) VAL [\old(x)=25] [L7] COND FALSE !(x==0) VAL [\old(x)=25, x=25] [L8] CALL, EXPR id(x-1) VAL [\old(x)=24] [L7] COND FALSE !(x==0) VAL [\old(x)=24, x=24] [L8] CALL, EXPR id(x-1) VAL [\old(x)=23] [L7] COND FALSE !(x==0) VAL [\old(x)=23, x=23] [L8] CALL, EXPR id(x-1) VAL [\old(x)=22] [L7] COND FALSE !(x==0) VAL [\old(x)=22, x=22] [L8] CALL, EXPR id(x-1) VAL [\old(x)=21] [L7] COND FALSE !(x==0) VAL [\old(x)=21, x=21] [L8] CALL, EXPR id(x-1) VAL [\old(x)=20] [L7] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L8] CALL, EXPR id(x-1) VAL [\old(x)=19] [L7] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L8] CALL, EXPR id(x-1) VAL [\old(x)=18] [L7] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L8] CALL, EXPR id(x-1) VAL [\old(x)=17] [L7] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L8] CALL, EXPR id(x-1) VAL [\old(x)=16] [L7] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L8] CALL, EXPR id(x-1) VAL [\old(x)=15] [L7] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L8] CALL, EXPR id(x-1) VAL [\old(x)=14] [L7] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L8] CALL, EXPR id(x-1) VAL [\old(x)=13] [L7] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L8] CALL, EXPR id(x-1) VAL [\old(x)=12] [L7] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L8] CALL, EXPR id(x-1) VAL [\old(x)=11] [L7] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L8] CALL, EXPR id(x-1) VAL [\old(x)=10] [L7] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L8] CALL, EXPR id(x-1) VAL [\old(x)=9] [L7] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L8] CALL, EXPR id(x-1) VAL [\old(x)=8] [L7] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L8] CALL, EXPR id(x-1) VAL [\old(x)=7] [L7] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L8] CALL, EXPR id(x-1) VAL [\old(x)=6] [L7] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L8] CALL, EXPR id(x-1) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 [L7] return 0; VAL [\old(x)=0, \result=0, x=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=21, id(x-1)=20, x=21] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=22, id(x-1)=21, x=22] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=23, id(x-1)=22, x=23] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=24, id(x-1)=23, x=24] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=25, id(x-1)=24, x=25] [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) VAL [id(input)=25, input=25] [L13] int result = id(input); [L14] COND TRUE result == 25 VAL [input=25, result=25] [L15] reach_error() VAL [input=25, result=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.7s, OverallIterations: 8, TraceHistogramMax: 26, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 308 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 551 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 482 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 639 IncrementalHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 69 mSDtfsCounter, 639 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 835 GetRequests, 530 SyntacticMatches, 1 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6263 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=7, InterpolantAutomatonStates: 143, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 746 NumberOfCodeBlocks, 746 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 855 ConstructedInterpolants, 0 QuantifiedInterpolants, 2021 SizeOfPredicates, 13 NumberOfNonLiveVariables, 814 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 1875/3858 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-19 17:32:36,985 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