./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 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/list-simple/sll2c_update_all_reverse.i -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 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 12:12:10,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 12:12:10,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 12:12:10,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 12:12:10,280 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 12:12:10,283 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 12:12:10,284 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 12:12:10,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 12:12:10,287 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 12:12:10,291 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 12:12:10,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 12:12:10,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 12:12:10,293 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 12:12:10,294 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 12:12:10,295 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 12:12:10,298 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 12:12:10,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 12:12:10,299 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 12:12:10,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 12:12:10,305 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 12:12:10,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 12:12:10,307 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 12:12:10,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 12:12:10,309 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 12:12:10,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 12:12:10,316 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 12:12:10,316 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 12:12:10,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 12:12:10,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 12:12:10,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 12:12:10,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 12:12:10,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 12:12:10,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 12:12:10,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 12:12:10,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 12:12:10,321 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 12:12:10,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 12:12:10,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 12:12:10,322 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 12:12:10,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 12:12:10,323 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 12:12:10,324 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 12:12:10,341 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 12:12:10,343 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 12:12:10,344 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 12:12:10,344 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 12:12:10,344 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 12:12:10,345 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 12:12:10,345 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 12:12:10,345 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 12:12:10,345 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 12:12:10,346 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 12:12:10,346 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 12:12:10,346 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 12:12:10,346 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 12:12:10,347 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 12:12:10,347 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 12:12:10,347 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 12:12:10,347 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 12:12:10,347 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 12:12:10,347 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 12:12:10,348 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 12:12:10,348 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 12:12:10,348 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 12:12:10,348 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 12:12:10,348 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 12:12:10,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 12:12:10,349 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 12:12:10,349 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 12:12:10,349 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 12:12:10,349 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 12:12:10,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 12:12:10,349 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 12:12:10,350 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 12:12:10,350 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 12:12:10,350 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 12:12:10,350 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 -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2021-12-21 12:12:10,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 12:12:10,553 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 12:12:10,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 12:12:10,555 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 12:12:10,556 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 12:12:10,557 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2021-12-21 12:12:10,610 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1071c3805/262dd84c9bc145eba9c5d35e5a13d548/FLAGe0e8fe21a [2021-12-21 12:12:10,927 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 12:12:10,928 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2021-12-21 12:12:10,941 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1071c3805/262dd84c9bc145eba9c5d35e5a13d548/FLAGe0e8fe21a [2021-12-21 12:12:11,331 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1071c3805/262dd84c9bc145eba9c5d35e5a13d548 [2021-12-21 12:12:11,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 12:12:11,334 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 12:12:11,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 12:12:11,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 12:12:11,337 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 12:12:11,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:12:11" (1/1) ... [2021-12-21 12:12:11,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@716f1b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:12:11, skipping insertion in model container [2021-12-21 12:12:11,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:12:11" (1/1) ... [2021-12-21 12:12:11,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 12:12:11,372 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 12:12:11,609 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/list-simple/sll2c_update_all_reverse.i[24436,24449] [2021-12-21 12:12:11,613 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 12:12:11,618 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 12:12:11,653 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/list-simple/sll2c_update_all_reverse.i[24436,24449] [2021-12-21 12:12:11,661 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 12:12:11,679 INFO L208 MainTranslator]: Completed translation [2021-12-21 12:12:11,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:12:11 WrapperNode [2021-12-21 12:12:11,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 12:12:11,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 12:12:11,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 12:12:11,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 12:12:11,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:12:11" (1/1) ... [2021-12-21 12:12:11,708 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:12:11" (1/1) ... [2021-12-21 12:12:11,731 INFO L137 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 127 [2021-12-21 12:12:11,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 12:12:11,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 12:12:11,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 12:12:11,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 12:12:11,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:12:11" (1/1) ... [2021-12-21 12:12:11,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:12:11" (1/1) ... [2021-12-21 12:12:11,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:12:11" (1/1) ... [2021-12-21 12:12:11,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:12:11" (1/1) ... [2021-12-21 12:12:11,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:12:11" (1/1) ... [2021-12-21 12:12:11,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:12:11" (1/1) ... [2021-12-21 12:12:11,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:12:11" (1/1) ... [2021-12-21 12:12:11,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 12:12:11,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 12:12:11,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 12:12:11,773 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 12:12:11,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:12:11" (1/1) ... [2021-12-21 12:12:11,781 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 12:12:11,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:12:11,799 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-21 12:12:11,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-21 12:12:11,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 12:12:11,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 12:12:11,827 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-21 12:12:11,827 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-21 12:12:11,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 12:12:11,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 12:12:11,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 12:12:11,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 12:12:11,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 12:12:11,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 12:12:11,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 12:12:11,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 12:12:11,951 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 12:12:11,956 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 12:12:12,159 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 12:12:12,166 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 12:12:12,167 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-21 12:12:12,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:12:12 BoogieIcfgContainer [2021-12-21 12:12:12,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 12:12:12,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 12:12:12,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 12:12:12,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 12:12:12,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 12:12:11" (1/3) ... [2021-12-21 12:12:12,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42353b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:12:12, skipping insertion in model container [2021-12-21 12:12:12,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:12:11" (2/3) ... [2021-12-21 12:12:12,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42353b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:12:12, skipping insertion in model container [2021-12-21 12:12:12,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:12:12" (3/3) ... [2021-12-21 12:12:12,176 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2021-12-21 12:12:12,180 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 12:12:12,180 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 12:12:12,223 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 12:12:12,229 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 12:12:12,229 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 12:12:12,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 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) [2021-12-21 12:12:12,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-21 12:12:12,256 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:12:12,257 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:12:12,258 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:12:12,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:12:12,262 INFO L85 PathProgramCache]: Analyzing trace with hash 663980757, now seen corresponding path program 1 times [2021-12-21 12:12:12,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:12:12,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027202486] [2021-12-21 12:12:12,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:12:12,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:12:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:12,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:12:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:12,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:12:12,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:12:12,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027202486] [2021-12-21 12:12:12,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027202486] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:12:12,523 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:12:12,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 12:12:12,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175210105] [2021-12-21 12:12:12,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:12:12,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 12:12:12,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:12:12,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 12:12:12,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 12:12:12,555 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 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 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 12:12:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:12:12,598 INFO L93 Difference]: Finished difference Result 61 states and 87 transitions. [2021-12-21 12:12:12,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 12:12:12,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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 20 [2021-12-21 12:12:12,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:12:12,606 INFO L225 Difference]: With dead ends: 61 [2021-12-21 12:12:12,606 INFO L226 Difference]: Without dead ends: 28 [2021-12-21 12:12:12,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 12:12:12,613 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:12:12,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:12:12,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-21 12:12:12,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-21 12:12:12,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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) [2021-12-21 12:12:12,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2021-12-21 12:12:12,648 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 20 [2021-12-21 12:12:12,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:12:12,649 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-12-21 12:12:12,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 12:12:12,650 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2021-12-21 12:12:12,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-21 12:12:12,651 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:12:12,651 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:12:12,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 12:12:12,652 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:12:12,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:12:12,655 INFO L85 PathProgramCache]: Analyzing trace with hash 616475652, now seen corresponding path program 1 times [2021-12-21 12:12:12,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:12:12,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529931715] [2021-12-21 12:12:12,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:12:12,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:12:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:12,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:12:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:12,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:12:12,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:12:12,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529931715] [2021-12-21 12:12:12,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529931715] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:12:12,791 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:12:12,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 12:12:12,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67694415] [2021-12-21 12:12:12,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:12:12,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 12:12:12,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:12:12,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 12:12:12,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 12:12:12,794 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 12:12:12,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:12:12,823 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2021-12-21 12:12:12,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 12:12:12,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 20 [2021-12-21 12:12:12,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:12:12,824 INFO L225 Difference]: With dead ends: 47 [2021-12-21 12:12:12,824 INFO L226 Difference]: Without dead ends: 31 [2021-12-21 12:12:12,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 12:12:12,829 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:12:12,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:12:12,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-21 12:12:12,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2021-12-21 12:12:12,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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) [2021-12-21 12:12:12,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2021-12-21 12:12:12,841 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 20 [2021-12-21 12:12:12,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:12:12,842 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2021-12-21 12:12:12,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 12:12:12,843 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2021-12-21 12:12:12,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-21 12:12:12,847 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:12:12,847 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:12:12,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 12:12:12,848 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:12:12,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:12:12,854 INFO L85 PathProgramCache]: Analyzing trace with hash -600691076, now seen corresponding path program 1 times [2021-12-21 12:12:12,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:12:12,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491950146] [2021-12-21 12:12:12,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:12:12,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:12:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:12,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:12:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:12,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:12:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:13,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 12:12:13,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:12:13,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491950146] [2021-12-21 12:12:13,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491950146] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:12:13,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315027922] [2021-12-21 12:12:13,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:12:13,002 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:12:13,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:12:13,004 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:12:13,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 12:12:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:13,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 12:12:13,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:12:13,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-21 12:12:13,218 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 12:12:13,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315027922] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:12:13,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 12:12:13,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2021-12-21 12:12:13,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488893992] [2021-12-21 12:12:13,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:12:13,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 12:12:13,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:12:13,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 12:12:13,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-21 12:12:13,224 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 12:12:13,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:12:13,250 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2021-12-21 12:12:13,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 12:12:13,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2021-12-21 12:12:13,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:12:13,251 INFO L225 Difference]: With dead ends: 51 [2021-12-21 12:12:13,253 INFO L226 Difference]: Without dead ends: 42 [2021-12-21 12:12:13,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-21 12:12:13,254 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 44 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:12:13,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 59 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:12:13,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-21 12:12:13,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2021-12-21 12:12:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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) [2021-12-21 12:12:13,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2021-12-21 12:12:13,261 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 28 [2021-12-21 12:12:13,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:12:13,262 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2021-12-21 12:12:13,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 12:12:13,262 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2021-12-21 12:12:13,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-21 12:12:13,264 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:12:13,264 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:12:13,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-21 12:12:13,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:12:13,482 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:12:13,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:12:13,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1948852891, now seen corresponding path program 1 times [2021-12-21 12:12:13,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:12:13,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296949183] [2021-12-21 12:12:13,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:12:13,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:12:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:13,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:12:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:13,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:12:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:13,600 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 12:12:13,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:12:13,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296949183] [2021-12-21 12:12:13,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296949183] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:12:13,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638782228] [2021-12-21 12:12:13,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:12:13,602 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:12:13,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:12:13,616 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:12:13,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 12:12:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:13,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 12:12:13,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:12:13,808 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-21 12:12:13,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 12:12:13,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638782228] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:12:13,808 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 12:12:13,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2021-12-21 12:12:13,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464162765] [2021-12-21 12:12:13,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:12:13,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 12:12:13,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:12:13,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 12:12:13,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-21 12:12:13,810 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 12:12:13,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:12:13,839 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2021-12-21 12:12:13,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 12:12:13,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2021-12-21 12:12:13,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:12:13,840 INFO L225 Difference]: With dead ends: 57 [2021-12-21 12:12:13,840 INFO L226 Difference]: Without dead ends: 43 [2021-12-21 12:12:13,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-21 12:12:13,841 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 44 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 83 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 [2021-12-21 12:12:13,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 83 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:12:13,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-21 12:12:13,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2021-12-21 12:12:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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) [2021-12-21 12:12:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2021-12-21 12:12:13,846 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 33 [2021-12-21 12:12:13,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:12:13,846 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2021-12-21 12:12:13,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 12:12:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2021-12-21 12:12:13,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-21 12:12:13,847 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:12:13,847 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:12:13,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-21 12:12:14,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-21 12:12:14,064 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:12:14,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:12:14,066 INFO L85 PathProgramCache]: Analyzing trace with hash -2082169171, now seen corresponding path program 1 times [2021-12-21 12:12:14,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:12:14,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461178816] [2021-12-21 12:12:14,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:12:14,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:12:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:14,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:12:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:14,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:12:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:14,173 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-21 12:12:14,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:12:14,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461178816] [2021-12-21 12:12:14,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461178816] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:12:14,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408100050] [2021-12-21 12:12:14,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:12:14,174 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:12:14,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:12:14,188 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:12:14,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-21 12:12:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:14,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 12:12:14,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:12:14,386 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-21 12:12:14,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:12:14,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-21 12:12:14,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408100050] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 12:12:14,451 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 12:12:14,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2021-12-21 12:12:14,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405720630] [2021-12-21 12:12:14,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 12:12:14,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 12:12:14,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:12:14,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 12:12:14,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-21 12:12:14,458 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 12:12:14,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:12:14,527 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2021-12-21 12:12:14,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 12:12:14,528 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2021-12-21 12:12:14,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:12:14,529 INFO L225 Difference]: With dead ends: 56 [2021-12-21 12:12:14,529 INFO L226 Difference]: Without dead ends: 47 [2021-12-21 12:12:14,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-21 12:12:14,530 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 57 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:12:14,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 101 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:12:14,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-21 12:12:14,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2021-12-21 12:12:14,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 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) [2021-12-21 12:12:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2021-12-21 12:12:14,536 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 34 [2021-12-21 12:12:14,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:12:14,537 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2021-12-21 12:12:14,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 12:12:14,537 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2021-12-21 12:12:14,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-21 12:12:14,538 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:12:14,538 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:12:14,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-21 12:12:14,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:12:14,744 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:12:14,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:12:14,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1439163348, now seen corresponding path program 2 times [2021-12-21 12:12:14,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:12:14,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29342033] [2021-12-21 12:12:14,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:12:14,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:12:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:14,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:12:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:14,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:12:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-21 12:12:14,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:12:14,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29342033] [2021-12-21 12:12:14,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29342033] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:12:14,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758718232] [2021-12-21 12:12:14,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 12:12:14,828 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:12:14,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:12:14,829 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:12:14,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-21 12:12:14,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-21 12:12:14,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 12:12:14,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 12:12:14,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:12:14,987 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-21 12:12:14,988 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 12:12:14,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758718232] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:12:14,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 12:12:14,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-21 12:12:14,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980840651] [2021-12-21 12:12:14,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:12:14,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 12:12:14,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:12:14,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 12:12:14,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-21 12:12:14,990 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 12:12:15,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:12:15,019 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2021-12-21 12:12:15,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 12:12:15,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2021-12-21 12:12:15,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:12:15,023 INFO L225 Difference]: With dead ends: 53 [2021-12-21 12:12:15,023 INFO L226 Difference]: Without dead ends: 45 [2021-12-21 12:12:15,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-21 12:12:15,025 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 31 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:12:15,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 83 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:12:15,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-21 12:12:15,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2021-12-21 12:12:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 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) [2021-12-21 12:12:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2021-12-21 12:12:15,037 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 39 [2021-12-21 12:12:15,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:12:15,037 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2021-12-21 12:12:15,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 12:12:15,038 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2021-12-21 12:12:15,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-21 12:12:15,045 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:12:15,046 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:12:15,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-21 12:12:15,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:12:15,263 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:12:15,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:12:15,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1716044715, now seen corresponding path program 1 times [2021-12-21 12:12:15,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:12:15,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835146124] [2021-12-21 12:12:15,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:12:15,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:12:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:15,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:12:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:15,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:12:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:15,951 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 12:12:15,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:12:15,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835146124] [2021-12-21 12:12:15,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835146124] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:12:15,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586982239] [2021-12-21 12:12:15,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:12:15,952 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:12:15,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:12:15,955 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:12:15,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-21 12:12:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:16,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 104 conjunts are in the unsatisfiable core [2021-12-21 12:12:16,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:12:16,102 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 12:12:16,309 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 12:12:16,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 12:12:16,350 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:12:16,400 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 12:12:16,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-12-21 12:12:16,604 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 12:12:16,605 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2021-12-21 12:12:16,608 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-12-21 12:12:16,614 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2021-12-21 12:12:16,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:16,756 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2021-12-21 12:12:16,777 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-12-21 12:12:16,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:16,784 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2021-12-21 12:12:16,915 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-12-21 12:12:16,927 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-21 12:12:16,998 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2021-12-21 12:12:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:12:17,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:12:17,287 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_623) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_622)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_625)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1))) (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (<= (+ (let ((.cse1 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_623) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse1 v_ArrVal_622)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse1 v_ArrVal_625)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))) is different from false [2021-12-21 12:12:17,388 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_623) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_622) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_625) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1))) (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (<= (+ (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_623) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_622) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_625) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))))) is different from false [2021-12-21 12:12:17,450 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:12:17,451 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 92 [2021-12-21 12:12:17,472 INFO L353 Elim1Store]: treesize reduction 102, result has 28.2 percent of original size [2021-12-21 12:12:17,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 200 treesize of output 173 [2021-12-21 12:12:17,479 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 113 [2021-12-21 12:12:17,483 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 97 [2021-12-21 12:12:17,563 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (and (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_622 Int)) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_618) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_ArrVal_622) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_619 (Array Int Int)) (v_ArrVal_625 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_619) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_ArrVal_625) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (<= .cse0 .cse1) (<= .cse1 .cse0) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_622 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_618) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_ArrVal_622) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))))) is different from false [2021-12-21 12:12:17,624 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:12:17,624 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 109 [2021-12-21 12:12:17,628 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 12:12:17,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 93 [2021-12-21 12:12:17,683 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 12:12:17,684 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-12-21 12:12:17,690 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 12:12:17,694 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-21 12:12:17,694 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7 treesize of output 7 [2021-12-21 12:12:17,829 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_616 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_616) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2021-12-21 12:12:17,838 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:12:17,838 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2021-12-21 12:12:17,839 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2021-12-21 12:12:17,842 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-21 12:12:18,247 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-21 12:12:18,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586982239] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 12:12:18,247 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 12:12:18,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 23] total 60 [2021-12-21 12:12:18,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586023821] [2021-12-21 12:12:18,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 12:12:18,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2021-12-21 12:12:18,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:12:18,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-12-21 12:12:18,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2913, Unknown=4, NotChecked=444, Total=3540 [2021-12-21 12:12:18,249 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 60 states, 60 states have (on average 1.55) internal successors, (93), 51 states have internal predecessors, (93), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-21 12:12:19,344 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse1) (<= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse3 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (and (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_622 Int)) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_618) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_ArrVal_622) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_619 (Array Int Int)) (v_ArrVal_625 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_619) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_ArrVal_625) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (<= .cse2 .cse3) (<= .cse3 .cse2) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_622 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_618) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_ArrVal_622) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) 4) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0))) is different from false [2021-12-21 12:12:19,913 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (and (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_622 Int)) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_618) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_ArrVal_622) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_619 (Array Int Int)) (v_ArrVal_625 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_619) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_ArrVal_625) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (<= .cse1 .cse2) (<= .cse2 .cse1) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_622 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_618) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4) v_ArrVal_622) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))))) (= (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) 4) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0))) is different from false [2021-12-21 12:12:19,921 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_623) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_622) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_625) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1))) (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (<= (+ (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_623) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_622) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_625) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))))) (<= .cse2 |c_ULTIMATE.start_main_~len~0#1|) (= (select (select |c_#memory_int| .cse3) 4) (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (<= |c_ULTIMATE.start_main_~len~0#1| .cse2) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse3)))) is different from false [2021-12-21 12:12:19,953 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse3 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (+ (select (select |c_#memory_int| .cse4) 4) 1))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_623) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_622) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_625) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1))) (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (<= (+ (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_9| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_623) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_622) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_625) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))))) (<= .cse2 .cse3) (<= .cse3 .cse2) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse4))))) is different from false [2021-12-21 12:12:20,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:12:20,603 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2021-12-21 12:12:20,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-21 12:12:20,604 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.55) internal successors, (93), 51 states have internal predecessors, (93), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2021-12-21 12:12:20,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:12:20,606 INFO L225 Difference]: With dead ends: 89 [2021-12-21 12:12:20,606 INFO L226 Difference]: Without dead ends: 87 [2021-12-21 12:12:20,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=366, Invalid=4770, Unknown=8, NotChecked=1176, Total=6320 [2021-12-21 12:12:20,608 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 63 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 237 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 12:12:20,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 503 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 734 Invalid, 0 Unknown, 237 Unchecked, 0.3s Time] [2021-12-21 12:12:20,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-21 12:12:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 67. [2021-12-21 12:12:20,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:12:20,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2021-12-21 12:12:20,617 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 40 [2021-12-21 12:12:20,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:12:20,617 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2021-12-21 12:12:20,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.55) internal successors, (93), 51 states have internal predecessors, (93), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-21 12:12:20,617 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2021-12-21 12:12:20,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-21 12:12:20,618 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:12:20,618 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:12:20,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-21 12:12:20,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:12:20,840 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:12:20,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:12:20,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1709432500, now seen corresponding path program 2 times [2021-12-21 12:12:20,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:12:20,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771159504] [2021-12-21 12:12:20,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:12:20,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:12:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:20,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:12:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:20,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:12:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:20,916 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-21 12:12:20,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:12:20,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771159504] [2021-12-21 12:12:20,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771159504] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:12:20,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720962737] [2021-12-21 12:12:20,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 12:12:20,917 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:12:20,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:12:20,918 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:12:20,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-21 12:12:21,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 12:12:21,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 12:12:21,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 12:12:21,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:12:21,097 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-21 12:12:21,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 12:12:21,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720962737] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:12:21,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 12:12:21,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2021-12-21 12:12:21,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828418576] [2021-12-21 12:12:21,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:12:21,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 12:12:21,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:12:21,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 12:12:21,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-21 12:12:21,100 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 12:12:21,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:12:21,137 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2021-12-21 12:12:21,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 12:12:21,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2021-12-21 12:12:21,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:12:21,138 INFO L225 Difference]: With dead ends: 76 [2021-12-21 12:12:21,139 INFO L226 Difference]: Without dead ends: 68 [2021-12-21 12:12:21,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-21 12:12:21,139 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 35 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:12:21,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 64 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:12:21,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-21 12:12:21,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-12-21 12:12:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 62 states have internal predecessors, (72), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:12:21,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2021-12-21 12:12:21,151 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 41 [2021-12-21 12:12:21,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:12:21,151 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2021-12-21 12:12:21,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 12:12:21,151 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2021-12-21 12:12:21,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-21 12:12:21,152 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:12:21,152 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:12:21,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-21 12:12:21,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:12:21,369 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:12:21,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:12:21,370 INFO L85 PathProgramCache]: Analyzing trace with hash 227314337, now seen corresponding path program 3 times [2021-12-21 12:12:21,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:12:21,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738782410] [2021-12-21 12:12:21,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:12:21,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:12:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:21,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:12:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:21,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:12:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:21,439 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-21 12:12:21,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:12:21,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738782410] [2021-12-21 12:12:21,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738782410] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:12:21,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026618404] [2021-12-21 12:12:21,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 12:12:21,440 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:12:21,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:12:21,441 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:12:21,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-21 12:12:21,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-21 12:12:21,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 12:12:21,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 12:12:21,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:12:21,749 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 12:12:21,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:12:21,810 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 12:12:21,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026618404] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-21 12:12:21,810 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:12:21,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 5] total 12 [2021-12-21 12:12:21,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099823341] [2021-12-21 12:12:21,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:12:21,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 12:12:21,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:12:21,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 12:12:21,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-12-21 12:12:21,812 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 12:12:21,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:12:21,849 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2021-12-21 12:12:21,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 12:12:21,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2021-12-21 12:12:21,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:12:21,850 INFO L225 Difference]: With dead ends: 85 [2021-12-21 12:12:21,850 INFO L226 Difference]: Without dead ends: 73 [2021-12-21 12:12:21,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-12-21 12:12:21,851 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 19 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:12:21,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 68 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:12:21,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-21 12:12:21,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2021-12-21 12:12:21,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 62 states have internal predecessors, (72), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:12:21,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2021-12-21 12:12:21,859 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 41 [2021-12-21 12:12:21,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:12:21,859 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2021-12-21 12:12:21,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 12:12:21,859 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2021-12-21 12:12:21,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-21 12:12:21,860 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:12:21,860 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:12:21,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-21 12:12:22,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:12:22,083 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:12:22,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:12:22,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1346076317, now seen corresponding path program 4 times [2021-12-21 12:12:22,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:12:22,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585213222] [2021-12-21 12:12:22,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:12:22,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:12:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:22,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:12:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:22,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:12:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:22,155 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-21 12:12:22,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:12:22,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585213222] [2021-12-21 12:12:22,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585213222] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:12:22,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331824440] [2021-12-21 12:12:22,156 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-21 12:12:22,156 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:12:22,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:12:22,157 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:12:22,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-21 12:12:22,281 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-21 12:12:22,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 12:12:22,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 12:12:22,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:12:22,360 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 12:12:22,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 12:12:22,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331824440] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:12:22,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 12:12:22,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 9 [2021-12-21 12:12:22,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561215517] [2021-12-21 12:12:22,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:12:22,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 12:12:22,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:12:22,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 12:12:22,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-21 12:12:22,362 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 12:12:22,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:12:22,397 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2021-12-21 12:12:22,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 12:12:22,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2021-12-21 12:12:22,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:12:22,399 INFO L225 Difference]: With dead ends: 90 [2021-12-21 12:12:22,399 INFO L226 Difference]: Without dead ends: 68 [2021-12-21 12:12:22,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-12-21 12:12:22,401 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:12:22,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 75 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:12:22,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-21 12:12:22,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-12-21 12:12:22,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 62 states have internal predecessors, (70), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:12:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2021-12-21 12:12:22,416 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 41 [2021-12-21 12:12:22,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:12:22,416 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2021-12-21 12:12:22,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 12:12:22,417 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2021-12-21 12:12:22,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-21 12:12:22,417 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:12:22,417 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:12:22,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-21 12:12:22,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-21 12:12:22,631 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:12:22,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:12:22,631 INFO L85 PathProgramCache]: Analyzing trace with hash 474143318, now seen corresponding path program 1 times [2021-12-21 12:12:22,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:12:22,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72219336] [2021-12-21 12:12:22,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:12:22,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:12:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:22,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:12:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:22,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:12:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:22,918 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:12:22,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:12:22,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72219336] [2021-12-21 12:12:22,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72219336] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:12:22,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319066516] [2021-12-21 12:12:22,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:12:22,920 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:12:22,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:12:22,924 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:12:22,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-21 12:12:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:23,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 53 conjunts are in the unsatisfiable core [2021-12-21 12:12:23,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:12:23,208 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-12-21 12:12:23,378 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-21 12:12:23,422 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-21 12:12:23,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:12:23,600 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2021-12-21 12:12:23,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:23,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:23,733 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-21 12:12:23,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319066516] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 12:12:23,733 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 12:12:23,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 11] total 36 [2021-12-21 12:12:23,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520478190] [2021-12-21 12:12:23,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 12:12:23,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-21 12:12:23,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:12:23,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-21 12:12:23,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1155, Unknown=0, NotChecked=0, Total=1260 [2021-12-21 12:12:23,735 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 36 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 34 states have internal predecessors, (105), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-21 12:12:24,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:12:24,984 INFO L93 Difference]: Finished difference Result 180 states and 201 transitions. [2021-12-21 12:12:24,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-21 12:12:24,984 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 34 states have internal predecessors, (105), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2021-12-21 12:12:24,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:12:24,986 INFO L225 Difference]: With dead ends: 180 [2021-12-21 12:12:24,986 INFO L226 Difference]: Without dead ends: 178 [2021-12-21 12:12:24,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=513, Invalid=2909, Unknown=0, NotChecked=0, Total=3422 [2021-12-21 12:12:24,988 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 418 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 12:12:24,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [419 Valid, 613 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-21 12:12:24,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-12-21 12:12:25,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 111. [2021-12-21 12:12:25,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 105 states have (on average 1.1523809523809523) internal successors, (121), 105 states have internal predecessors, (121), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:12:25,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 127 transitions. [2021-12-21 12:12:25,013 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 127 transitions. Word has length 46 [2021-12-21 12:12:25,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:12:25,014 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 127 transitions. [2021-12-21 12:12:25,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 34 states have internal predecessors, (105), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-21 12:12:25,015 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2021-12-21 12:12:25,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-21 12:12:25,016 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:12:25,016 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:12:25,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-21 12:12:25,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:12:25,223 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:12:25,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:12:25,224 INFO L85 PathProgramCache]: Analyzing trace with hash 216494684, now seen corresponding path program 5 times [2021-12-21 12:12:25,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:12:25,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908181355] [2021-12-21 12:12:25,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:12:25,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:12:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:25,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:12:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:25,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:12:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:25,315 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-21 12:12:25,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:12:25,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908181355] [2021-12-21 12:12:25,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908181355] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:12:25,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739951764] [2021-12-21 12:12:25,315 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-21 12:12:25,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:12:25,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:12:25,316 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:12:25,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-21 12:12:25,428 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-12-21 12:12:25,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 12:12:25,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 12:12:25,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:12:25,506 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 12:12:25,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:12:25,607 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 12:12:25,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739951764] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 12:12:25,607 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 12:12:25,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2021-12-21 12:12:25,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984094055] [2021-12-21 12:12:25,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 12:12:25,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 12:12:25,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:12:25,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 12:12:25,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-12-21 12:12:25,609 INFO L87 Difference]: Start difference. First operand 111 states and 127 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 12:12:25,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:12:25,753 INFO L93 Difference]: Finished difference Result 145 states and 164 transitions. [2021-12-21 12:12:25,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-21 12:12:25,754 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2021-12-21 12:12:25,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:12:25,755 INFO L225 Difference]: With dead ends: 145 [2021-12-21 12:12:25,755 INFO L226 Difference]: Without dead ends: 81 [2021-12-21 12:12:25,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2021-12-21 12:12:25,756 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 82 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 12:12:25,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 139 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 12:12:25,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-21 12:12:25,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2021-12-21 12:12:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:12:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2021-12-21 12:12:25,769 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 46 [2021-12-21 12:12:25,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:12:25,769 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2021-12-21 12:12:25,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 12:12:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2021-12-21 12:12:25,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-21 12:12:25,770 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:12:25,770 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:12:25,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-21 12:12:25,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-21 12:12:25,975 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:12:25,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:12:25,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1865194857, now seen corresponding path program 2 times [2021-12-21 12:12:25,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:12:25,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625074474] [2021-12-21 12:12:25,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:12:25,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:12:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:26,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:12:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:26,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:12:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:26,041 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-21 12:12:26,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:12:26,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625074474] [2021-12-21 12:12:26,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625074474] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:12:26,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570432324] [2021-12-21 12:12:26,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 12:12:26,041 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:12:26,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:12:26,042 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:12:26,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-21 12:12:26,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 12:12:26,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 12:12:26,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 12:12:26,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:12:26,249 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-21 12:12:26,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:12:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-21 12:12:26,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570432324] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 12:12:26,331 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 12:12:26,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2021-12-21 12:12:26,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938501629] [2021-12-21 12:12:26,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 12:12:26,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 12:12:26,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:12:26,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 12:12:26,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-21 12:12:26,332 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 12:12:26,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:12:26,395 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2021-12-21 12:12:26,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 12:12:26,395 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2021-12-21 12:12:26,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:12:26,396 INFO L225 Difference]: With dead ends: 74 [2021-12-21 12:12:26,396 INFO L226 Difference]: Without dead ends: 44 [2021-12-21 12:12:26,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-21 12:12:26,397 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 26 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:12:26,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 108 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:12:26,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-21 12:12:26,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-12-21 12:12:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:12:26,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2021-12-21 12:12:26,401 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 47 [2021-12-21 12:12:26,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:12:26,401 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2021-12-21 12:12:26,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 12:12:26,401 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2021-12-21 12:12:26,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-21 12:12:26,401 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:12:26,402 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:12:26,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-21 12:12:26,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-21 12:12:26,623 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:12:26,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:12:26,624 INFO L85 PathProgramCache]: Analyzing trace with hash 2056935971, now seen corresponding path program 6 times [2021-12-21 12:12:26,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:12:26,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847734561] [2021-12-21 12:12:26,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:12:26,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:12:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:26,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:12:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:26,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:12:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:26,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 12:12:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-21 12:12:26,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:12:26,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847734561] [2021-12-21 12:12:26,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847734561] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:12:26,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065429706] [2021-12-21 12:12:26,693 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-21 12:12:26,694 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:12:26,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:12:26,695 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:12:26,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-21 12:12:26,897 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-12-21 12:12:26,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 12:12:26,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 12:12:26,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:12:26,949 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-21 12:12:26,949 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 12:12:26,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065429706] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:12:26,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 12:12:26,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-12-21 12:12:26,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284550607] [2021-12-21 12:12:26,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:12:26,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 12:12:26,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:12:26,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 12:12:26,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 12:12:26,951 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-21 12:12:26,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:12:26,956 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2021-12-21 12:12:26,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 12:12:26,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2021-12-21 12:12:26,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:12:26,957 INFO L225 Difference]: With dead ends: 44 [2021-12-21 12:12:26,957 INFO L226 Difference]: Without dead ends: 0 [2021-12-21 12:12:26,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 12:12:26,962 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:12:26,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:12:26,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-21 12:12:26,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-21 12:12:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:12:26,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-21 12:12:26,963 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2021-12-21 12:12:26,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:12:26,963 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-21 12:12:26,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-21 12:12:26,963 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-21 12:12:26,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-21 12:12:26,966 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-21 12:12:26,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-21 12:12:27,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-21 12:12:27,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.