./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-circular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 20ed64ec 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-circular-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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 valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6ca87716ddde5218a0bb0d9c4d67f4e1c636cb2c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 04:26:18,099 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 04:26:18,101 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 04:26:18,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 04:26:18,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 04:26:18,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 04:26:18,155 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 04:26:18,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 04:26:18,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 04:26:18,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 04:26:18,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 04:26:18,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 04:26:18,175 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 04:26:18,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 04:26:18,176 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 04:26:18,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 04:26:18,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 04:26:18,179 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 04:26:18,180 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 04:26:18,369 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 04:26:18,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 04:26:18,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 04:26:18,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 04:26:18,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 04:26:18,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 04:26:18,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 04:26:18,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 04:26:18,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 04:26:18,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 04:26:18,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 04:26:18,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 04:26:18,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 04:26:18,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 04:26:18,379 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 04:26:18,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 04:26:18,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 04:26:18,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 04:26:18,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 04:26:18,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 04:26:18,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 04:26:18,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 04:26:18,388 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-08-27 04:26:18,426 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 04:26:18,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 04:26:18,428 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 04:26:18,428 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 04:26:18,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 04:26:18,430 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 04:26:18,430 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 04:26:18,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 04:26:18,430 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 04:26:18,431 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 04:26:18,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 04:26:18,431 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 04:26:18,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 04:26:18,432 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 04:26:18,432 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 04:26:18,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 04:26:18,432 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 04:26:18,432 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 04:26:18,432 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 04:26:18,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 04:26:18,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 04:26:18,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 04:26:18,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 04:26:18,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 04:26:18,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 04:26:18,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 04:26:18,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 04:26:18,434 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 04:26:18,434 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 valid-memcleanup) ) 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 -> 6ca87716ddde5218a0bb0d9c4d67f4e1c636cb2c [2021-08-27 04:26:18,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 04:26:18,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 04:26:18,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 04:26:18,813 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 04:26:18,814 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 04:26:18,815 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-circular-2.i [2021-08-27 04:26:18,881 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ded89f35/c46cb417e7214d4797d7476e88e52e8c/FLAG0fcf23620 [2021-08-27 04:26:19,359 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 04:26:19,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-2.i [2021-08-27 04:26:19,374 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ded89f35/c46cb417e7214d4797d7476e88e52e8c/FLAG0fcf23620 [2021-08-27 04:26:19,697 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ded89f35/c46cb417e7214d4797d7476e88e52e8c [2021-08-27 04:26:19,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 04:26:19,701 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 04:26:19,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 04:26:19,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 04:26:19,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 04:26:19,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:26:19" (1/1) ... [2021-08-27 04:26:19,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fe3efeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:19, skipping insertion in model container [2021-08-27 04:26:19,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:26:19" (1/1) ... [2021-08-27 04:26:19,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 04:26:19,762 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 04:26:20,071 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-2.i[22324,22337] [2021-08-27 04:26:20,075 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-2.i[22430,22443] [2021-08-27 04:26:20,078 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-2.i[22554,22567] [2021-08-27 04:26:20,087 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 04:26:20,094 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 04:26:20,130 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-2.i[22324,22337] [2021-08-27 04:26:20,133 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-2.i[22430,22443] [2021-08-27 04:26:20,136 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-2.i[22554,22567] [2021-08-27 04:26:20,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 04:26:20,170 INFO L208 MainTranslator]: Completed translation [2021-08-27 04:26:20,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:20 WrapperNode [2021-08-27 04:26:20,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 04:26:20,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 04:26:20,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 04:26:20,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 04:26:20,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:20" (1/1) ... [2021-08-27 04:26:20,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:20" (1/1) ... [2021-08-27 04:26:20,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:20" (1/1) ... [2021-08-27 04:26:20,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:20" (1/1) ... [2021-08-27 04:26:20,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:20" (1/1) ... [2021-08-27 04:26:20,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:20" (1/1) ... [2021-08-27 04:26:20,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:20" (1/1) ... [2021-08-27 04:26:20,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 04:26:20,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 04:26:20,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 04:26:20,264 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 04:26:20,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:20" (1/1) ... [2021-08-27 04:26:20,271 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 04:26:20,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:20,310 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 04:26:20,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 04:26:20,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 04:26:20,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 04:26:20,363 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 04:26:20,364 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 04:26:20,364 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 04:26:20,364 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 04:26:20,366 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 04:26:20,366 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 04:26:20,366 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 04:26:20,366 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 04:26:20,366 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 04:26:20,366 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 04:26:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 04:26:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 04:26:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 04:26:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 04:26:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 04:26:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 04:26:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 04:26:20,368 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 04:26:20,368 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 04:26:20,368 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 04:26:20,368 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 04:26:20,368 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 04:26:20,368 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 04:26:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 04:26:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 04:26:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 04:26:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 04:26:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 04:26:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 04:26:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 04:26:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 04:26:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 04:26:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 04:26:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 04:26:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 04:26:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 04:26:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 04:26:20,371 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 04:26:20,371 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 04:26:20,371 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 04:26:20,371 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 04:26:20,371 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 04:26:20,372 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 04:26:20,372 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 04:26:20,373 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 04:26:20,373 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 04:26:20,373 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 04:26:20,373 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 04:26:20,373 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 04:26:20,373 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 04:26:20,374 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 04:26:20,374 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 04:26:20,374 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 04:26:20,374 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 04:26:20,374 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 04:26:20,374 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 04:26:20,374 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 04:26:20,375 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 04:26:20,375 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 04:26:20,375 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 04:26:20,375 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 04:26:20,377 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 04:26:20,377 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 04:26:20,377 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 04:26:20,378 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 04:26:20,378 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 04:26:20,378 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 04:26:20,378 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 04:26:20,378 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 04:26:20,378 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 04:26:20,378 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 04:26:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 04:26:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 04:26:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 04:26:20,380 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 04:26:20,380 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 04:26:20,380 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 04:26:20,380 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 04:26:20,380 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 04:26:20,380 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 04:26:20,380 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 04:26:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 04:26:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 04:26:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 04:26:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 04:26:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 04:26:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 04:26:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 04:26:20,382 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 04:26:20,382 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 04:26:20,382 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 04:26:20,382 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 04:26:20,382 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 04:26:20,382 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 04:26:20,382 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 04:26:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 04:26:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 04:26:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 04:26:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 04:26:20,398 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 04:26:20,399 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 04:26:20,399 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 04:26:20,399 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 04:26:20,399 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 04:26:20,400 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 04:26:20,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 04:26:20,400 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 04:26:20,400 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 04:26:20,400 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 04:26:20,400 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 04:26:20,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 04:26:20,401 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 04:26:20,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 04:26:20,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 04:26:20,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 04:26:20,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 04:26:20,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 04:26:20,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 04:26:20,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 04:26:20,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 04:26:20,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 04:26:21,200 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 04:26:21,200 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-08-27 04:26:21,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:21 BoogieIcfgContainer [2021-08-27 04:26:21,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 04:26:21,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 04:26:21,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 04:26:21,206 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 04:26:21,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 04:26:19" (1/3) ... [2021-08-27 04:26:21,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c2d6a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 04:26:21, skipping insertion in model container [2021-08-27 04:26:21,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:20" (2/3) ... [2021-08-27 04:26:21,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c2d6a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 04:26:21, skipping insertion in model container [2021-08-27 04:26:21,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:21" (3/3) ... [2021-08-27 04:26:21,209 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-circular-2.i [2021-08-27 04:26:21,213 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 04:26:21,214 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2021-08-27 04:26:21,248 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 04:26:21,253 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 04:26:21,254 INFO L340 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2021-08-27 04:26:21,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 56 states have (on average 2.1607142857142856) internal successors, (121), 102 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 04:26:21,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 04:26:21,272 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:21,273 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:21,273 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-08-27 04:26:21,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:21,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1675934833, now seen corresponding path program 1 times [2021-08-27 04:26:21,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:21,285 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495652630] [2021-08-27 04:26:21,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:21,286 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:21,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:21,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:21,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:21,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495652630] [2021-08-27 04:26:21,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495652630] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:21,468 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:21,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 04:26:21,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642526140] [2021-08-27 04:26:21,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:21,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:21,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:21,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:21,497 INFO L87 Difference]: Start difference. First operand has 107 states, 56 states have (on average 2.1607142857142856) internal successors, (121), 102 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:21,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:21,767 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2021-08-27 04:26:21,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:21,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 04:26:21,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:21,775 INFO L225 Difference]: With dead ends: 113 [2021-08-27 04:26:21,776 INFO L226 Difference]: Without dead ends: 110 [2021-08-27 04:26:21,777 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:21,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-08-27 04:26:21,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2021-08-27 04:26:21,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 96 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:21,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2021-08-27 04:26:21,809 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 7 [2021-08-27 04:26:21,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:21,810 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2021-08-27 04:26:21,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:21,810 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2021-08-27 04:26:21,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 04:26:21,811 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:21,811 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:21,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 04:26:21,811 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-08-27 04:26:21,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:21,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1675934832, now seen corresponding path program 1 times [2021-08-27 04:26:21,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:21,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293276596] [2021-08-27 04:26:21,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:21,813 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:21,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:21,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:21,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:21,905 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293276596] [2021-08-27 04:26:21,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293276596] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:21,905 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:21,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 04:26:21,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330104790] [2021-08-27 04:26:21,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:21,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:21,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:21,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:21,908 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:22,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:22,137 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2021-08-27 04:26:22,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:22,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 04:26:22,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:22,139 INFO L225 Difference]: With dead ends: 108 [2021-08-27 04:26:22,139 INFO L226 Difference]: Without dead ends: 108 [2021-08-27 04:26:22,140 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.5ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:22,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-08-27 04:26:22,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2021-08-27 04:26:22,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 55 states have (on average 1.8) internal successors, (99), 92 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:22,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2021-08-27 04:26:22,146 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 7 [2021-08-27 04:26:22,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:22,147 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2021-08-27 04:26:22,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:22,147 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2021-08-27 04:26:22,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 04:26:22,148 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:22,148 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:22,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 04:26:22,148 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr13REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-08-27 04:26:22,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:22,149 INFO L82 PathProgramCache]: Analyzing trace with hash 75861693, now seen corresponding path program 1 times [2021-08-27 04:26:22,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:22,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563935537] [2021-08-27 04:26:22,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:22,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:22,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:22,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:22,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:22,232 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563935537] [2021-08-27 04:26:22,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563935537] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:22,232 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:22,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 04:26:22,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145733641] [2021-08-27 04:26:22,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 04:26:22,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:22,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 04:26:22,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 04:26:22,234 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:22,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:22,486 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2021-08-27 04:26:22,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 04:26:22,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-08-27 04:26:22,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:22,488 INFO L225 Difference]: With dead ends: 94 [2021-08-27 04:26:22,488 INFO L226 Difference]: Without dead ends: 94 [2021-08-27 04:26:22,488 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:22,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-08-27 04:26:22,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2021-08-27 04:26:22,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 55 states have (on average 1.6) internal successors, (88), 81 states have internal predecessors, (88), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:22,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2021-08-27 04:26:22,493 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 12 [2021-08-27 04:26:22,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:22,494 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2021-08-27 04:26:22,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:22,494 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2021-08-27 04:26:22,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 04:26:22,494 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:22,495 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:22,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 04:26:22,495 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr14REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-08-27 04:26:22,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:22,496 INFO L82 PathProgramCache]: Analyzing trace with hash 75861694, now seen corresponding path program 1 times [2021-08-27 04:26:22,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:22,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127677101] [2021-08-27 04:26:22,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:22,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:22,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:22,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:22,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:22,632 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127677101] [2021-08-27 04:26:22,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127677101] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:22,633 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:22,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 04:26:22,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108473932] [2021-08-27 04:26:22,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 04:26:22,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:22,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 04:26:22,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 04:26:22,635 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:22,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:22,906 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2021-08-27 04:26:22,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 04:26:22,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-08-27 04:26:22,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:22,907 INFO L225 Difference]: With dead ends: 105 [2021-08-27 04:26:22,908 INFO L226 Difference]: Without dead ends: 105 [2021-08-27 04:26:22,908 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:22,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-08-27 04:26:22,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 91. [2021-08-27 04:26:22,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 87 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:22,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2021-08-27 04:26:22,913 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 12 [2021-08-27 04:26:22,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:22,914 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2021-08-27 04:26:22,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:22,914 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2021-08-27 04:26:22,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 04:26:22,915 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:22,915 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:22,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 04:26:22,915 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr17ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-08-27 04:26:22,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:22,916 INFO L82 PathProgramCache]: Analyzing trace with hash 361683424, now seen corresponding path program 1 times [2021-08-27 04:26:22,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:22,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084380363] [2021-08-27 04:26:22,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:22,917 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:23,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:23,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:23,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:23,174 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084380363] [2021-08-27 04:26:23,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084380363] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:23,175 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:23,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 04:26:23,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925922045] [2021-08-27 04:26:23,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:23,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:23,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:23,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:23,176 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:23,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:23,479 INFO L93 Difference]: Finished difference Result 174 states and 185 transitions. [2021-08-27 04:26:23,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 04:26:23,480 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-08-27 04:26:23,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:23,482 INFO L225 Difference]: With dead ends: 174 [2021-08-27 04:26:23,482 INFO L226 Difference]: Without dead ends: 174 [2021-08-27 04:26:23,483 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 145.3ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-08-27 04:26:23,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-08-27 04:26:23,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 94. [2021-08-27 04:26:23,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 64 states have (on average 1.53125) internal successors, (98), 90 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:23,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2021-08-27 04:26:23,503 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 16 [2021-08-27 04:26:23,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:23,507 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2021-08-27 04:26:23,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:23,507 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2021-08-27 04:26:23,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 04:26:23,508 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:23,508 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:23,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 04:26:23,508 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr8REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-08-27 04:26:23,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:23,509 INFO L82 PathProgramCache]: Analyzing trace with hash 368361480, now seen corresponding path program 1 times [2021-08-27 04:26:23,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:23,509 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295807118] [2021-08-27 04:26:23,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:23,510 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:23,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:23,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:23,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:23,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295807118] [2021-08-27 04:26:23,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295807118] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:23,584 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:23,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 04:26:23,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523523864] [2021-08-27 04:26:23,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 04:26:23,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:23,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 04:26:23,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 04:26:23,587 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:23,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:23,838 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2021-08-27 04:26:23,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 04:26:23,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-08-27 04:26:23,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:23,840 INFO L225 Difference]: With dead ends: 93 [2021-08-27 04:26:23,840 INFO L226 Difference]: Without dead ends: 93 [2021-08-27 04:26:23,840 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 58.6ms TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-08-27 04:26:23,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-08-27 04:26:23,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-08-27 04:26:23,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.515625) internal successors, (97), 89 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:23,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2021-08-27 04:26:23,843 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 16 [2021-08-27 04:26:23,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:23,844 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2021-08-27 04:26:23,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:23,844 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2021-08-27 04:26:23,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 04:26:23,845 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:23,845 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:23,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 04:26:23,845 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-08-27 04:26:23,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:23,846 INFO L82 PathProgramCache]: Analyzing trace with hash 368361481, now seen corresponding path program 1 times [2021-08-27 04:26:23,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:23,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356142369] [2021-08-27 04:26:23,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:23,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:23,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:23,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:23,948 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356142369] [2021-08-27 04:26:23,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356142369] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:23,948 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:23,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 04:26:23,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103701714] [2021-08-27 04:26:23,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 04:26:23,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:23,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 04:26:23,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 04:26:23,951 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:24,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:24,200 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2021-08-27 04:26:24,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 04:26:24,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-08-27 04:26:24,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:24,201 INFO L225 Difference]: With dead ends: 89 [2021-08-27 04:26:24,202 INFO L226 Difference]: Without dead ends: 89 [2021-08-27 04:26:24,202 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 115.2ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-08-27 04:26:24,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-08-27 04:26:24,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2021-08-27 04:26:24,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 61 states have (on average 1.459016393442623) internal successors, (89), 81 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:24,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2021-08-27 04:26:24,204 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2021-08-27 04:26:24,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:24,209 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2021-08-27 04:26:24,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:24,210 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2021-08-27 04:26:24,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-27 04:26:24,210 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:24,210 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:24,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 04:26:24,211 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr18REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-08-27 04:26:24,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:24,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1672711574, now seen corresponding path program 1 times [2021-08-27 04:26:24,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:24,212 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137582152] [2021-08-27 04:26:24,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:24,212 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:24,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:24,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:24,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:24,310 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137582152] [2021-08-27 04:26:24,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137582152] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:24,310 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:24,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 04:26:24,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991873173] [2021-08-27 04:26:24,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:24,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:24,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:24,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:24,311 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:24,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:24,621 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2021-08-27 04:26:24,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 04:26:24,622 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-08-27 04:26:24,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:24,623 INFO L225 Difference]: With dead ends: 128 [2021-08-27 04:26:24,623 INFO L226 Difference]: Without dead ends: 128 [2021-08-27 04:26:24,623 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 119.1ms TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-08-27 04:26:24,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-08-27 04:26:24,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 87. [2021-08-27 04:26:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 83 states have internal predecessors, (92), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:24,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-08-27 04:26:24,627 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 17 [2021-08-27 04:26:24,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:24,627 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-08-27 04:26:24,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:24,627 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-08-27 04:26:24,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-27 04:26:24,628 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:24,628 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:24,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 04:26:24,628 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr19REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-08-27 04:26:24,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:24,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1672711573, now seen corresponding path program 1 times [2021-08-27 04:26:24,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:24,629 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135229137] [2021-08-27 04:26:24,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:24,629 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:24,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:24,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:24,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:24,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135229137] [2021-08-27 04:26:24,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135229137] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:24,795 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:24,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 04:26:24,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754935163] [2021-08-27 04:26:24,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:24,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:24,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:24,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:24,796 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:25,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:25,124 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2021-08-27 04:26:25,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 04:26:25,127 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-08-27 04:26:25,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:25,129 INFO L225 Difference]: With dead ends: 162 [2021-08-27 04:26:25,129 INFO L226 Difference]: Without dead ends: 162 [2021-08-27 04:26:25,130 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 137.2ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-27 04:26:25,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-08-27 04:26:25,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 99. [2021-08-27 04:26:25,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 95 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:25,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2021-08-27 04:26:25,135 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 17 [2021-08-27 04:26:25,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:25,135 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2021-08-27 04:26:25,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:25,136 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2021-08-27 04:26:25,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 04:26:25,136 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:25,136 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:25,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 04:26:25,137 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr22REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-08-27 04:26:25,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:25,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1539848306, now seen corresponding path program 1 times [2021-08-27 04:26:25,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:25,137 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333084428] [2021-08-27 04:26:25,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:25,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:25,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:25,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:25,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:25,264 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333084428] [2021-08-27 04:26:25,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333084428] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:25,265 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:25,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 04:26:25,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788207873] [2021-08-27 04:26:25,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 04:26:25,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:25,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 04:26:25,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-08-27 04:26:25,266 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:25,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:25,642 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2021-08-27 04:26:25,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 04:26:25,643 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 04:26:25,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:25,643 INFO L225 Difference]: With dead ends: 147 [2021-08-27 04:26:25,644 INFO L226 Difference]: Without dead ends: 147 [2021-08-27 04:26:25,644 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 174.3ms TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-08-27 04:26:25,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-08-27 04:26:25,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 99. [2021-08-27 04:26:25,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 95 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:25,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2021-08-27 04:26:25,647 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 20 [2021-08-27 04:26:25,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:25,647 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2021-08-27 04:26:25,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:25,647 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2021-08-27 04:26:25,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 04:26:25,648 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:25,648 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:25,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 04:26:25,648 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr23REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-08-27 04:26:25,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:25,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1539848305, now seen corresponding path program 1 times [2021-08-27 04:26:25,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:25,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231337887] [2021-08-27 04:26:25,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:25,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:25,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:25,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:25,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:25,817 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231337887] [2021-08-27 04:26:25,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231337887] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:25,817 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:25,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 04:26:25,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881041701] [2021-08-27 04:26:25,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:25,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:25,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:25,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:25,819 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:26,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:26,163 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2021-08-27 04:26:26,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 04:26:26,163 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 04:26:26,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:26,164 INFO L225 Difference]: With dead ends: 157 [2021-08-27 04:26:26,164 INFO L226 Difference]: Without dead ends: 157 [2021-08-27 04:26:26,165 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 149.5ms TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-08-27 04:26:26,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-08-27 04:26:26,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 99. [2021-08-27 04:26:26,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.44) internal successors, (108), 95 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:26,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2021-08-27 04:26:26,168 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 20 [2021-08-27 04:26:26,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:26,168 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2021-08-27 04:26:26,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:26,168 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2021-08-27 04:26:26,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 04:26:26,169 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:26,169 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:26,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 04:26:26,169 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr35REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-08-27 04:26:26,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:26,170 INFO L82 PathProgramCache]: Analyzing trace with hash -490672030, now seen corresponding path program 1 times [2021-08-27 04:26:26,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:26,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645643900] [2021-08-27 04:26:26,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:26,170 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:26,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:26,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:26,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:26,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645643900] [2021-08-27 04:26:26,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645643900] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:26,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:26,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 04:26:26,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466560094] [2021-08-27 04:26:26,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 04:26:26,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:26,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 04:26:26,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-27 04:26:26,255 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:26,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:26,500 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2021-08-27 04:26:26,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 04:26:26,500 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-08-27 04:26:26,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:26,501 INFO L225 Difference]: With dead ends: 136 [2021-08-27 04:26:26,501 INFO L226 Difference]: Without dead ends: 136 [2021-08-27 04:26:26,502 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 69.4ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-08-27 04:26:26,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-08-27 04:26:26,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 100. [2021-08-27 04:26:26,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 96 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2021-08-27 04:26:26,504 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 21 [2021-08-27 04:26:26,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:26,504 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2021-08-27 04:26:26,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:26,505 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2021-08-27 04:26:26,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 04:26:26,505 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:26,505 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:26,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 04:26:26,506 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr36REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-08-27 04:26:26,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:26,506 INFO L82 PathProgramCache]: Analyzing trace with hash -490672029, now seen corresponding path program 1 times [2021-08-27 04:26:26,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:26,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676021688] [2021-08-27 04:26:26,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:26,507 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:26,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:26,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:26,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676021688] [2021-08-27 04:26:26,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676021688] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:26,662 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:26,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 04:26:26,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763796946] [2021-08-27 04:26:26,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 04:26:26,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:26,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 04:26:26,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-08-27 04:26:26,664 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:27,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:27,100 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2021-08-27 04:26:27,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 04:26:27,101 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-08-27 04:26:27,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:27,101 INFO L225 Difference]: With dead ends: 147 [2021-08-27 04:26:27,101 INFO L226 Difference]: Without dead ends: 147 [2021-08-27 04:26:27,102 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 251.6ms TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2021-08-27 04:26:27,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-08-27 04:26:27,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 119. [2021-08-27 04:26:27,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 95 states have (on average 1.5052631578947369) internal successors, (143), 115 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:27,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2021-08-27 04:26:27,104 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 21 [2021-08-27 04:26:27,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:27,105 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2021-08-27 04:26:27,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:27,105 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2021-08-27 04:26:27,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 04:26:27,105 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:27,105 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:27,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 04:26:27,106 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr12ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-08-27 04:26:27,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:27,106 INFO L82 PathProgramCache]: Analyzing trace with hash 858132418, now seen corresponding path program 1 times [2021-08-27 04:26:27,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:27,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102305962] [2021-08-27 04:26:27,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:27,106 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:27,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:27,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:27,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:27,162 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102305962] [2021-08-27 04:26:27,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102305962] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:27,163 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:27,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 04:26:27,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541843529] [2021-08-27 04:26:27,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 04:26:27,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:27,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 04:26:27,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 04:26:27,164 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:27,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:27,329 INFO L93 Difference]: Finished difference Result 121 states and 148 transitions. [2021-08-27 04:26:27,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 04:26:27,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-08-27 04:26:27,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:27,331 INFO L225 Difference]: With dead ends: 121 [2021-08-27 04:26:27,331 INFO L226 Difference]: Without dead ends: 121 [2021-08-27 04:26:27,331 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 57.4ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-08-27 04:26:27,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-08-27 04:26:27,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2021-08-27 04:26:27,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 94 states have (on average 1.5) internal successors, (141), 113 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:27,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 144 transitions. [2021-08-27 04:26:27,334 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 144 transitions. Word has length 21 [2021-08-27 04:26:27,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:27,334 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 144 transitions. [2021-08-27 04:26:27,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:27,334 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 144 transitions. [2021-08-27 04:26:27,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 04:26:27,335 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:27,335 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:27,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 04:26:27,335 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr42ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-08-27 04:26:27,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:27,336 INFO L82 PathProgramCache]: Analyzing trace with hash 910586449, now seen corresponding path program 1 times [2021-08-27 04:26:27,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:27,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548814757] [2021-08-27 04:26:27,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:27,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:27,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:27,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:27,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:27,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548814757] [2021-08-27 04:26:27,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548814757] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:27,584 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:27,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 04:26:27,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253696653] [2021-08-27 04:26:27,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 04:26:27,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:27,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 04:26:27,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-08-27 04:26:27,588 INFO L87 Difference]: Start difference. First operand 117 states and 144 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:28,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:28,005 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2021-08-27 04:26:28,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 04:26:28,006 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 04:26:28,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:28,007 INFO L225 Difference]: With dead ends: 156 [2021-08-27 04:26:28,007 INFO L226 Difference]: Without dead ends: 156 [2021-08-27 04:26:28,007 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 233.9ms TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2021-08-27 04:26:28,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-08-27 04:26:28,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 118. [2021-08-27 04:26:28,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.4947368421052631) internal successors, (142), 114 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:28,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 145 transitions. [2021-08-27 04:26:28,010 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 145 transitions. Word has length 23 [2021-08-27 04:26:28,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:28,010 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 145 transitions. [2021-08-27 04:26:28,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 145 transitions. [2021-08-27 04:26:28,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 04:26:28,011 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:28,011 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:28,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 04:26:28,011 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr43ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-08-27 04:26:28,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:28,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1836590927, now seen corresponding path program 1 times [2021-08-27 04:26:28,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:28,011 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807691036] [2021-08-27 04:26:28,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:28,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:28,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:28,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:28,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:28,121 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807691036] [2021-08-27 04:26:28,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807691036] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:28,122 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:28,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 04:26:28,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688485729] [2021-08-27 04:26:28,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:28,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:28,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:28,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:28,123 INFO L87 Difference]: Start difference. First operand 118 states and 145 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:28,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:28,349 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2021-08-27 04:26:28,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 04:26:28,350 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-08-27 04:26:28,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:28,351 INFO L225 Difference]: With dead ends: 148 [2021-08-27 04:26:28,351 INFO L226 Difference]: Without dead ends: 148 [2021-08-27 04:26:28,351 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 88.3ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-08-27 04:26:28,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-08-27 04:26:28,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 119. [2021-08-27 04:26:28,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 115 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:28,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2021-08-27 04:26:28,354 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 24 [2021-08-27 04:26:28,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:28,354 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2021-08-27 04:26:28,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:28,355 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2021-08-27 04:26:28,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 04:26:28,355 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:28,355 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:28,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 04:26:28,356 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr30ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-08-27 04:26:28,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:28,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1392891139, now seen corresponding path program 1 times [2021-08-27 04:26:28,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:28,356 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315513393] [2021-08-27 04:26:28,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:28,357 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:28,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:28,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:28,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:28,555 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315513393] [2021-08-27 04:26:28,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315513393] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:28,556 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:28,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 04:26:28,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733484230] [2021-08-27 04:26:28,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 04:26:28,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:28,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 04:26:28,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-08-27 04:26:28,557 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:29,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:29,005 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2021-08-27 04:26:29,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 04:26:29,009 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-08-27 04:26:29,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:29,010 INFO L225 Difference]: With dead ends: 142 [2021-08-27 04:26:29,010 INFO L226 Difference]: Without dead ends: 142 [2021-08-27 04:26:29,010 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 268.7ms TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2021-08-27 04:26:29,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-08-27 04:26:29,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 119. [2021-08-27 04:26:29,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 96 states have (on average 1.4791666666666667) internal successors, (142), 115 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:29,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2021-08-27 04:26:29,014 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 24 [2021-08-27 04:26:29,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:29,014 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2021-08-27 04:26:29,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:29,014 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2021-08-27 04:26:29,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 04:26:29,015 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:29,015 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:29,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 04:26:29,015 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr39ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-08-27 04:26:29,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:29,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1099697949, now seen corresponding path program 1 times [2021-08-27 04:26:29,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:29,016 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768417374] [2021-08-27 04:26:29,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:29,017 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:29,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:29,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:29,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:29,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768417374] [2021-08-27 04:26:29,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768417374] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:29,112 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:29,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 04:26:29,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035328532] [2021-08-27 04:26:29,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:29,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:29,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:29,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:29,114 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:29,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:29,335 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2021-08-27 04:26:29,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 04:26:29,336 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 04:26:29,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:29,337 INFO L225 Difference]: With dead ends: 140 [2021-08-27 04:26:29,337 INFO L226 Difference]: Without dead ends: 140 [2021-08-27 04:26:29,337 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 79.6ms TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-08-27 04:26:29,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-08-27 04:26:29,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 121. [2021-08-27 04:26:29,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 98 states have (on average 1.469387755102041) internal successors, (144), 117 states have internal predecessors, (144), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:29,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2021-08-27 04:26:29,340 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 25 [2021-08-27 04:26:29,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:29,340 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2021-08-27 04:26:29,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:29,341 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2021-08-27 04:26:29,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 04:26:29,341 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:29,342 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:29,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 04:26:29,342 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr28REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-08-27 04:26:29,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:29,343 INFO L82 PathProgramCache]: Analyzing trace with hash -230324523, now seen corresponding path program 1 times [2021-08-27 04:26:29,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:29,343 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165488440] [2021-08-27 04:26:29,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:29,343 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:29,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:29,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:29,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:29,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165488440] [2021-08-27 04:26:29,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165488440] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:29,392 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:29,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 04:26:29,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441652372] [2021-08-27 04:26:29,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 04:26:29,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:29,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 04:26:29,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:29,393 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:29,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:29,546 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2021-08-27 04:26:29,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 04:26:29,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 04:26:29,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:29,550 INFO L225 Difference]: With dead ends: 122 [2021-08-27 04:26:29,550 INFO L226 Difference]: Without dead ends: 122 [2021-08-27 04:26:29,550 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.8ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-27 04:26:29,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-08-27 04:26:29,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2021-08-27 04:26:29,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.4387755102040816) internal successors, (141), 116 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 144 transitions. [2021-08-27 04:26:29,555 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 144 transitions. Word has length 25 [2021-08-27 04:26:29,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:29,555 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 144 transitions. [2021-08-27 04:26:29,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:29,555 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 144 transitions. [2021-08-27 04:26:29,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 04:26:29,556 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:29,557 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:29,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 04:26:29,557 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr29REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-08-27 04:26:29,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:29,557 INFO L82 PathProgramCache]: Analyzing trace with hash -230324522, now seen corresponding path program 1 times [2021-08-27 04:26:29,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:29,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020100479] [2021-08-27 04:26:29,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:29,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:29,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:29,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:29,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:29,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020100479] [2021-08-27 04:26:29,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020100479] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:29,724 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:29,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 04:26:29,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556678021] [2021-08-27 04:26:29,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 04:26:29,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:29,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 04:26:29,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-08-27 04:26:29,726 INFO L87 Difference]: Start difference. First operand 120 states and 144 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:30,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:30,111 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2021-08-27 04:26:30,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 04:26:30,111 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 04:26:30,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:30,112 INFO L225 Difference]: With dead ends: 140 [2021-08-27 04:26:30,112 INFO L226 Difference]: Without dead ends: 140 [2021-08-27 04:26:30,112 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 203.2ms TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2021-08-27 04:26:30,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-08-27 04:26:30,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 120. [2021-08-27 04:26:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 116 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:30,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 143 transitions. [2021-08-27 04:26:30,115 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 143 transitions. Word has length 25 [2021-08-27 04:26:30,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:30,115 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 143 transitions. [2021-08-27 04:26:30,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:30,115 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 143 transitions. [2021-08-27 04:26:30,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 04:26:30,115 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:30,115 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:30,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 04:26:30,116 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr17ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-08-27 04:26:30,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:30,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1584254843, now seen corresponding path program 1 times [2021-08-27 04:26:30,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:30,116 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648121379] [2021-08-27 04:26:30,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:30,116 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:30,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:30,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:30,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:30,152 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648121379] [2021-08-27 04:26:30,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648121379] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:30,152 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:30,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 04:26:30,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266987655] [2021-08-27 04:26:30,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:30,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:30,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:30,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:30,155 INFO L87 Difference]: Start difference. First operand 120 states and 143 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:30,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:30,234 INFO L93 Difference]: Finished difference Result 187 states and 215 transitions. [2021-08-27 04:26:30,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:30,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 04:26:30,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:30,236 INFO L225 Difference]: With dead ends: 187 [2021-08-27 04:26:30,236 INFO L226 Difference]: Without dead ends: 187 [2021-08-27 04:26:30,236 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:30,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-08-27 04:26:30,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 133. [2021-08-27 04:26:30,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.3963963963963963) internal successors, (155), 129 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 158 transitions. [2021-08-27 04:26:30,239 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 158 transitions. Word has length 25 [2021-08-27 04:26:30,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:30,239 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 158 transitions. [2021-08-27 04:26:30,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:30,240 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 158 transitions. [2021-08-27 04:26:30,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 04:26:30,240 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:30,240 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:30,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-27 04:26:30,241 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr45ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-08-27 04:26:30,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:30,241 INFO L82 PathProgramCache]: Analyzing trace with hash 267685108, now seen corresponding path program 1 times [2021-08-27 04:26:30,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:30,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935091109] [2021-08-27 04:26:30,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:30,242 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:30,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:30,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:30,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:30,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935091109] [2021-08-27 04:26:30,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935091109] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:30,428 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:30,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 04:26:30,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278613345] [2021-08-27 04:26:30,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 04:26:30,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:30,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 04:26:30,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-27 04:26:30,430 INFO L87 Difference]: Start difference. First operand 133 states and 158 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:30,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:30,749 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2021-08-27 04:26:30,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 04:26:30,750 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-08-27 04:26:30,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:30,750 INFO L225 Difference]: With dead ends: 151 [2021-08-27 04:26:30,751 INFO L226 Difference]: Without dead ends: 151 [2021-08-27 04:26:30,751 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 170.0ms TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-08-27 04:26:30,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-08-27 04:26:30,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2021-08-27 04:26:30,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.3873873873873874) internal successors, (154), 129 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:30,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 157 transitions. [2021-08-27 04:26:30,754 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 157 transitions. Word has length 26 [2021-08-27 04:26:30,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:30,754 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 157 transitions. [2021-08-27 04:26:30,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:30,754 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 157 transitions. [2021-08-27 04:26:30,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 04:26:30,755 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:30,755 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:30,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-27 04:26:30,755 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr30ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 41 more)] === [2021-08-27 04:26:30,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:30,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1759981751, now seen corresponding path program 1 times [2021-08-27 04:26:30,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:30,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942551356] [2021-08-27 04:26:30,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:30,756 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 04:26:30,766 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 04:26:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 04:26:30,801 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 04:26:30,801 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 04:26:30,802 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr30ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:30,803 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 04:26:30,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 04:26:30,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-08-27 04:26:30,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-08-27 04:26:30,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-08-27 04:26:30,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-08-27 04:26:30,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-08-27 04:26:30,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-08-27 04:26:30,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-08-27 04:26:30,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-08-27 04:26:30,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-08-27 04:26:30,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-08-27 04:26:30,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:30,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-08-27 04:26:30,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-08-27 04:26:30,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-08-27 04:26:30,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-08-27 04:26:30,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:30,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-08-27 04:26:30,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-08-27 04:26:30,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-08-27 04:26:30,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-08-27 04:26:30,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-08-27 04:26:30,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-08-27 04:26:30,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-08-27 04:26:30,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-08-27 04:26:30,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION [2021-08-27 04:26:30,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-08-27 04:26:30,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-08-27 04:26:30,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-08-27 04:26:30,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-08-27 04:26:30,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION [2021-08-27 04:26:30,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-08-27 04:26:30,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-08-27 04:26:30,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-08-27 04:26:30,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-08-27 04:26:30,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-08-27 04:26:30,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-08-27 04:26:30,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:30,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:30,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:30,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:30,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:30,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:30,808 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:30,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-27 04:26:30,813 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 04:26:30,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 04:26:30 BoogieIcfgContainer [2021-08-27 04:26:30,836 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 04:26:30,836 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 04:26:30,837 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 04:26:30,837 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 04:26:30,837 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:21" (3/4) ... [2021-08-27 04:26:30,839 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-27 04:26:30,869 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 04:26:30,870 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 04:26:30,871 INFO L168 Benchmark]: Toolchain (without parser) took 11169.53 ms. Allocated memory was 58.7 MB in the beginning and 205.5 MB in the end (delta: 146.8 MB). Free memory was 36.3 MB in the beginning and 139.5 MB in the end (delta: -103.2 MB). Peak memory consumption was 44.6 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:30,871 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 58.7 MB. Free memory was 40.8 MB in the beginning and 40.8 MB in the end (delta: 43.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 04:26:30,872 INFO L168 Benchmark]: CACSL2BoogieTranslator took 466.02 ms. Allocated memory is still 58.7 MB. Free memory was 36.1 MB in the beginning and 35.8 MB in the end (delta: 341.8 kB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:30,872 INFO L168 Benchmark]: Boogie Preprocessor took 90.98 ms. Allocated memory is still 58.7 MB. Free memory was 35.8 MB in the beginning and 33.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:30,872 INFO L168 Benchmark]: RCFGBuilder took 938.49 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 33.0 MB in the beginning and 48.8 MB in the end (delta: -15.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:30,873 INFO L168 Benchmark]: TraceAbstraction took 9632.36 ms. Allocated memory was 71.3 MB in the beginning and 205.5 MB in the end (delta: 134.2 MB). Free memory was 48.4 MB in the beginning and 142.7 MB in the end (delta: -94.3 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:30,875 INFO L168 Benchmark]: Witness Printer took 33.38 ms. Allocated memory is still 205.5 MB. Free memory was 142.7 MB in the beginning and 139.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:30,877 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.15 ms. Allocated memory is still 58.7 MB. Free memory was 40.8 MB in the beginning and 40.8 MB in the end (delta: 43.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 466.02 ms. Allocated memory is still 58.7 MB. Free memory was 36.1 MB in the beginning and 35.8 MB in the end (delta: 341.8 kB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 90.98 ms. Allocated memory is still 58.7 MB. Free memory was 35.8 MB in the beginning and 33.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 938.49 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 33.0 MB in the beginning and 48.8 MB in the end (delta: -15.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9632.36 ms. Allocated memory was 71.3 MB in the beginning and 205.5 MB in the end (delta: 134.2 MB). Free memory was 48.4 MB in the beginning and 142.7 MB in the end (delta: -94.3 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.1 GB. * Witness Printer took 33.38 ms. Allocated memory is still 205.5 MB. Free memory was 142.7 MB in the beginning and 139.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1032]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L996] SLL* head = malloc(sizeof(SLL)); [L997] head->next = head VAL [head={-1:0}] [L998] head->data = 0 VAL [head={-1:0}] [L1000] SLL* x = head; [L1001] int state = 1; VAL [head={-1:0}, state=1, x={-1:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1025] x->data = state VAL [head={-1:0}, state=1, x={-1:0}] [L1027] EXPR head->next VAL [head={-1:0}, head->next={-1:0}, state=1, x={-1:0}] [L1027] x = head->next [L1028] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, state=1, x={-1:0}] [L1030] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1] [L1030] COND TRUE x->data != 0 [L1032] EXPR x->next VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}] [L1032] EXPR x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1] [L1032] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1032] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1032] EXPR x->next VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1032] EXPR x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1032] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=0] [L1032] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1032] reach_error() VAL [head={-1:0}, state=1, x={-1:0}] - UnprovableResult [Line: 997]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 997]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1025]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1025]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 993]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 110 locations, 46 error locations. Started 1 CEGAR loops. OverallTime: 9564.7ms, OverallIterations: 23, TraceHistogramMax: 1, EmptinessCheckTime: 21.5ms, AutomataDifference: 6368.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1414 SDtfs, 3580 SDslu, 4386 SDs, 0 SdLazy, 6077 SolverSat, 298 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3590.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 298 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 2536.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=21, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 103.7ms AutomataMinimizationTime, 22 MinimizatonAttempts, 610 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 33.7ms SsaConstructionTime, 191.9ms SatisfiabilityAnalysisTime, 2495.4ms InterpolantComputationTime, 448 NumberOfCodeBlocks, 448 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 398 ConstructedInterpolants, 0 QuantifiedInterpolants, 3744 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-27 04:26:30,921 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...