./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2n_remove_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 b3d7899c651fa61cfb9cf623e0f4ceb470fe32eb0d0272d2277c965ed07c2f88 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:17:45,258 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:17:45,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:17:45,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:17:45,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:17:45,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:17:45,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:17:45,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:17:45,293 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:17:45,294 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:17:45,295 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:17:45,296 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:17:45,296 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:17:45,297 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:17:45,298 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:17:45,299 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:17:45,300 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:17:45,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:17:45,302 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:17:45,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:17:45,305 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:17:45,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:17:45,307 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:17:45,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:17:45,309 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:17:45,311 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:17:45,311 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:17:45,312 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:17:45,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:17:45,313 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:17:45,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:17:45,314 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:17:45,315 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:17:45,315 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:17:45,316 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:17:45,317 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:17:45,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:17:45,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:17:45,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:17:45,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:17:45,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:17:45,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:17:45,321 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 15:17:45,339 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:17:45,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:17:45,340 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:17:45,340 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:17:45,341 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:17:45,342 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:17:45,342 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:17:45,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:17:45,343 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:17:45,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:17:45,343 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:17:45,344 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 15:17:45,344 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:17:45,344 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:17:45,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:17:45,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:17:45,345 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:17:45,345 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:17:45,345 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:17:45,345 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:17:45,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:17:45,346 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:17:45,346 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:17:45,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:17:45,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:17:45,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:17:45,347 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:17:45,347 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:17:45,347 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 15:17:45,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 15:17:45,347 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:17:45,348 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:17:45,348 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:17:45,348 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 -> b3d7899c651fa61cfb9cf623e0f4ceb470fe32eb0d0272d2277c965ed07c2f88 [2022-07-13 15:17:45,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:17:45,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:17:45,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:17:45,630 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:17:45,631 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:17:45,633 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i [2022-07-13 15:17:45,703 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99300c1eb/56e7944c916a4f7c8a618dc6efc1e3be/FLAG64cec281a [2022-07-13 15:17:46,233 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:17:46,233 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i [2022-07-13 15:17:46,243 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99300c1eb/56e7944c916a4f7c8a618dc6efc1e3be/FLAG64cec281a [2022-07-13 15:17:46,663 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99300c1eb/56e7944c916a4f7c8a618dc6efc1e3be [2022-07-13 15:17:46,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:17:46,667 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:17:46,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:17:46,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:17:46,675 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:17:46,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:17:46" (1/1) ... [2022-07-13 15:17:46,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4438be93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:46, skipping insertion in model container [2022-07-13 15:17:46,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:17:46" (1/1) ... [2022-07-13 15:17:46,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:17:46,719 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:17:46,949 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/sll2n_remove_all_reverse.i[24038,24051] [2022-07-13 15:17:46,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:17:46,967 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:17:47,014 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/sll2n_remove_all_reverse.i[24038,24051] [2022-07-13 15:17:47,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:17:47,039 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:17:47,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:47 WrapperNode [2022-07-13 15:17:47,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:17:47,042 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:17:47,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:17:47,042 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:17:47,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:47" (1/1) ... [2022-07-13 15:17:47,062 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:47" (1/1) ... [2022-07-13 15:17:47,080 INFO L137 Inliner]: procedures = 126, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 102 [2022-07-13 15:17:47,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:17:47,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:17:47,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:17:47,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:17:47,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:47" (1/1) ... [2022-07-13 15:17:47,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:47" (1/1) ... [2022-07-13 15:17:47,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:47" (1/1) ... [2022-07-13 15:17:47,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:47" (1/1) ... [2022-07-13 15:17:47,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:47" (1/1) ... [2022-07-13 15:17:47,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:47" (1/1) ... [2022-07-13 15:17:47,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:47" (1/1) ... [2022-07-13 15:17:47,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:17:47,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:17:47,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:17:47,112 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:17:47,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:47" (1/1) ... [2022-07-13 15:17:47,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:17:47,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:17:47,146 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 15:17:47,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 15:17:47,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 15:17:47,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:17:47,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:17:47,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 15:17:47,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:17:47,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:17:47,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:17:47,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 15:17:47,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 15:17:47,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:17:47,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:17:47,304 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:17:47,305 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:17:47,495 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:17:47,500 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:17:47,508 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 15:17:47,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:17:47 BoogieIcfgContainer [2022-07-13 15:17:47,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:17:47,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:17:47,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:17:47,516 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:17:47,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:17:46" (1/3) ... [2022-07-13 15:17:47,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47da320f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:17:47, skipping insertion in model container [2022-07-13 15:17:47,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:47" (2/3) ... [2022-07-13 15:17:47,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47da320f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:17:47, skipping insertion in model container [2022-07-13 15:17:47,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:17:47" (3/3) ... [2022-07-13 15:17:47,519 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all_reverse.i [2022-07-13 15:17:47,533 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:17:47,533 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 15:17:47,593 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:17:47,608 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6fbd2bc6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1d4628d4 [2022-07-13 15:17:47,609 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 15:17:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 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) [2022-07-13 15:17:47,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 15:17:47,625 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:17:47,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:17:47,627 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:17:47,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:17:47,633 INFO L85 PathProgramCache]: Analyzing trace with hash -409316200, now seen corresponding path program 1 times [2022-07-13 15:17:47,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:17:47,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788209130] [2022-07-13 15:17:47,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:17:47,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:17:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:17:47,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:17:47,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:17:47,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788209130] [2022-07-13 15:17:47,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788209130] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:17:47,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:17:47,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 15:17:47,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180553707] [2022-07-13 15:17:47,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:17:47,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 15:17:47,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:17:47,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 15:17:47,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:17:47,833 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 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) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2022-07-13 15:17:47,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:17:47,850 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-07-13 15:17:47,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 15:17:47,852 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) Word has length 9 [2022-07-13 15:17:47,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:17:47,860 INFO L225 Difference]: With dead ends: 40 [2022-07-13 15:17:47,860 INFO L226 Difference]: Without dead ends: 20 [2022-07-13 15:17:47,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:17:47,866 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:17:47,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:17:47,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-13 15:17:47,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-13 15:17:47,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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) [2022-07-13 15:17:47,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-07-13 15:17:47,899 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 9 [2022-07-13 15:17:47,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:17:47,899 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-13 15:17:47,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2022-07-13 15:17:47,900 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-07-13 15:17:47,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 15:17:47,901 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:17:47,901 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:17:47,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 15:17:47,902 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:17:47,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:17:47,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1724473208, now seen corresponding path program 1 times [2022-07-13 15:17:47,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:17:47,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159609767] [2022-07-13 15:17:47,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:17:47,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:17:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:17:47,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:17:47,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:17:47,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159609767] [2022-07-13 15:17:47,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159609767] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:17:47,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:17:47,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:17:47,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690859870] [2022-07-13 15:17:47,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:17:47,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:17:47,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:17:47,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:17:47,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:17:47,964 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-07-13 15:17:47,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:17:47,976 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-07-13 15:17:47,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:17:47,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 9 [2022-07-13 15:17:47,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:17:47,978 INFO L225 Difference]: With dead ends: 38 [2022-07-13 15:17:47,978 INFO L226 Difference]: Without dead ends: 25 [2022-07-13 15:17:47,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:17:47,980 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:17:47,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 40 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:17:47,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-13 15:17:47,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-07-13 15:17:47,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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) [2022-07-13 15:17:47,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-07-13 15:17:47,985 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 9 [2022-07-13 15:17:47,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:17:47,986 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-07-13 15:17:47,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-07-13 15:17:47,986 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-07-13 15:17:47,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 15:17:47,987 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:17:47,987 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:17:47,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 15:17:47,987 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:17:47,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:17:47,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1462004256, now seen corresponding path program 1 times [2022-07-13 15:17:47,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:17:47,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087709861] [2022-07-13 15:17:47,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:17:47,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:17:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:17:48,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:17:48,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:17:48,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087709861] [2022-07-13 15:17:48,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087709861] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:17:48,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5135633] [2022-07-13 15:17:48,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:17:48,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:17:48,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:17:48,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:17:48,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 15:17:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:17:48,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 15:17:48,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:17:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:17:48,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:17:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:17:48,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5135633] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:17:48,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:17:48,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-13 15:17:48,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755196254] [2022-07-13 15:17:48,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:17:48,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:17:48,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:17:48,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:17:48,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:17:48,278 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2022-07-13 15:17:48,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:17:48,305 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-07-13 15:17:48,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:17:48,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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) Word has length 14 [2022-07-13 15:17:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:17:48,307 INFO L225 Difference]: With dead ends: 39 [2022-07-13 15:17:48,307 INFO L226 Difference]: Without dead ends: 26 [2022-07-13 15:17:48,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:17:48,309 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:17:48,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 56 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:17:48,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-13 15:17:48,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-13 15:17:48,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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) [2022-07-13 15:17:48,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-07-13 15:17:48,317 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 14 [2022-07-13 15:17:48,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:17:48,318 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-07-13 15:17:48,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2022-07-13 15:17:48,318 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-07-13 15:17:48,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 15:17:48,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:17:48,319 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:17:48,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 15:17:48,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:17:48,540 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:17:48,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:17:48,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1187831688, now seen corresponding path program 2 times [2022-07-13 15:17:48,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:17:48,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509445196] [2022-07-13 15:17:48,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:17:48,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:17:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:17:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:17:48,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:17:48,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509445196] [2022-07-13 15:17:48,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509445196] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:17:48,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235297667] [2022-07-13 15:17:48,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:17:48,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:17:48,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:17:48,639 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:17:48,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 15:17:48,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 15:17:48,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:17:48,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 15:17:48,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:17:48,762 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 15:17:48,763 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:17:48,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235297667] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:17:48,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 15:17:48,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 15:17:48,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147322207] [2022-07-13 15:17:48,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:17:48,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:17:48,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:17:48,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:17:48,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:17:48,765 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2022-07-13 15:17:48,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:17:48,795 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-07-13 15:17:48,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:17:48,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) Word has length 19 [2022-07-13 15:17:48,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:17:48,796 INFO L225 Difference]: With dead ends: 37 [2022-07-13 15:17:48,796 INFO L226 Difference]: Without dead ends: 33 [2022-07-13 15:17:48,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:17:48,797 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:17:48,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 39 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:17:48,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-13 15:17:48,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2022-07-13 15:17:48,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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) [2022-07-13 15:17:48,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-07-13 15:17:48,811 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2022-07-13 15:17:48,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:17:48,811 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-13 15:17:48,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2022-07-13 15:17:48,812 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-07-13 15:17:48,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 15:17:48,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:17:48,813 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:17:48,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 15:17:49,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-13 15:17:49,036 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:17:49,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:17:49,037 INFO L85 PathProgramCache]: Analyzing trace with hash 419983469, now seen corresponding path program 1 times [2022-07-13 15:17:49,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:17:49,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673837068] [2022-07-13 15:17:49,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:17:49,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:17:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:17:49,169 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:17:49,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:17:49,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673837068] [2022-07-13 15:17:49,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673837068] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:17:49,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825494938] [2022-07-13 15:17:49,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:17:49,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:17:49,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:17:49,179 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:17:49,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 15:17:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:17:49,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 15:17:49,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:17:49,315 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 15:17:49,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:17:49,375 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 15:17:49,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825494938] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:17:49,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:17:49,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-07-13 15:17:49,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94070144] [2022-07-13 15:17:49,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:17:49,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:17:49,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:17:49,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:17:49,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:17:49,378 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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) [2022-07-13 15:17:49,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:17:49,415 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-07-13 15:17:49,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:17:49,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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) Word has length 23 [2022-07-13 15:17:49,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:17:49,416 INFO L225 Difference]: With dead ends: 38 [2022-07-13 15:17:49,416 INFO L226 Difference]: Without dead ends: 34 [2022-07-13 15:17:49,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-13 15:17:49,418 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 43 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:17:49,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 50 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:17:49,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-13 15:17:49,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-13 15:17:49,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 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) [2022-07-13 15:17:49,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-07-13 15:17:49,424 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 23 [2022-07-13 15:17:49,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:17:49,424 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-07-13 15:17:49,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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) [2022-07-13 15:17:49,424 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-07-13 15:17:49,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 15:17:49,425 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:17:49,425 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:17:49,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 15:17:49,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:17:49,649 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:17:49,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:17:49,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1335297746, now seen corresponding path program 2 times [2022-07-13 15:17:49,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:17:49,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472064310] [2022-07-13 15:17:49,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:17:49,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:17:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:17:49,756 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 15:17:49,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:17:49,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472064310] [2022-07-13 15:17:49,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472064310] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:17:49,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:17:49,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:17:49,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341678701] [2022-07-13 15:17:49,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:17:49,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:17:49,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:17:49,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:17:49,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:17:49,760 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-07-13 15:17:49,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:17:49,840 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-07-13 15:17:49,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:17:49,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) Word has length 27 [2022-07-13 15:17:49,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:17:49,842 INFO L225 Difference]: With dead ends: 48 [2022-07-13 15:17:49,843 INFO L226 Difference]: Without dead ends: 34 [2022-07-13 15:17:49,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:17:49,845 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:17:49,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 60 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:17:49,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-13 15:17:49,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-13 15:17:49,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 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) [2022-07-13 15:17:49,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-07-13 15:17:49,852 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 27 [2022-07-13 15:17:49,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:17:49,853 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-07-13 15:17:49,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-07-13 15:17:49,853 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-07-13 15:17:49,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-13 15:17:49,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:17:49,854 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:17:49,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 15:17:49,854 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:17:49,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:17:49,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1406064088, now seen corresponding path program 1 times [2022-07-13 15:17:49,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:17:49,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661832884] [2022-07-13 15:17:49,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:17:49,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:17:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:17:50,116 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:17:50,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:17:50,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661832884] [2022-07-13 15:17:50,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661832884] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:17:50,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657075922] [2022-07-13 15:17:50,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:17:50,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:17:50,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:17:50,120 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:17:50,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 15:17:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:17:50,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 15:17:50,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:17:50,394 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:17:50,395 INFO L390 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 57 [2022-07-13 15:17:50,408 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:17:50,409 INFO L390 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2022-07-13 15:17:50,425 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 15:17:50,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:17:50,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657075922] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:17:50,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 15:17:50,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 15 [2022-07-13 15:17:50,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563314342] [2022-07-13 15:17:50,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:17:50,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:17:50,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:17:50,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:17:50,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-07-13 15:17:50,428 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2022-07-13 15:17:50,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:17:50,447 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2022-07-13 15:17:50,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:17:50,448 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), 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) Word has length 33 [2022-07-13 15:17:50,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:17:50,449 INFO L225 Difference]: With dead ends: 53 [2022-07-13 15:17:50,449 INFO L226 Difference]: Without dead ends: 38 [2022-07-13 15:17:50,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-07-13 15:17:50,450 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:17:50,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-07-13 15:17:50,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-13 15:17:50,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-13 15:17:50,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 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) [2022-07-13 15:17:50,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-07-13 15:17:50,457 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 33 [2022-07-13 15:17:50,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:17:50,457 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-07-13 15:17:50,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2022-07-13 15:17:50,458 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-07-13 15:17:50,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 15:17:50,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:17:50,459 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:17:50,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-13 15:17:50,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:17:50,663 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:17:50,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:17:50,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1205422776, now seen corresponding path program 1 times [2022-07-13 15:17:50,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:17:50,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008501508] [2022-07-13 15:17:50,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:17:50,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:17:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:17:50,990 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:17:50,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:17:50,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008501508] [2022-07-13 15:17:50,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008501508] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:17:50,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009468759] [2022-07-13 15:17:50,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:17:50,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:17:50,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:17:50,994 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:17:50,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 15:17:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:17:51,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 87 conjunts are in the unsatisfiable core [2022-07-13 15:17:51,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:17:51,409 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-13 15:17:51,410 INFO L390 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 1 case distinctions, treesize of input 16 treesize of output 17 [2022-07-13 15:17:51,464 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-07-13 15:17:51,759 INFO L356 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-07-13 15:17:51,760 INFO L390 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 77 treesize of output 59 [2022-07-13 15:17:51,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:17:51,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 40 [2022-07-13 15:17:51,950 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-07-13 15:17:51,950 INFO L390 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 41 [2022-07-13 15:17:51,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:17:51,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2022-07-13 15:17:51,999 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:17:51,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:17:52,427 INFO L356 Elim1Store]: treesize reduction 14, result has 54.8 percent of original size [2022-07-13 15:17:52,428 INFO L390 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 431 treesize of output 319 [2022-07-13 15:17:52,835 INFO L390 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 7226 treesize of output 7054 [2022-07-13 15:17:53,757 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 15:17:53,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 15:17:53,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:17:53,972 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:545) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:348) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 15:17:53,975 INFO L158 Benchmark]: Toolchain (without parser) took 7307.52ms. Allocated memory was 94.4MB in the beginning and 163.6MB in the end (delta: 69.2MB). Free memory was 59.7MB in the beginning and 87.4MB in the end (delta: -27.7MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. [2022-07-13 15:17:53,975 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 94.4MB. Free memory was 49.0MB in the beginning and 49.0MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:17:53,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.90ms. Allocated memory is still 94.4MB. Free memory was 59.5MB in the beginning and 61.4MB in the end (delta: -1.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 15:17:53,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.74ms. Allocated memory is still 94.4MB. Free memory was 61.4MB in the beginning and 59.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:17:53,976 INFO L158 Benchmark]: Boogie Preprocessor took 30.08ms. Allocated memory is still 94.4MB. Free memory was 59.2MB in the beginning and 57.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:17:53,976 INFO L158 Benchmark]: RCFGBuilder took 398.57ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 57.7MB in the beginning and 88.5MB in the end (delta: -30.8MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2022-07-13 15:17:53,976 INFO L158 Benchmark]: TraceAbstraction took 6462.48ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 88.0MB in the beginning and 87.4MB in the end (delta: 547.5kB). Peak memory consumption was 95.5MB. Max. memory is 16.1GB. [2022-07-13 15:17:53,979 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 94.4MB. Free memory was 49.0MB in the beginning and 49.0MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.90ms. Allocated memory is still 94.4MB. Free memory was 59.5MB in the beginning and 61.4MB in the end (delta: -1.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.74ms. Allocated memory is still 94.4MB. Free memory was 61.4MB in the beginning and 59.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.08ms. Allocated memory is still 94.4MB. Free memory was 59.2MB in the beginning and 57.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 398.57ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 57.7MB in the beginning and 88.5MB in the end (delta: -30.8MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6462.48ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 88.0MB in the beginning and 87.4MB in the end (delta: 547.5kB). Peak memory consumption was 95.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 15:17:54,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/sll2n_remove_all_reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 b3d7899c651fa61cfb9cf623e0f4ceb470fe32eb0d0272d2277c965ed07c2f88 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:17:55,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:17:55,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:17:56,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:17:56,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:17:56,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:17:56,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:17:56,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:17:56,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:17:56,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:17:56,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:17:56,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:17:56,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:17:56,018 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:17:56,019 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:17:56,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:17:56,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:17:56,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:17:56,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:17:56,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:17:56,026 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:17:56,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:17:56,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:17:56,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:17:56,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:17:56,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:17:56,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:17:56,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:17:56,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:17:56,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:17:56,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:17:56,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:17:56,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:17:56,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:17:56,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:17:56,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:17:56,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:17:56,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:17:56,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:17:56,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:17:56,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:17:56,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:17:56,054 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 15:17:56,074 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:17:56,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:17:56,075 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:17:56,075 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:17:56,076 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:17:56,076 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:17:56,077 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:17:56,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:17:56,077 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:17:56,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:17:56,078 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:17:56,078 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:17:56,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:17:56,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:17:56,079 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:17:56,079 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:17:56,079 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 15:17:56,079 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 15:17:56,080 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 15:17:56,080 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:17:56,080 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:17:56,080 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:17:56,080 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:17:56,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:17:56,081 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:17:56,081 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:17:56,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:17:56,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:17:56,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:17:56,082 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:17:56,082 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 15:17:56,083 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 15:17:56,083 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:17:56,085 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:17:56,086 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:17:56,086 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 15:17:56,086 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> b3d7899c651fa61cfb9cf623e0f4ceb470fe32eb0d0272d2277c965ed07c2f88 [2022-07-13 15:17:56,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:17:56,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:17:56,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:17:56,456 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:17:56,457 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:17:56,459 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i [2022-07-13 15:17:56,528 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/916d4fc45/f6dbc5df89324250a11032ed9bad7193/FLAGce49e59d3 [2022-07-13 15:17:57,008 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:17:57,010 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i [2022-07-13 15:17:57,035 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/916d4fc45/f6dbc5df89324250a11032ed9bad7193/FLAGce49e59d3 [2022-07-13 15:17:57,527 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/916d4fc45/f6dbc5df89324250a11032ed9bad7193 [2022-07-13 15:17:57,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:17:57,530 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:17:57,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:17:57,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:17:57,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:17:57,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:17:57" (1/1) ... [2022-07-13 15:17:57,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ffd700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:57, skipping insertion in model container [2022-07-13 15:17:57,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:17:57" (1/1) ... [2022-07-13 15:17:57,543 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:17:57,582 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:17:57,892 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/sll2n_remove_all_reverse.i[24038,24051] [2022-07-13 15:17:57,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:17:57,907 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:17:57,962 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/sll2n_remove_all_reverse.i[24038,24051] [2022-07-13 15:17:57,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:17:57,997 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:17:57,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:57 WrapperNode [2022-07-13 15:17:57,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:17:57,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:17:57,999 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:17:57,999 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:17:58,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:57" (1/1) ... [2022-07-13 15:17:58,028 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:57" (1/1) ... [2022-07-13 15:17:58,062 INFO L137 Inliner]: procedures = 129, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 103 [2022-07-13 15:17:58,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:17:58,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:17:58,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:17:58,064 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:17:58,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:57" (1/1) ... [2022-07-13 15:17:58,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:57" (1/1) ... [2022-07-13 15:17:58,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:57" (1/1) ... [2022-07-13 15:17:58,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:57" (1/1) ... [2022-07-13 15:17:58,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:57" (1/1) ... [2022-07-13 15:17:58,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:57" (1/1) ... [2022-07-13 15:17:58,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:57" (1/1) ... [2022-07-13 15:17:58,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:17:58,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:17:58,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:17:58,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:17:58,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:57" (1/1) ... [2022-07-13 15:17:58,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:17:58,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:17:58,133 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 15:17:58,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 15:17:58,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:17:58,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:17:58,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 15:17:58,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:17:58,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:17:58,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:17:58,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 15:17:58,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 15:17:58,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 15:17:58,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:17:58,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:17:58,281 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:17:58,282 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:17:58,547 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:17:58,552 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:17:58,552 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 15:17:58,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:17:58 BoogieIcfgContainer [2022-07-13 15:17:58,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:17:58,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:17:58,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:17:58,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:17:58,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:17:57" (1/3) ... [2022-07-13 15:17:58,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cac0eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:17:58, skipping insertion in model container [2022-07-13 15:17:58,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:17:57" (2/3) ... [2022-07-13 15:17:58,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cac0eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:17:58, skipping insertion in model container [2022-07-13 15:17:58,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:17:58" (3/3) ... [2022-07-13 15:17:58,561 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all_reverse.i [2022-07-13 15:17:58,573 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:17:58,573 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 15:17:58,627 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:17:58,636 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@46077dbe, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7515cd6 [2022-07-13 15:17:58,636 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 15:17:58,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 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) [2022-07-13 15:17:58,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 15:17:58,646 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:17:58,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:17:58,647 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:17:58,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:17:58,653 INFO L85 PathProgramCache]: Analyzing trace with hash -409316200, now seen corresponding path program 1 times [2022-07-13 15:17:58,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:17:58,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230993948] [2022-07-13 15:17:58,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:17:58,662 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:17:58,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:17:58,664 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:17:58,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 15:17:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:17:58,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 15:17:58,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:17:58,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:17:58,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:17:58,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:17:58,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230993948] [2022-07-13 15:17:58,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230993948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:17:58,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:17:58,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 15:17:58,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697386753] [2022-07-13 15:17:58,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:17:58,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 15:17:58,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:17:58,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 15:17:58,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:17:58,819 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 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) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2022-07-13 15:17:58,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:17:58,836 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-07-13 15:17:58,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 15:17:58,838 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) Word has length 9 [2022-07-13 15:17:58,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:17:58,843 INFO L225 Difference]: With dead ends: 40 [2022-07-13 15:17:58,844 INFO L226 Difference]: Without dead ends: 20 [2022-07-13 15:17:58,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:17:58,852 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:17:58,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:17:58,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-13 15:17:58,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-13 15:17:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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) [2022-07-13 15:17:58,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-07-13 15:17:58,879 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 9 [2022-07-13 15:17:58,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:17:58,880 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-13 15:17:58,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2022-07-13 15:17:58,880 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-07-13 15:17:58,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 15:17:58,881 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:17:58,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:17:58,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-13 15:17:59,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:17:59,096 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:17:59,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:17:59,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1724473208, now seen corresponding path program 1 times [2022-07-13 15:17:59,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:17:59,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364110937] [2022-07-13 15:17:59,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:17:59,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:17:59,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:17:59,099 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:17:59,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 15:17:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:17:59,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 15:17:59,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:17:59,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:17:59,208 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:17:59,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:17:59,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364110937] [2022-07-13 15:17:59,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364110937] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:17:59,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:17:59,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:17:59,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048889981] [2022-07-13 15:17:59,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:17:59,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:17:59,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:17:59,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:17:59,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:17:59,221 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-07-13 15:17:59,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:17:59,243 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-07-13 15:17:59,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:17:59,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 9 [2022-07-13 15:17:59,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:17:59,246 INFO L225 Difference]: With dead ends: 38 [2022-07-13 15:17:59,246 INFO L226 Difference]: Without dead ends: 25 [2022-07-13 15:17:59,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:17:59,251 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:17:59,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 40 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:17:59,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-13 15:17:59,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-07-13 15:17:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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) [2022-07-13 15:17:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-07-13 15:17:59,259 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 9 [2022-07-13 15:17:59,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:17:59,260 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-07-13 15:17:59,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-07-13 15:17:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-07-13 15:17:59,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 15:17:59,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:17:59,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:17:59,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-13 15:17:59,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:17:59,472 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:17:59,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:17:59,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1462004256, now seen corresponding path program 1 times [2022-07-13 15:17:59,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:17:59,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506971074] [2022-07-13 15:17:59,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:17:59,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:17:59,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:17:59,474 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:17:59,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 15:17:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:17:59,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 15:17:59,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:17:59,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:17:59,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:17:59,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:17:59,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:17:59,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506971074] [2022-07-13 15:17:59,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506971074] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:17:59,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:17:59,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-13 15:17:59,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380953788] [2022-07-13 15:17:59,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:17:59,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:17:59,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:17:59,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:17:59,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:17:59,710 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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) [2022-07-13 15:17:59,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:17:59,746 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-07-13 15:17:59,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:17:59,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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) Word has length 14 [2022-07-13 15:17:59,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:17:59,748 INFO L225 Difference]: With dead ends: 43 [2022-07-13 15:17:59,748 INFO L226 Difference]: Without dead ends: 30 [2022-07-13 15:17:59,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:17:59,751 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:17:59,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 65 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:17:59,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-13 15:17:59,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2022-07-13 15:17:59,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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) [2022-07-13 15:17:59,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-07-13 15:17:59,763 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 14 [2022-07-13 15:17:59,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:17:59,764 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-07-13 15:17:59,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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) [2022-07-13 15:17:59,764 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-07-13 15:17:59,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 15:17:59,766 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:17:59,766 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:17:59,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-13 15:17:59,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:17:59,977 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:17:59,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:17:59,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1187831688, now seen corresponding path program 2 times [2022-07-13 15:17:59,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:17:59,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992321961] [2022-07-13 15:17:59,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:17:59,979 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:17:59,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:17:59,981 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:17:59,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-13 15:18:00,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 15:18:00,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:18:00,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 15:18:00,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:00,088 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 15:18:00,089 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:18:00,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:18:00,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992321961] [2022-07-13 15:18:00,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992321961] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:18:00,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:18:00,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:18:00,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592906015] [2022-07-13 15:18:00,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:18:00,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:18:00,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:18:00,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:18:00,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:18:00,091 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2022-07-13 15:18:00,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:00,116 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-07-13 15:18:00,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:18:00,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) Word has length 19 [2022-07-13 15:18:00,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:00,117 INFO L225 Difference]: With dead ends: 37 [2022-07-13 15:18:00,117 INFO L226 Difference]: Without dead ends: 33 [2022-07-13 15:18:00,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:18:00,118 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:18:00,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 39 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:18:00,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-13 15:18:00,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2022-07-13 15:18:00,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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) [2022-07-13 15:18:00,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-07-13 15:18:00,123 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2022-07-13 15:18:00,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:00,123 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-13 15:18:00,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2022-07-13 15:18:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-07-13 15:18:00,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 15:18:00,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:00,124 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:00,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-13 15:18:00,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:18:00,335 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:00,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:00,335 INFO L85 PathProgramCache]: Analyzing trace with hash 419983469, now seen corresponding path program 1 times [2022-07-13 15:18:00,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:18:00,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542340813] [2022-07-13 15:18:00,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:00,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:18:00,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:18:00,338 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:18:00,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-13 15:18:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:00,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 15:18:00,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:00,552 INFO L390 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 13 treesize of output 9 [2022-07-13 15:18:00,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:00,672 INFO L356 Elim1Store]: treesize reduction 18, result has 47.1 percent of original size [2022-07-13 15:18:00,673 INFO L390 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 26 [2022-07-13 15:18:00,684 INFO L390 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 7 treesize of output 3 [2022-07-13 15:18:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:18:00,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:18:00,763 INFO L390 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 27 treesize of output 19 [2022-07-13 15:18:00,948 INFO L356 Elim1Store]: treesize reduction 13, result has 62.9 percent of original size [2022-07-13 15:18:00,949 INFO L390 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 150 [2022-07-13 15:18:01,015 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:18:01,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:18:01,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542340813] [2022-07-13 15:18:01,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542340813] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:18:01,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:18:01,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2022-07-13 15:18:01,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107277665] [2022-07-13 15:18:01,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:18:01,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 15:18:01,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:18:01,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 15:18:01,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-07-13 15:18:01,020 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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) [2022-07-13 15:18:01,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:01,687 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-07-13 15:18:01,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 15:18:01,688 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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) Word has length 23 [2022-07-13 15:18:01,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:01,689 INFO L225 Difference]: With dead ends: 44 [2022-07-13 15:18:01,689 INFO L226 Difference]: Without dead ends: 33 [2022-07-13 15:18:01,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2022-07-13 15:18:01,690 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 105 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:18:01,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 112 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 114 Invalid, 0 Unknown, 29 Unchecked, 0.4s Time] [2022-07-13 15:18:01,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-13 15:18:01,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-07-13 15:18:01,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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) [2022-07-13 15:18:01,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-07-13 15:18:01,695 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 23 [2022-07-13 15:18:01,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:01,696 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-07-13 15:18:01,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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) [2022-07-13 15:18:01,696 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-07-13 15:18:01,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 15:18:01,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:01,697 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:01,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-13 15:18:01,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:18:01,908 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:01,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:01,908 INFO L85 PathProgramCache]: Analyzing trace with hash -467848085, now seen corresponding path program 1 times [2022-07-13 15:18:01,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:18:01,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420517243] [2022-07-13 15:18:01,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:01,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:18:01,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:18:01,910 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:18:01,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-13 15:18:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:02,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-13 15:18:02,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:02,125 INFO L390 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 13 treesize of output 9 [2022-07-13 15:18:02,249 INFO L390 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 15 treesize of output 7 [2022-07-13 15:18:02,311 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:02,311 INFO L390 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-07-13 15:18:02,336 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:18:02,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:18:02,455 INFO L390 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 27 treesize of output 19 [2022-07-13 15:18:02,639 INFO L356 Elim1Store]: treesize reduction 13, result has 62.9 percent of original size [2022-07-13 15:18:02,639 INFO L390 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 114 [2022-07-13 15:18:02,753 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:18:02,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:18:02,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420517243] [2022-07-13 15:18:02,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420517243] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:18:02,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:18:02,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 18 [2022-07-13 15:18:02,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898461688] [2022-07-13 15:18:02,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:18:02,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 15:18:02,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:18:02,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 15:18:02,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-07-13 15:18:02,755 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 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) [2022-07-13 15:18:03,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:03,557 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-07-13 15:18:03,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 15:18:03,558 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 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) Word has length 26 [2022-07-13 15:18:03,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:03,558 INFO L225 Difference]: With dead ends: 43 [2022-07-13 15:18:03,558 INFO L226 Difference]: Without dead ends: 32 [2022-07-13 15:18:03,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2022-07-13 15:18:03,559 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 46 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:18:03,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 174 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 137 Invalid, 0 Unknown, 30 Unchecked, 0.4s Time] [2022-07-13 15:18:03,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-13 15:18:03,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-07-13 15:18:03,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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) [2022-07-13 15:18:03,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-07-13 15:18:03,565 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 26 [2022-07-13 15:18:03,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:03,565 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-07-13 15:18:03,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 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) [2022-07-13 15:18:03,565 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-07-13 15:18:03,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 15:18:03,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:03,566 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:03,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-13 15:18:03,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:18:03,780 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:03,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:03,780 INFO L85 PathProgramCache]: Analyzing trace with hash 404940614, now seen corresponding path program 1 times [2022-07-13 15:18:03,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:18:03,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418653779] [2022-07-13 15:18:03,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:03,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:18:03,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:18:03,782 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:18:03,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-13 15:18:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:03,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 15:18:03,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:03,943 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 15:18:03,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:18:04,033 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 15:18:04,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:18:04,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418653779] [2022-07-13 15:18:04,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418653779] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:18:04,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:18:04,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-13 15:18:04,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719128295] [2022-07-13 15:18:04,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:18:04,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 15:18:04,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:18:04,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 15:18:04,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 15:18:04,035 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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) [2022-07-13 15:18:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:04,094 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-07-13 15:18:04,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:18:04,095 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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) Word has length 28 [2022-07-13 15:18:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:04,095 INFO L225 Difference]: With dead ends: 46 [2022-07-13 15:18:04,095 INFO L226 Difference]: Without dead ends: 42 [2022-07-13 15:18:04,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-13 15:18:04,096 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 58 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:18:04,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 64 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:18:04,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-13 15:18:04,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2022-07-13 15:18:04,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 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) [2022-07-13 15:18:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-07-13 15:18:04,102 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 28 [2022-07-13 15:18:04,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:04,102 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-07-13 15:18:04,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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) [2022-07-13 15:18:04,102 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-07-13 15:18:04,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 15:18:04,103 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:04,107 INFO L195 NwaCegarLoop]: 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] [2022-07-13 15:18:04,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-13 15:18:04,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:18:04,318 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:04,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:04,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1132959445, now seen corresponding path program 1 times [2022-07-13 15:18:04,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:18:04,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079099677] [2022-07-13 15:18:04,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:04,319 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:18:04,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:18:04,321 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:18:04,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-13 15:18:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:04,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 15:18:04,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:04,482 INFO L390 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 11 treesize of output 7 [2022-07-13 15:18:04,486 INFO L390 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 11 treesize of output 7 [2022-07-13 15:18:04,520 INFO L390 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 15 treesize of output 7 [2022-07-13 15:18:04,523 INFO L390 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 15 treesize of output 7 [2022-07-13 15:18:04,545 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 15:18:04,545 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:18:04,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:18:04,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079099677] [2022-07-13 15:18:04,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079099677] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:18:04,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:18:04,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:18:04,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972476335] [2022-07-13 15:18:04,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:18:04,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:18:04,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:18:04,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:18:04,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:18:04,548 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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) [2022-07-13 15:18:04,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:04,694 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-07-13 15:18:04,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:18:04,695 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), 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) Word has length 32 [2022-07-13 15:18:04,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:04,696 INFO L225 Difference]: With dead ends: 47 [2022-07-13 15:18:04,696 INFO L226 Difference]: Without dead ends: 36 [2022-07-13 15:18:04,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:18:04,697 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:18:04,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 64 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:18:04,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-13 15:18:04,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-13 15:18:04,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 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) [2022-07-13 15:18:04,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-07-13 15:18:04,702 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 32 [2022-07-13 15:18:04,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:04,702 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-07-13 15:18:04,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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) [2022-07-13 15:18:04,702 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-07-13 15:18:04,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 15:18:04,702 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:04,703 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:04,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-13 15:18:04,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:18:04,914 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:04,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:04,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1197513453, now seen corresponding path program 2 times [2022-07-13 15:18:04,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:18:04,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338100164] [2022-07-13 15:18:04,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:18:04,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:18:04,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:18:04,916 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:18:04,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-13 15:18:05,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:18:05,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:18:05,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 15:18:05,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:05,182 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:05,182 INFO L390 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 57 [2022-07-13 15:18:05,195 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:05,195 INFO L390 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2022-07-13 15:18:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 15:18:05,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:18:05,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:18:05,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338100164] [2022-07-13 15:18:05,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338100164] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:18:05,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:18:05,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:18:05,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108197516] [2022-07-13 15:18:05,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:18:05,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:18:05,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:18:05,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:18:05,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:18:05,220 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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) [2022-07-13 15:18:05,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:05,279 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-07-13 15:18:05,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:18:05,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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) Word has length 35 [2022-07-13 15:18:05,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:05,280 INFO L225 Difference]: With dead ends: 49 [2022-07-13 15:18:05,280 INFO L226 Difference]: Without dead ends: 38 [2022-07-13 15:18:05,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:18:05,281 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:18:05,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-07-13 15:18:05,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-13 15:18:05,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-13 15:18:05,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 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) [2022-07-13 15:18:05,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-07-13 15:18:05,287 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 35 [2022-07-13 15:18:05,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:05,287 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-07-13 15:18:05,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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) [2022-07-13 15:18:05,288 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-07-13 15:18:05,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 15:18:05,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:05,288 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:05,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-13 15:18:05,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:18:05,492 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:05,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:05,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1205422776, now seen corresponding path program 3 times [2022-07-13 15:18:05,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:18:05,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514033757] [2022-07-13 15:18:05,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 15:18:05,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:18:05,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:18:05,494 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:18:05,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-13 15:18:05,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 15:18:05,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:18:05,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-13 15:18:05,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:06,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:06,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2022-07-13 15:18:06,172 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-13 15:18:06,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 40 [2022-07-13 15:18:06,342 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:18:06,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:18:06,413 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_367 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base| v_ArrVal_367) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_366 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base| v_ArrVal_366) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-13 15:18:06,440 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_366 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_remove_last_~last~0#1.base| v_ArrVal_366) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_367 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_remove_last_~last~0#1.base| v_ArrVal_367) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-13 15:18:07,060 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_366 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_remove_last_~last~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_remove_last_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_remove_last_~last~0#1.base|) .cse0 (_ bv0 32))) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_remove_last_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_remove_last_~last~0#1.base|) .cse0 (_ bv0 32))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) v_ArrVal_366)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_367 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_remove_last_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_remove_last_~last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_remove_last_~last~0#1.offset|) (_ bv0 32))))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) v_ArrVal_367)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_remove_last_~last~0#1.offset|))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_remove_last_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_remove_last_~last~0#1.base|) .cse6 (_ bv0 32)))) (.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_remove_last_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_remove_last_~last~0#1.base|) .cse6 (_ bv0 32))))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (_ bv0 32) (select (select .cse2 .cse3) .cse4)) (= (select (select .cse5 .cse3) .cse4) (_ bv0 32))))))) is different from false [2022-07-13 15:18:08,008 INFO L356 Elim1Store]: treesize reduction 133, result has 15.8 percent of original size [2022-07-13 15:18:08,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 550 treesize of output 442 [2022-07-13 15:18:08,078 INFO L356 Elim1Store]: treesize reduction 68, result has 22.7 percent of original size [2022-07-13 15:18:08,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 507 treesize of output 442 [2022-07-13 15:18:08,417 INFO L356 Elim1Store]: treesize reduction 63, result has 35.1 percent of original size [2022-07-13 15:18:08,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 254 treesize of output 232 [2022-07-13 15:18:08,460 INFO L356 Elim1Store]: treesize reduction 34, result has 10.5 percent of original size [2022-07-13 15:18:08,460 INFO L390 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 186 treesize of output 176 [2022-07-13 15:18:08,478 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:18:08,478 INFO L390 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 209 treesize of output 197 [2022-07-13 15:18:08,567 INFO L390 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 5 treesize of output 3 [2022-07-13 15:18:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 4 refuted. 1 times theorem prover too weak. 1 trivial. 13 not checked. [2022-07-13 15:18:09,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:18:09,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514033757] [2022-07-13 15:18:09,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514033757] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:18:09,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:18:09,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2022-07-13 15:18:09,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139829661] [2022-07-13 15:18:09,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:18:09,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-13 15:18:09,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:18:09,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-13 15:18:09,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=498, Unknown=7, NotChecked=150, Total=812 [2022-07-13 15:18:09,018 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 29 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 29 states have internal predecessors, (71), 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) [2022-07-13 15:18:12,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:12,372 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2022-07-13 15:18:12,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 15:18:12,373 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 29 states have internal predecessors, (71), 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) Word has length 37 [2022-07-13 15:18:12,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:12,374 INFO L225 Difference]: With dead ends: 82 [2022-07-13 15:18:12,375 INFO L226 Difference]: Without dead ends: 62 [2022-07-13 15:18:12,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=411, Invalid=1068, Unknown=15, NotChecked=228, Total=1722 [2022-07-13 15:18:12,376 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 129 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 354 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:18:12,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 222 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 131 Invalid, 0 Unknown, 354 Unchecked, 0.3s Time] [2022-07-13 15:18:12,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-13 15:18:12,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2022-07-13 15:18:12,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 53 states have internal predecessors, (60), 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) [2022-07-13 15:18:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2022-07-13 15:18:12,387 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 37 [2022-07-13 15:18:12,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:12,387 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2022-07-13 15:18:12,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 29 states have internal predecessors, (71), 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) [2022-07-13 15:18:12,387 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-07-13 15:18:12,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 15:18:12,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:12,388 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:12,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-13 15:18:12,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:18:12,601 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:12,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:12,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1492532109, now seen corresponding path program 4 times [2022-07-13 15:18:12,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:18:12,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657332004] [2022-07-13 15:18:12,602 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 15:18:12,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:18:12,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:18:12,603 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:18:12,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-13 15:18:12,758 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 15:18:12,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:18:12,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-13 15:18:12,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:12,786 INFO L390 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 [2022-07-13 15:18:12,837 INFO L390 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 13 treesize of output 9 [2022-07-13 15:18:12,843 INFO L390 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 13 treesize of output 9 [2022-07-13 15:18:12,880 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:18:12,880 INFO L390 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 12 treesize of output 12 [2022-07-13 15:18:12,921 INFO L390 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 16 treesize of output 18 [2022-07-13 15:18:12,928 INFO L390 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 16 treesize of output 18 [2022-07-13 15:18:12,963 INFO L390 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 21 treesize of output 20 [2022-07-13 15:18:12,968 INFO L390 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 27 treesize of output 26 [2022-07-13 15:18:13,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:13,434 INFO L356 Elim1Store]: treesize reduction 88, result has 24.1 percent of original size [2022-07-13 15:18:13,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 95 [2022-07-13 15:18:13,472 INFO L356 Elim1Store]: treesize reduction 58, result has 10.8 percent of original size [2022-07-13 15:18:13,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 43 [2022-07-13 15:18:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 15:18:13,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:18:37,575 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_14| (_ BitVec 32)) (v_ArrVal_425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_14| v_ArrVal_426))) (store .cse9 v_DerPreprocessor_3 (store (select .cse9 v_DerPreprocessor_3) (_ bv4 32) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_14| v_ArrVal_425)) (.cse0 (select (select .cse5 |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (store (select .cse8 .cse0) (_ bv4 32) |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse2 (store .cse8 .cse0 .cse6))) (let ((.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= v_DerPreprocessor_3 .cse0)) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_14|)))) (not (= .cse1 (_ bv0 32))) (let ((.cse7 (bvadd (_ bv4 32) .cse1))) (let ((.cse3 (select (select .cse5 .cse0) .cse7)) (.cse4 (bvadd (_ bv4 32) (select .cse6 .cse7)))) (and (= (select (select .cse2 .cse3) .cse4) (_ bv0 32)) (= (select (select .cse5 .cse3) .cse4) (_ bv0 32))))) (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_14| .cse0))))))))) is different from false [2022-07-13 15:18:39,024 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:39,025 INFO L390 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 1098 treesize of output 688