./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/lockfree-3.3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/memsafety/lockfree-3.3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39b25c4e2cc4769f7c060343bf6a1efac7abb2b9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/memsafety/lockfree-3.3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39b25c4e2cc4769f7c060343bf6a1efac7abb2b9 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 05:22:05,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 05:22:05,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 05:22:05,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 05:22:05,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 05:22:05,192 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 05:22:05,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 05:22:05,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 05:22:05,201 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 05:22:05,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 05:22:05,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 05:22:05,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 05:22:05,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 05:22:05,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 05:22:05,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 05:22:05,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 05:22:05,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 05:22:05,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 05:22:05,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 05:22:05,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 05:22:05,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 05:22:05,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 05:22:05,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 05:22:05,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 05:22:05,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 05:22:05,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 05:22:05,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 05:22:05,227 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 05:22:05,227 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 05:22:05,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 05:22:05,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 05:22:05,228 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 05:22:05,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 05:22:05,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 05:22:05,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 05:22:05,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 05:22:05,231 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 05:22:05,231 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 05:22:05,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 05:22:05,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 05:22:05,233 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 05:22:05,236 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-27 05:22:05,262 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 05:22:05,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 05:22:05,263 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 05:22:05,263 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 05:22:05,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 05:22:05,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 05:22:05,264 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 05:22:05,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 05:22:05,265 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 05:22:05,265 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 05:22:05,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 05:22:05,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 05:22:05,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 05:22:05,266 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 05:22:05,266 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 05:22:05,266 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 05:22:05,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 05:22:05,266 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 05:22:05,266 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 05:22:05,267 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 05:22:05,267 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 05:22:05,267 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 05:22:05,267 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 05:22:05,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 05:22:05,267 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 05:22:05,268 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 05:22:05,268 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 05:22:05,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 05:22:05,268 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 05:22:05,268 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 39b25c4e2cc4769f7c060343bf6a1efac7abb2b9 [2021-08-27 05:22:05,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 05:22:05,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 05:22:05,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 05:22:05,527 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 05:22:05,528 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 05:22:05,528 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.3.i [2021-08-27 05:22:05,583 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32d095bd9/c40ed49f358e46d0ab407a45250ab771/FLAG6a6b3ac37 [2021-08-27 05:22:05,971 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 05:22:05,971 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.3.i [2021-08-27 05:22:05,983 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32d095bd9/c40ed49f358e46d0ab407a45250ab771/FLAG6a6b3ac37 [2021-08-27 05:22:05,994 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32d095bd9/c40ed49f358e46d0ab407a45250ab771 [2021-08-27 05:22:05,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 05:22:05,998 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 05:22:05,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 05:22:05,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 05:22:06,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 05:22:06,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:22:05" (1/1) ... [2021-08-27 05:22:06,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70b652df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:22:06, skipping insertion in model container [2021-08-27 05:22:06,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:22:05" (1/1) ... [2021-08-27 05:22:06,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 05:22:06,049 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 05:22:06,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 05:22:06,308 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 05:22:06,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 05:22:06,362 INFO L208 MainTranslator]: Completed translation [2021-08-27 05:22:06,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:22:06 WrapperNode [2021-08-27 05:22:06,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 05:22:06,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 05:22:06,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 05:22:06,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 05:22:06,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:22:06" (1/1) ... [2021-08-27 05:22:06,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:22:06" (1/1) ... [2021-08-27 05:22:06,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:22:06" (1/1) ... [2021-08-27 05:22:06,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:22:06" (1/1) ... [2021-08-27 05:22:06,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:22:06" (1/1) ... [2021-08-27 05:22:06,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:22:06" (1/1) ... [2021-08-27 05:22:06,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:22:06" (1/1) ... [2021-08-27 05:22:06,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 05:22:06,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 05:22:06,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 05:22:06,425 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 05:22:06,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:22:06" (1/1) ... [2021-08-27 05:22:06,430 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 05:22:06,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:22:06,445 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 05:22:06,483 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 05:22:06,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 05:22:06,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 05:22:06,501 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 05:22:06,502 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-27 05:22:06,502 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-27 05:22:06,502 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2021-08-27 05:22:06,502 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2021-08-27 05:22:06,502 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2021-08-27 05:22:06,503 INFO L138 BoogieDeclarations]: Found implementation of procedure push [2021-08-27 05:22:06,503 INFO L138 BoogieDeclarations]: Found implementation of procedure pop [2021-08-27 05:22:06,503 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 05:22:06,503 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 05:22:06,504 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 05:22:06,504 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 05:22:06,504 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 05:22:06,504 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 05:22:06,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 05:22:06,504 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 05:22:06,504 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 05:22:06,505 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 05:22:06,505 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 05:22:06,505 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 05:22:06,505 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 05:22:06,505 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 05:22:06,505 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 05:22:06,505 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 05:22:06,505 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 05:22:06,506 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 05:22:06,506 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 05:22:06,506 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 05:22:06,506 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 05:22:06,506 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 05:22:06,506 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 05:22:06,506 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-27 05:22:06,507 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-27 05:22:06,507 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2021-08-27 05:22:06,507 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2021-08-27 05:22:06,507 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2021-08-27 05:22:06,507 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 05:22:06,507 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 05:22:06,507 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 05:22:06,507 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 05:22:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 05:22:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 05:22:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 05:22:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 05:22:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 05:22:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 05:22:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 05:22:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 05:22:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 05:22:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 05:22:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 05:22:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 05:22:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 05:22:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 05:22:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 05:22:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 05:22:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 05:22:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 05:22:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 05:22:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 05:22:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 05:22:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 05:22:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 05:22:06,512 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 05:22:06,512 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 05:22:06,512 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 05:22:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 05:22:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 05:22:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 05:22:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 05:22:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 05:22:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 05:22:06,520 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 05:22:06,520 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 05:22:06,520 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 05:22:06,520 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 05:22:06,521 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 05:22:06,521 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 05:22:06,521 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 05:22:06,522 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 05:22:06,522 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 05:22:06,522 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 05:22:06,522 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 05:22:06,522 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 05:22:06,522 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 05:22:06,522 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 05:22:06,523 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 05:22:06,523 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 05:22:06,523 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 05:22:06,523 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 05:22:06,523 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 05:22:06,523 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 05:22:06,523 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 05:22:06,524 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 05:22:06,524 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 05:22:06,524 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 05:22:06,524 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 05:22:06,524 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 05:22:06,524 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 05:22:06,524 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 05:22:06,525 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 05:22:06,525 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 05:22:06,525 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 05:22:06,525 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 05:22:06,525 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 05:22:06,526 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 05:22:06,526 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 05:22:06,526 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 05:22:06,526 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 05:22:06,526 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 05:22:06,527 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 05:22:06,527 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 05:22:06,527 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 05:22:06,527 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 05:22:06,528 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 05:22:06,528 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 05:22:06,528 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 05:22:06,528 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 05:22:06,528 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 05:22:06,528 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 05:22:06,528 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 05:22:06,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 05:22:06,529 INFO L130 BoogieDeclarations]: Found specification of procedure push [2021-08-27 05:22:06,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 05:22:06,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 05:22:06,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 05:22:06,530 INFO L130 BoogieDeclarations]: Found specification of procedure pop [2021-08-27 05:22:06,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 05:22:06,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 05:22:06,532 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 05:22:06,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 05:22:06,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 05:22:06,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 05:22:06,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 05:22:06,986 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 05:22:06,987 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-08-27 05:22:06,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:22:06 BoogieIcfgContainer [2021-08-27 05:22:06,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 05:22:06,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 05:22:06,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 05:22:06,991 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 05:22:06,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 05:22:05" (1/3) ... [2021-08-27 05:22:06,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511646a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 05:22:06, skipping insertion in model container [2021-08-27 05:22:06,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:22:06" (2/3) ... [2021-08-27 05:22:06,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511646a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 05:22:06, skipping insertion in model container [2021-08-27 05:22:06,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:22:06" (3/3) ... [2021-08-27 05:22:06,993 INFO L111 eAbstractionObserver]: Analyzing ICFG lockfree-3.3.i [2021-08-27 05:22:06,996 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 05:22:06,997 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2021-08-27 05:22:07,022 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 05:22:07,030 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 05:22:07,031 INFO L340 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2021-08-27 05:22:07,042 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 67 states have internal predecessors, (85), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 05:22:07,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-27 05:22:07,047 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:07,047 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:07,047 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:07,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:07,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1846299228, now seen corresponding path program 1 times [2021-08-27 05:22:07,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:07,057 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116632268] [2021-08-27 05:22:07,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:07,057 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:07,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:07,271 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 05:22:07,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:07,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116632268] [2021-08-27 05:22:07,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116632268] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:22:07,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:22:07,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 05:22:07,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896216367] [2021-08-27 05:22:07,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 05:22:07,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:07,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 05:22:07,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:22:07,290 INFO L87 Difference]: Start difference. First operand has 74 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 67 states have internal predecessors, (85), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 05:22:07,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:07,497 INFO L93 Difference]: Finished difference Result 92 states and 115 transitions. [2021-08-27 05:22:07,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 05:22:07,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 8 [2021-08-27 05:22:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:07,506 INFO L225 Difference]: With dead ends: 92 [2021-08-27 05:22:07,506 INFO L226 Difference]: Without dead ends: 89 [2021-08-27 05:22:07,508 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 83.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:22:07,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-08-27 05:22:07,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2021-08-27 05:22:07,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.8409090909090908) internal successors, (81), 65 states have internal predecessors, (81), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:22:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2021-08-27 05:22:07,540 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 8 [2021-08-27 05:22:07,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:07,540 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2021-08-27 05:22:07,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 05:22:07,540 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2021-08-27 05:22:07,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 05:22:07,541 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:07,541 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:07,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 05:22:07,542 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:07,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:07,542 INFO L82 PathProgramCache]: Analyzing trace with hash 451849005, now seen corresponding path program 1 times [2021-08-27 05:22:07,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:07,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155929839] [2021-08-27 05:22:07,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:07,543 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:07,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:07,652 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 05:22:07,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:07,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155929839] [2021-08-27 05:22:07,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155929839] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:22:07,652 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:22:07,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 05:22:07,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102872652] [2021-08-27 05:22:07,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:22:07,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:07,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:22:07,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:22:07,654 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 05:22:07,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:07,861 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2021-08-27 05:22:07,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 05:22:07,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 10 [2021-08-27 05:22:07,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:07,864 INFO L225 Difference]: With dead ends: 91 [2021-08-27 05:22:07,865 INFO L226 Difference]: Without dead ends: 91 [2021-08-27 05:22:07,865 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 90.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 05:22:07,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-08-27 05:22:07,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 72. [2021-08-27 05:22:07,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 66 states have internal predecessors, (82), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:22:07,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2021-08-27 05:22:07,877 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 10 [2021-08-27 05:22:07,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:07,877 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2021-08-27 05:22:07,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 05:22:07,877 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2021-08-27 05:22:07,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 05:22:07,878 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:07,878 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:07,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 05:22:07,878 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:07,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:07,878 INFO L82 PathProgramCache]: Analyzing trace with hash 451908587, now seen corresponding path program 1 times [2021-08-27 05:22:07,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:07,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134120986] [2021-08-27 05:22:07,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:07,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:08,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:08,034 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 05:22:08,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:08,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134120986] [2021-08-27 05:22:08,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134120986] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:22:08,038 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:22:08,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 05:22:08,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959381428] [2021-08-27 05:22:08,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:22:08,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:08,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:22:08,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:22:08,040 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 05:22:08,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:08,256 INFO L93 Difference]: Finished difference Result 135 states and 176 transitions. [2021-08-27 05:22:08,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 05:22:08,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 10 [2021-08-27 05:22:08,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:08,258 INFO L225 Difference]: With dead ends: 135 [2021-08-27 05:22:08,258 INFO L226 Difference]: Without dead ends: 135 [2021-08-27 05:22:08,258 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 108.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 05:22:08,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-08-27 05:22:08,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 108. [2021-08-27 05:22:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.8311688311688312) internal successors, (141), 99 states have internal predecessors, (141), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2021-08-27 05:22:08,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2021-08-27 05:22:08,263 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 10 [2021-08-27 05:22:08,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:08,264 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2021-08-27 05:22:08,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 05:22:08,264 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2021-08-27 05:22:08,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 05:22:08,264 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:08,264 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:08,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 05:22:08,264 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:08,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:08,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1124262917, now seen corresponding path program 1 times [2021-08-27 05:22:08,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:08,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713120498] [2021-08-27 05:22:08,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:08,265 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:08,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:08,345 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 05:22:08,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:08,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713120498] [2021-08-27 05:22:08,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713120498] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:22:08,346 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:22:08,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 05:22:08,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356406751] [2021-08-27 05:22:08,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:22:08,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:08,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:22:08,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:22:08,347 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 05:22:08,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:08,512 INFO L93 Difference]: Finished difference Result 149 states and 214 transitions. [2021-08-27 05:22:08,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 05:22:08,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 11 [2021-08-27 05:22:08,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:08,518 INFO L225 Difference]: With dead ends: 149 [2021-08-27 05:22:08,518 INFO L226 Difference]: Without dead ends: 144 [2021-08-27 05:22:08,519 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:22:08,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-08-27 05:22:08,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 126. [2021-08-27 05:22:08,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 89 states have (on average 1.7752808988764044) internal successors, (158), 115 states have internal predecessors, (158), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (15), 5 states have call predecessors, (15), 9 states have call successors, (15) [2021-08-27 05:22:08,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 183 transitions. [2021-08-27 05:22:08,541 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 183 transitions. Word has length 11 [2021-08-27 05:22:08,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:08,541 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 183 transitions. [2021-08-27 05:22:08,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 05:22:08,541 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 183 transitions. [2021-08-27 05:22:08,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 05:22:08,541 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:08,542 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:08,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 05:22:08,542 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting pushErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:08,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:08,542 INFO L82 PathProgramCache]: Analyzing trace with hash 649350680, now seen corresponding path program 1 times [2021-08-27 05:22:08,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:08,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274116005] [2021-08-27 05:22:08,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:08,543 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:08,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:08,634 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 05:22:08,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:08,635 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274116005] [2021-08-27 05:22:08,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274116005] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:22:08,635 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:22:08,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 05:22:08,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985912389] [2021-08-27 05:22:08,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 05:22:08,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:08,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 05:22:08,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 05:22:08,636 INFO L87 Difference]: Start difference. First operand 126 states and 183 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:22:08,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:08,916 INFO L93 Difference]: Finished difference Result 197 states and 286 transitions. [2021-08-27 05:22:08,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 05:22:08,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-08-27 05:22:08,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:08,918 INFO L225 Difference]: With dead ends: 197 [2021-08-27 05:22:08,918 INFO L226 Difference]: Without dead ends: 197 [2021-08-27 05:22:08,919 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 153.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:22:08,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-08-27 05:22:08,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 166. [2021-08-27 05:22:08,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 125 states have (on average 1.752) internal successors, (219), 151 states have internal predecessors, (219), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (20), 7 states have call predecessors, (20), 11 states have call successors, (20) [2021-08-27 05:22:08,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 251 transitions. [2021-08-27 05:22:08,927 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 251 transitions. Word has length 13 [2021-08-27 05:22:08,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:08,928 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 251 transitions. [2021-08-27 05:22:08,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:22:08,928 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 251 transitions. [2021-08-27 05:22:08,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 05:22:08,929 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:08,929 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:08,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 05:22:08,929 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting pushErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:08,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:08,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1870609254, now seen corresponding path program 1 times [2021-08-27 05:22:08,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:08,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112608476] [2021-08-27 05:22:08,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:08,930 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:08,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:08,989 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 05:22:08,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:08,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112608476] [2021-08-27 05:22:08,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112608476] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:22:08,990 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:22:08,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 05:22:08,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289887917] [2021-08-27 05:22:08,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:22:08,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:08,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:22:08,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:22:08,991 INFO L87 Difference]: Start difference. First operand 166 states and 251 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:22:09,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:09,269 INFO L93 Difference]: Finished difference Result 260 states and 393 transitions. [2021-08-27 05:22:09,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 05:22:09,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-08-27 05:22:09,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:09,270 INFO L225 Difference]: With dead ends: 260 [2021-08-27 05:22:09,270 INFO L226 Difference]: Without dead ends: 260 [2021-08-27 05:22:09,271 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 82.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 05:22:09,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-08-27 05:22:09,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 233. [2021-08-27 05:22:09,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 186 states have (on average 1.7258064516129032) internal successors, (321), 212 states have internal predecessors, (321), 16 states have call successors, (16), 12 states have call predecessors, (16), 13 states have return successors, (29), 9 states have call predecessors, (29), 15 states have call successors, (29) [2021-08-27 05:22:09,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 366 transitions. [2021-08-27 05:22:09,279 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 366 transitions. Word has length 13 [2021-08-27 05:22:09,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:09,279 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 366 transitions. [2021-08-27 05:22:09,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:22:09,279 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 366 transitions. [2021-08-27 05:22:09,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 05:22:09,279 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:09,280 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:09,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 05:22:09,280 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting pushErr1REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:09,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:09,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1870609253, now seen corresponding path program 1 times [2021-08-27 05:22:09,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:09,280 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850979313] [2021-08-27 05:22:09,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:09,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:09,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:09,353 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 05:22:09,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:09,354 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850979313] [2021-08-27 05:22:09,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850979313] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:22:09,354 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:22:09,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 05:22:09,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517666330] [2021-08-27 05:22:09,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:22:09,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:09,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:22:09,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:22:09,355 INFO L87 Difference]: Start difference. First operand 233 states and 366 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:22:09,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:09,616 INFO L93 Difference]: Finished difference Result 311 states and 476 transitions. [2021-08-27 05:22:09,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 05:22:09,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-08-27 05:22:09,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:09,625 INFO L225 Difference]: With dead ends: 311 [2021-08-27 05:22:09,626 INFO L226 Difference]: Without dead ends: 311 [2021-08-27 05:22:09,626 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 79.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 05:22:09,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2021-08-27 05:22:09,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 287. [2021-08-27 05:22:09,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 238 states have (on average 1.7016806722689075) internal successors, (405), 262 states have internal predecessors, (405), 16 states have call successors, (16), 16 states have call predecessors, (16), 17 states have return successors, (29), 9 states have call predecessors, (29), 15 states have call successors, (29) [2021-08-27 05:22:09,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 450 transitions. [2021-08-27 05:22:09,643 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 450 transitions. Word has length 13 [2021-08-27 05:22:09,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:09,644 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 450 transitions. [2021-08-27 05:22:09,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:22:09,644 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 450 transitions. [2021-08-27 05:22:09,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-27 05:22:09,645 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:09,645 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:09,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 05:22:09,645 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting pushErr4REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:09,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:09,646 INFO L82 PathProgramCache]: Analyzing trace with hash 2140662271, now seen corresponding path program 1 times [2021-08-27 05:22:09,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:09,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44577357] [2021-08-27 05:22:09,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:09,647 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:09,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:09,732 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 05:22:09,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:09,733 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44577357] [2021-08-27 05:22:09,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44577357] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:22:09,733 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:22:09,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 05:22:09,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904245449] [2021-08-27 05:22:09,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 05:22:09,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:09,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 05:22:09,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 05:22:09,734 INFO L87 Difference]: Start difference. First operand 287 states and 450 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:22:09,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:09,918 INFO L93 Difference]: Finished difference Result 275 states and 400 transitions. [2021-08-27 05:22:09,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 05:22:09,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-08-27 05:22:09,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:09,921 INFO L225 Difference]: With dead ends: 275 [2021-08-27 05:22:09,921 INFO L226 Difference]: Without dead ends: 275 [2021-08-27 05:22:09,921 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 85.4ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 05:22:09,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-08-27 05:22:09,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 238. [2021-08-27 05:22:09,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 197 states have (on average 1.649746192893401) internal successors, (325), 215 states have internal predecessors, (325), 14 states have call successors, (14), 14 states have call predecessors, (14), 15 states have return successors, (23), 9 states have call predecessors, (23), 13 states have call successors, (23) [2021-08-27 05:22:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 362 transitions. [2021-08-27 05:22:09,927 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 362 transitions. Word has length 14 [2021-08-27 05:22:09,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:09,927 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 362 transitions. [2021-08-27 05:22:09,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:22:09,927 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 362 transitions. [2021-08-27 05:22:09,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 05:22:09,931 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:09,931 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:09,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 05:22:09,932 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:09,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:09,932 INFO L82 PathProgramCache]: Analyzing trace with hash 406451957, now seen corresponding path program 1 times [2021-08-27 05:22:09,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:09,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746574578] [2021-08-27 05:22:09,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:09,932 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:09,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:10,005 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 05:22:10,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:10,005 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746574578] [2021-08-27 05:22:10,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746574578] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 05:22:10,006 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:22:10,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 05:22:10,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154797641] [2021-08-27 05:22:10,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 05:22:10,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:10,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 05:22:10,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 05:22:10,007 INFO L87 Difference]: Start difference. First operand 238 states and 362 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:22:10,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:10,233 INFO L93 Difference]: Finished difference Result 439 states and 619 transitions. [2021-08-27 05:22:10,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 05:22:10,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-27 05:22:10,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:10,242 INFO L225 Difference]: With dead ends: 439 [2021-08-27 05:22:10,242 INFO L226 Difference]: Without dead ends: 439 [2021-08-27 05:22:10,243 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 100.4ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 05:22:10,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2021-08-27 05:22:10,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 409. [2021-08-27 05:22:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 334 states have (on average 1.5089820359281436) internal successors, (504), 366 states have internal predecessors, (504), 26 states have call successors, (26), 26 states have call predecessors, (26), 37 states have return successors, (55), 17 states have call predecessors, (55), 25 states have call successors, (55) [2021-08-27 05:22:10,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 585 transitions. [2021-08-27 05:22:10,253 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 585 transitions. Word has length 15 [2021-08-27 05:22:10,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:10,253 INFO L470 AbstractCegarLoop]: Abstraction has 409 states and 585 transitions. [2021-08-27 05:22:10,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:22:10,254 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 585 transitions. [2021-08-27 05:22:10,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 05:22:10,254 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:10,254 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:10,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 05:22:10,255 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:10,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:10,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1475656894, now seen corresponding path program 1 times [2021-08-27 05:22:10,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:10,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091312171] [2021-08-27 05:22:10,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:10,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:10,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:10,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:22:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:22:10,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:10,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091312171] [2021-08-27 05:22:10,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091312171] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:10,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838803039] [2021-08-27 05:22:10,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:10,434 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:22:10,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:22:10,445 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:22:10,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-27 05:22:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:10,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 05:22:10,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:22:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:22:10,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838803039] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:10,792 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:22:10,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-08-27 05:22:10,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105556972] [2021-08-27 05:22:10,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 05:22:10,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:10,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 05:22:10,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-08-27 05:22:10,793 INFO L87 Difference]: Start difference. First operand 409 states and 585 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 05:22:11,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:11,500 INFO L93 Difference]: Finished difference Result 491 states and 695 transitions. [2021-08-27 05:22:11,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 05:22:11,501 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 22 [2021-08-27 05:22:11,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:11,503 INFO L225 Difference]: With dead ends: 491 [2021-08-27 05:22:11,503 INFO L226 Difference]: Without dead ends: 491 [2021-08-27 05:22:11,503 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 365.0ms TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2021-08-27 05:22:11,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2021-08-27 05:22:11,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 425. [2021-08-27 05:22:11,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 340 states have (on average 1.4764705882352942) internal successors, (502), 382 states have internal predecessors, (502), 26 states have call successors, (26), 26 states have call predecessors, (26), 47 states have return successors, (65), 17 states have call predecessors, (65), 25 states have call successors, (65) [2021-08-27 05:22:11,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 593 transitions. [2021-08-27 05:22:11,514 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 593 transitions. Word has length 22 [2021-08-27 05:22:11,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:11,514 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 593 transitions. [2021-08-27 05:22:11,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 05:22:11,514 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 593 transitions. [2021-08-27 05:22:11,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 05:22:11,515 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:11,515 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:11,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-27 05:22:11,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-08-27 05:22:11,729 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:11,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:11,729 INFO L82 PathProgramCache]: Analyzing trace with hash -2086418946, now seen corresponding path program 1 times [2021-08-27 05:22:11,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:11,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887305021] [2021-08-27 05:22:11,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:11,730 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:11,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:11,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:22:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:11,874 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:22:11,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:11,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887305021] [2021-08-27 05:22:11,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887305021] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:11,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110281702] [2021-08-27 05:22:11,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:11,875 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:22:11,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:22:11,876 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:22:11,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-27 05:22:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:12,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-27 05:22:12,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:22:12,137 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:22:12,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110281702] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:12,137 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:22:12,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-08-27 05:22:12,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201752201] [2021-08-27 05:22:12,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 05:22:12,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:12,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 05:22:12,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-08-27 05:22:12,143 INFO L87 Difference]: Start difference. First operand 425 states and 593 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 05:22:12,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:12,794 INFO L93 Difference]: Finished difference Result 739 states and 1008 transitions. [2021-08-27 05:22:12,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-27 05:22:12,795 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2021-08-27 05:22:12,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:12,797 INFO L225 Difference]: With dead ends: 739 [2021-08-27 05:22:12,797 INFO L226 Difference]: Without dead ends: 739 [2021-08-27 05:22:12,797 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 361.2ms TimeCoverageRelationStatistics Valid=181, Invalid=575, Unknown=0, NotChecked=0, Total=756 [2021-08-27 05:22:12,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2021-08-27 05:22:12,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 642. [2021-08-27 05:22:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 507 states have (on average 1.4260355029585798) internal successors, (723), 579 states have internal predecessors, (723), 38 states have call successors, (38), 38 states have call predecessors, (38), 85 states have return successors, (113), 25 states have call predecessors, (113), 37 states have call successors, (113) [2021-08-27 05:22:12,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 874 transitions. [2021-08-27 05:22:12,810 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 874 transitions. Word has length 24 [2021-08-27 05:22:12,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:12,811 INFO L470 AbstractCegarLoop]: Abstraction has 642 states and 874 transitions. [2021-08-27 05:22:12,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 05:22:12,811 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 874 transitions. [2021-08-27 05:22:12,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-27 05:22:12,812 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:12,812 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:12,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-27 05:22:13,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-08-27 05:22:13,028 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:13,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:13,029 INFO L82 PathProgramCache]: Analyzing trace with hash -495871717, now seen corresponding path program 1 times [2021-08-27 05:22:13,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:13,029 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534464980] [2021-08-27 05:22:13,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:13,029 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:13,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:13,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:22:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:13,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 05:22:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:22:13,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:13,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534464980] [2021-08-27 05:22:13,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534464980] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:13,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500982346] [2021-08-27 05:22:13,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:13,221 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:22:13,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:22:13,222 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:22:13,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-27 05:22:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:13,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 05:22:13,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:22:13,603 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:22:13,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500982346] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:13,603 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:22:13,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2021-08-27 05:22:13,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996237265] [2021-08-27 05:22:13,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 05:22:13,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:13,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 05:22:13,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-08-27 05:22:13,605 INFO L87 Difference]: Start difference. First operand 642 states and 874 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-27 05:22:14,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:14,873 INFO L93 Difference]: Finished difference Result 2361 states and 3365 transitions. [2021-08-27 05:22:14,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-08-27 05:22:14,874 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 35 [2021-08-27 05:22:14,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:14,881 INFO L225 Difference]: With dead ends: 2361 [2021-08-27 05:22:14,881 INFO L226 Difference]: Without dead ends: 2361 [2021-08-27 05:22:14,882 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 783.5ms TimeCoverageRelationStatistics Valid=228, Invalid=764, Unknown=0, NotChecked=0, Total=992 [2021-08-27 05:22:14,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2021-08-27 05:22:14,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2015. [2021-08-27 05:22:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2015 states, 1621 states have (on average 1.4090067859346083) internal successors, (2284), 1816 states have internal predecessors, (2284), 123 states have call successors, (123), 123 states have call predecessors, (123), 259 states have return successors, (388), 76 states have call predecessors, (388), 122 states have call successors, (388) [2021-08-27 05:22:14,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 2795 transitions. [2021-08-27 05:22:14,935 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 2795 transitions. Word has length 35 [2021-08-27 05:22:14,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:14,935 INFO L470 AbstractCegarLoop]: Abstraction has 2015 states and 2795 transitions. [2021-08-27 05:22:14,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-27 05:22:14,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2795 transitions. [2021-08-27 05:22:14,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 05:22:14,936 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:14,937 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:14,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-27 05:22:15,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:22:15,157 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:15,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:15,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1356372979, now seen corresponding path program 1 times [2021-08-27 05:22:15,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:15,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143746262] [2021-08-27 05:22:15,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:15,157 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:15,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:15,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:22:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:15,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:22:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:15,341 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:22:15,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:15,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143746262] [2021-08-27 05:22:15,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143746262] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:15,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15053452] [2021-08-27 05:22:15,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:15,342 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:22:15,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:22:15,357 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:22:15,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-27 05:22:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:15,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-27 05:22:15,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:22:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:22:15,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15053452] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:15,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:22:15,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2021-08-27 05:22:15,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987430775] [2021-08-27 05:22:15,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 05:22:15,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:15,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 05:22:15,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-08-27 05:22:15,748 INFO L87 Difference]: Start difference. First operand 2015 states and 2795 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-27 05:22:16,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:16,438 INFO L93 Difference]: Finished difference Result 2783 states and 4061 transitions. [2021-08-27 05:22:16,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-27 05:22:16,438 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2021-08-27 05:22:16,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:16,447 INFO L225 Difference]: With dead ends: 2783 [2021-08-27 05:22:16,447 INFO L226 Difference]: Without dead ends: 2783 [2021-08-27 05:22:16,447 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 380.3ms TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2021-08-27 05:22:16,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2783 states. [2021-08-27 05:22:16,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2783 to 2472. [2021-08-27 05:22:16,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2472 states, 1977 states have (on average 1.4011127971674253) internal successors, (2770), 2227 states have internal predecessors, (2770), 169 states have call successors, (169), 146 states have call predecessors, (169), 314 states have return successors, (533), 99 states have call predecessors, (533), 168 states have call successors, (533) [2021-08-27 05:22:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3472 transitions. [2021-08-27 05:22:16,499 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3472 transitions. Word has length 36 [2021-08-27 05:22:16,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:16,499 INFO L470 AbstractCegarLoop]: Abstraction has 2472 states and 3472 transitions. [2021-08-27 05:22:16,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-27 05:22:16,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3472 transitions. [2021-08-27 05:22:16,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 05:22:16,500 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:16,500 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:16,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-27 05:22:16,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:22:16,716 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:16,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:16,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1744987825, now seen corresponding path program 1 times [2021-08-27 05:22:16,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:16,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066746088] [2021-08-27 05:22:16,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:16,717 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:16,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:16,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:22:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:16,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 05:22:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:16,907 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:22:16,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:16,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066746088] [2021-08-27 05:22:16,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066746088] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:16,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379991816] [2021-08-27 05:22:16,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:16,908 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:22:16,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:22:16,909 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:22:16,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-27 05:22:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:17,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-27 05:22:17,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:22:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:22:17,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379991816] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:17,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:22:17,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2021-08-27 05:22:17,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719306038] [2021-08-27 05:22:17,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 05:22:17,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:17,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 05:22:17,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-08-27 05:22:17,274 INFO L87 Difference]: Start difference. First operand 2472 states and 3472 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 10 states have internal predecessors, (39), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 05:22:18,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:18,037 INFO L93 Difference]: Finished difference Result 2236 states and 3085 transitions. [2021-08-27 05:22:18,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-08-27 05:22:18,038 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 10 states have internal predecessors, (39), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2021-08-27 05:22:18,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:18,044 INFO L225 Difference]: With dead ends: 2236 [2021-08-27 05:22:18,044 INFO L226 Difference]: Without dead ends: 2120 [2021-08-27 05:22:18,045 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 521.9ms TimeCoverageRelationStatistics Valid=182, Invalid=810, Unknown=0, NotChecked=0, Total=992 [2021-08-27 05:22:18,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2021-08-27 05:22:18,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 1825. [2021-08-27 05:22:18,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1825 states, 1447 states have (on average 1.38217000691085) internal successors, (2000), 1634 states have internal predecessors, (2000), 142 states have call successors, (142), 119 states have call predecessors, (142), 224 states have return successors, (364), 72 states have call predecessors, (364), 141 states have call successors, (364) [2021-08-27 05:22:18,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 2506 transitions. [2021-08-27 05:22:18,086 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 2506 transitions. Word has length 38 [2021-08-27 05:22:18,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:18,088 INFO L470 AbstractCegarLoop]: Abstraction has 1825 states and 2506 transitions. [2021-08-27 05:22:18,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 10 states have internal predecessors, (39), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 05:22:18,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2506 transitions. [2021-08-27 05:22:18,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-27 05:22:18,089 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:18,089 INFO L512 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:18,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-27 05:22:18,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-08-27 05:22:18,309 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:18,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:18,309 INFO L82 PathProgramCache]: Analyzing trace with hash 421703127, now seen corresponding path program 1 times [2021-08-27 05:22:18,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:18,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064842639] [2021-08-27 05:22:18,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:18,309 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:18,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:18,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:22:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:18,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:22:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:18,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-27 05:22:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:18,449 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-27 05:22:18,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:18,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064842639] [2021-08-27 05:22:18,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064842639] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:18,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794162953] [2021-08-27 05:22:18,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:18,450 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:22:18,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:22:18,450 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:22:18,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-27 05:22:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:18,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-27 05:22:18,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:22:18,830 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-27 05:22:18,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794162953] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:18,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:22:18,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-08-27 05:22:18,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510168821] [2021-08-27 05:22:18,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 05:22:18,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:18,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 05:22:18,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-08-27 05:22:18,833 INFO L87 Difference]: Start difference. First operand 1825 states and 2506 transitions. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2021-08-27 05:22:19,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:19,738 INFO L93 Difference]: Finished difference Result 3248 states and 4600 transitions. [2021-08-27 05:22:19,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-08-27 05:22:19,741 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 47 [2021-08-27 05:22:19,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:19,751 INFO L225 Difference]: With dead ends: 3248 [2021-08-27 05:22:19,751 INFO L226 Difference]: Without dead ends: 3248 [2021-08-27 05:22:19,753 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 500.3ms TimeCoverageRelationStatistics Valid=283, Invalid=977, Unknown=0, NotChecked=0, Total=1260 [2021-08-27 05:22:19,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2021-08-27 05:22:19,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 2632. [2021-08-27 05:22:19,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2632 states, 2104 states have (on average 1.3935361216730038) internal successors, (2932), 2372 states have internal predecessors, (2932), 188 states have call successors, (188), 165 states have call predecessors, (188), 328 states have return successors, (488), 95 states have call predecessors, (488), 187 states have call successors, (488) [2021-08-27 05:22:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2632 states to 2632 states and 3608 transitions. [2021-08-27 05:22:19,808 INFO L78 Accepts]: Start accepts. Automaton has 2632 states and 3608 transitions. Word has length 47 [2021-08-27 05:22:19,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:19,808 INFO L470 AbstractCegarLoop]: Abstraction has 2632 states and 3608 transitions. [2021-08-27 05:22:19,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2021-08-27 05:22:19,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 3608 transitions. [2021-08-27 05:22:19,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-27 05:22:19,809 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:19,809 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:19,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-27 05:22:20,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-08-27 05:22:20,026 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:20,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:20,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1681124145, now seen corresponding path program 1 times [2021-08-27 05:22:20,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:20,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47583108] [2021-08-27 05:22:20,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:20,027 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:20,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:20,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:22:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:20,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:22:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:20,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-27 05:22:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:20,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-27 05:22:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:20,174 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-08-27 05:22:20,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:20,174 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47583108] [2021-08-27 05:22:20,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47583108] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:20,174 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815926325] [2021-08-27 05:22:20,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:20,174 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:22:20,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:22:20,177 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:22:20,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-27 05:22:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:20,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 05:22:20,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:22:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-08-27 05:22:20,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815926325] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:20,537 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:22:20,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2021-08-27 05:22:20,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603470309] [2021-08-27 05:22:20,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 05:22:20,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:20,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 05:22:20,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-08-27 05:22:20,538 INFO L87 Difference]: Start difference. First operand 2632 states and 3608 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 05:22:21,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:21,003 INFO L93 Difference]: Finished difference Result 3687 states and 5274 transitions. [2021-08-27 05:22:21,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 05:22:21,005 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2021-08-27 05:22:21,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:21,015 INFO L225 Difference]: With dead ends: 3687 [2021-08-27 05:22:21,015 INFO L226 Difference]: Without dead ends: 3687 [2021-08-27 05:22:21,015 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 227.5ms TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2021-08-27 05:22:21,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3687 states. [2021-08-27 05:22:21,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3687 to 2678. [2021-08-27 05:22:21,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2678 states, 2127 states have (on average 1.3892806770098731) internal successors, (2955), 2418 states have internal predecessors, (2955), 188 states have call successors, (188), 165 states have call predecessors, (188), 351 states have return successors, (534), 95 states have call predecessors, (534), 187 states have call successors, (534) [2021-08-27 05:22:21,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2678 states to 2678 states and 3677 transitions. [2021-08-27 05:22:21,065 INFO L78 Accepts]: Start accepts. Automaton has 2678 states and 3677 transitions. Word has length 58 [2021-08-27 05:22:21,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:21,065 INFO L470 AbstractCegarLoop]: Abstraction has 2678 states and 3677 transitions. [2021-08-27 05:22:21,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 05:22:21,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2678 states and 3677 transitions. [2021-08-27 05:22:21,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-27 05:22:21,067 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:21,067 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:21,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-27 05:22:21,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:22:21,281 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:21,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:21,281 INFO L82 PathProgramCache]: Analyzing trace with hash 57126017, now seen corresponding path program 1 times [2021-08-27 05:22:21,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:21,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082627212] [2021-08-27 05:22:21,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:21,281 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:21,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:21,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:22:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:21,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:22:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:21,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 05:22:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:21,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-08-27 05:22:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:21,496 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 18 proven. 32 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-27 05:22:21,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:21,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082627212] [2021-08-27 05:22:21,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082627212] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:21,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916910631] [2021-08-27 05:22:21,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:21,497 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:22:21,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:22:21,498 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:22:21,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-27 05:22:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:21,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-27 05:22:21,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:22:21,964 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-27 05:22:21,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916910631] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:21,965 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:22:21,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2021-08-27 05:22:21,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164491632] [2021-08-27 05:22:21,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-27 05:22:21,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:21,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-27 05:22:21,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-08-27 05:22:21,966 INFO L87 Difference]: Start difference. First operand 2678 states and 3677 transitions. Second operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 16 states have internal predecessors, (80), 7 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2021-08-27 05:22:28,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:28,570 INFO L93 Difference]: Finished difference Result 10210 states and 14276 transitions. [2021-08-27 05:22:28,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2021-08-27 05:22:28,571 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 16 states have internal predecessors, (80), 7 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 60 [2021-08-27 05:22:28,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:28,608 INFO L225 Difference]: With dead ends: 10210 [2021-08-27 05:22:28,608 INFO L226 Difference]: Without dead ends: 10035 [2021-08-27 05:22:28,613 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10272 ImplicationChecksByTransitivity, 4394.2ms TimeCoverageRelationStatistics Valid=3114, Invalid=23618, Unknown=0, NotChecked=0, Total=26732 [2021-08-27 05:22:28,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10035 states. [2021-08-27 05:22:28,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10035 to 8947. [2021-08-27 05:22:28,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8947 states, 7143 states have (on average 1.360212795744085) internal successors, (9716), 8037 states have internal predecessors, (9716), 670 states have call successors, (670), 573 states have call predecessors, (670), 1123 states have return successors, (2034), 337 states have call predecessors, (2034), 669 states have call successors, (2034) [2021-08-27 05:22:28,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8947 states to 8947 states and 12420 transitions. [2021-08-27 05:22:28,861 INFO L78 Accepts]: Start accepts. Automaton has 8947 states and 12420 transitions. Word has length 60 [2021-08-27 05:22:28,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:28,861 INFO L470 AbstractCegarLoop]: Abstraction has 8947 states and 12420 transitions. [2021-08-27 05:22:28,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 16 states have internal predecessors, (80), 7 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2021-08-27 05:22:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand 8947 states and 12420 transitions. [2021-08-27 05:22:28,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-27 05:22:28,864 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:28,864 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:28,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-27 05:22:29,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-08-27 05:22:29,085 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:29,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:29,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1356938417, now seen corresponding path program 1 times [2021-08-27 05:22:29,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:29,085 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916825417] [2021-08-27 05:22:29,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:29,085 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:29,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:29,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:22:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:29,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:22:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:29,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-27 05:22:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:29,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 05:22:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-08-27 05:22:29,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:29,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916825417] [2021-08-27 05:22:29,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916825417] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:29,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42080153] [2021-08-27 05:22:29,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:29,243 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:22:29,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:22:29,244 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:22:29,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-27 05:22:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:29,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-27 05:22:29,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:22:29,719 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 12 proven. 43 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-27 05:22:29,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42080153] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:29,719 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:22:29,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-08-27 05:22:29,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623484727] [2021-08-27 05:22:29,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-27 05:22:29,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:29,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-27 05:22:29,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2021-08-27 05:22:29,721 INFO L87 Difference]: Start difference. First operand 8947 states and 12420 transitions. Second operand has 17 states, 17 states have (on average 4.470588235294118) internal successors, (76), 14 states have internal predecessors, (76), 6 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2021-08-27 05:22:31,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:31,097 INFO L93 Difference]: Finished difference Result 18386 states and 26465 transitions. [2021-08-27 05:22:31,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-08-27 05:22:31,098 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.470588235294118) internal successors, (76), 14 states have internal predecessors, (76), 6 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 60 [2021-08-27 05:22:31,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:31,149 INFO L225 Difference]: With dead ends: 18386 [2021-08-27 05:22:31,149 INFO L226 Difference]: Without dead ends: 18386 [2021-08-27 05:22:31,150 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 779.0ms TimeCoverageRelationStatistics Valid=547, Invalid=1903, Unknown=0, NotChecked=0, Total=2450 [2021-08-27 05:22:31,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18386 states. [2021-08-27 05:22:31,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18386 to 14298. [2021-08-27 05:22:31,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14298 states, 11614 states have (on average 1.3810056827966248) internal successors, (16039), 12898 states have internal predecessors, (16039), 1002 states have call successors, (1002), 897 states have call predecessors, (1002), 1671 states have return successors, (3048), 503 states have call predecessors, (3048), 1001 states have call successors, (3048) [2021-08-27 05:22:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14298 states to 14298 states and 20089 transitions. [2021-08-27 05:22:31,439 INFO L78 Accepts]: Start accepts. Automaton has 14298 states and 20089 transitions. Word has length 60 [2021-08-27 05:22:31,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:31,440 INFO L470 AbstractCegarLoop]: Abstraction has 14298 states and 20089 transitions. [2021-08-27 05:22:31,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.470588235294118) internal successors, (76), 14 states have internal predecessors, (76), 6 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2021-08-27 05:22:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 14298 states and 20089 transitions. [2021-08-27 05:22:31,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-27 05:22:31,442 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:31,442 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:31,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-27 05:22:31,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-08-27 05:22:31,656 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting popErr1REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:31,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:31,656 INFO L82 PathProgramCache]: Analyzing trace with hash 7649356, now seen corresponding path program 1 times [2021-08-27 05:22:31,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:31,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894836640] [2021-08-27 05:22:31,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:31,656 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:31,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:31,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:22:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:31,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:22:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:31,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-27 05:22:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:31,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-08-27 05:22:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:31,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-27 05:22:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 57 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-27 05:22:31,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:31,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894836640] [2021-08-27 05:22:31,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894836640] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:31,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607922709] [2021-08-27 05:22:31,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:31,845 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:22:31,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:22:31,856 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:22:31,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-27 05:22:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:32,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-27 05:22:32,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:22:32,367 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-27 05:22:32,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607922709] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:32,367 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:22:32,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2021-08-27 05:22:32,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167155815] [2021-08-27 05:22:32,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 05:22:32,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:32,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 05:22:32,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-08-27 05:22:32,369 INFO L87 Difference]: Start difference. First operand 14298 states and 20089 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 12 states have internal predecessors, (71), 5 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2021-08-27 05:22:33,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:33,876 INFO L93 Difference]: Finished difference Result 18457 states and 26048 transitions. [2021-08-27 05:22:33,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-08-27 05:22:33,877 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 12 states have internal predecessors, (71), 5 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 71 [2021-08-27 05:22:33,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:33,918 INFO L225 Difference]: With dead ends: 18457 [2021-08-27 05:22:33,919 INFO L226 Difference]: Without dead ends: 18282 [2021-08-27 05:22:33,919 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 971.0ms TimeCoverageRelationStatistics Valid=390, Invalid=1416, Unknown=0, NotChecked=0, Total=1806 [2021-08-27 05:22:33,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18282 states. [2021-08-27 05:22:34,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18282 to 17261. [2021-08-27 05:22:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17261 states, 13838 states have (on average 1.3599508599508598) internal successors, (18819), 15533 states have internal predecessors, (18819), 1334 states have call successors, (1334), 1059 states have call predecessors, (1334), 2078 states have return successors, (4228), 669 states have call predecessors, (4228), 1333 states have call successors, (4228) [2021-08-27 05:22:34,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17261 states to 17261 states and 24381 transitions. [2021-08-27 05:22:34,187 INFO L78 Accepts]: Start accepts. Automaton has 17261 states and 24381 transitions. Word has length 71 [2021-08-27 05:22:34,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:34,188 INFO L470 AbstractCegarLoop]: Abstraction has 17261 states and 24381 transitions. [2021-08-27 05:22:34,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 12 states have internal predecessors, (71), 5 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2021-08-27 05:22:34,188 INFO L276 IsEmpty]: Start isEmpty. Operand 17261 states and 24381 transitions. [2021-08-27 05:22:34,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-27 05:22:34,190 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:34,190 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:34,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-08-27 05:22:34,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:22:34,404 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting popErr1REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:34,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:34,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1516849340, now seen corresponding path program 1 times [2021-08-27 05:22:34,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:34,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305093202] [2021-08-27 05:22:34,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:34,405 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:34,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:34,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:22:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:34,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:22:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:34,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-27 05:22:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:34,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-27 05:22:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:34,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-08-27 05:22:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:34,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-08-27 05:22:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:34,545 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 82 proven. 5 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-08-27 05:22:34,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:34,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305093202] [2021-08-27 05:22:34,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305093202] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:34,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947911232] [2021-08-27 05:22:34,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:34,546 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:22:34,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:22:34,547 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:22:34,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-27 05:22:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:34,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 05:22:34,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:22:35,114 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 80 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-08-27 05:22:35,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947911232] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:35,114 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:22:35,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2021-08-27 05:22:35,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906482677] [2021-08-27 05:22:35,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 05:22:35,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:35,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 05:22:35,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-08-27 05:22:35,116 INFO L87 Difference]: Start difference. First operand 17261 states and 24381 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-27 05:22:35,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:35,860 INFO L93 Difference]: Finished difference Result 22712 states and 32588 transitions. [2021-08-27 05:22:35,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 05:22:35,860 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 82 [2021-08-27 05:22:35,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:35,918 INFO L225 Difference]: With dead ends: 22712 [2021-08-27 05:22:35,919 INFO L226 Difference]: Without dead ends: 22712 [2021-08-27 05:22:35,919 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 423.5ms TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2021-08-27 05:22:35,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22712 states. [2021-08-27 05:22:36,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22712 to 17261. [2021-08-27 05:22:36,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17261 states, 13838 states have (on average 1.3599508599508598) internal successors, (18819), 15533 states have internal predecessors, (18819), 1334 states have call successors, (1334), 1059 states have call predecessors, (1334), 2078 states have return successors, (4228), 669 states have call predecessors, (4228), 1333 states have call successors, (4228) [2021-08-27 05:22:36,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17261 states to 17261 states and 24381 transitions. [2021-08-27 05:22:36,279 INFO L78 Accepts]: Start accepts. Automaton has 17261 states and 24381 transitions. Word has length 82 [2021-08-27 05:22:36,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:36,279 INFO L470 AbstractCegarLoop]: Abstraction has 17261 states and 24381 transitions. [2021-08-27 05:22:36,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-27 05:22:36,279 INFO L276 IsEmpty]: Start isEmpty. Operand 17261 states and 24381 transitions. [2021-08-27 05:22:36,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-27 05:22:36,285 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:36,285 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:36,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-08-27 05:22:36,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:22:36,504 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting popErr1REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:36,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:36,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1173694170, now seen corresponding path program 1 times [2021-08-27 05:22:36,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:36,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687692868] [2021-08-27 05:22:36,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:36,505 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:36,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:36,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:22:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:36,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:22:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:36,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-27 05:22:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:36,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 05:22:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:36,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-08-27 05:22:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:36,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-08-27 05:22:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:36,662 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 72 proven. 14 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-08-27 05:22:36,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:36,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687692868] [2021-08-27 05:22:36,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687692868] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:36,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117902102] [2021-08-27 05:22:36,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:36,662 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:22:36,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:22:36,663 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:22:36,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-08-27 05:22:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:37,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-27 05:22:37,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:22:37,284 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 48 proven. 43 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-08-27 05:22:37,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117902102] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:37,284 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:22:37,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-08-27 05:22:37,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354999329] [2021-08-27 05:22:37,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 05:22:37,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:37,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 05:22:37,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2021-08-27 05:22:37,285 INFO L87 Difference]: Start difference. First operand 17261 states and 24381 transitions. Second operand has 19 states, 19 states have (on average 4.631578947368421) internal successors, (88), 15 states have internal predecessors, (88), 6 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2021-08-27 05:22:39,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:39,609 INFO L93 Difference]: Finished difference Result 27778 states and 39484 transitions. [2021-08-27 05:22:39,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-08-27 05:22:39,609 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.631578947368421) internal successors, (88), 15 states have internal predecessors, (88), 6 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 84 [2021-08-27 05:22:39,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:39,676 INFO L225 Difference]: With dead ends: 27778 [2021-08-27 05:22:39,677 INFO L226 Difference]: Without dead ends: 26524 [2021-08-27 05:22:39,678 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1205 ImplicationChecksByTransitivity, 1588.0ms TimeCoverageRelationStatistics Valid=778, Invalid=3254, Unknown=0, NotChecked=0, Total=4032 [2021-08-27 05:22:39,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26524 states. [2021-08-27 05:22:40,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26524 to 17896. [2021-08-27 05:22:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17896 states, 14358 states have (on average 1.3469146120629614) internal successors, (19339), 16087 states have internal predecessors, (19339), 1334 states have call successors, (1334), 1140 states have call predecessors, (1334), 2193 states have return successors, (4311), 669 states have call predecessors, (4311), 1333 states have call successors, (4311) [2021-08-27 05:22:40,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17896 states to 17896 states and 24984 transitions. [2021-08-27 05:22:40,098 INFO L78 Accepts]: Start accepts. Automaton has 17896 states and 24984 transitions. Word has length 84 [2021-08-27 05:22:40,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:40,099 INFO L470 AbstractCegarLoop]: Abstraction has 17896 states and 24984 transitions. [2021-08-27 05:22:40,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.631578947368421) internal successors, (88), 15 states have internal predecessors, (88), 6 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2021-08-27 05:22:40,099 INFO L276 IsEmpty]: Start isEmpty. Operand 17896 states and 24984 transitions. [2021-08-27 05:22:40,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-27 05:22:40,101 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:40,101 INFO L512 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:40,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-08-27 05:22:40,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-08-27 05:22:40,317 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:40,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:40,317 INFO L82 PathProgramCache]: Analyzing trace with hash 57278106, now seen corresponding path program 1 times [2021-08-27 05:22:40,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:40,317 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203601555] [2021-08-27 05:22:40,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:40,318 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:40,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:40,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:22:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:40,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:22:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:40,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-27 05:22:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:40,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-27 05:22:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:40,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-08-27 05:22:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:40,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-08-27 05:22:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:40,466 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 70 proven. 29 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-08-27 05:22:40,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:40,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203601555] [2021-08-27 05:22:40,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203601555] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:40,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663796161] [2021-08-27 05:22:40,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:40,467 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:22:40,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:22:40,467 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:22:40,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-08-27 05:22:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:40,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-27 05:22:40,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:22:41,077 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 122 proven. 11 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-08-27 05:22:41,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663796161] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:41,078 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:22:41,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2021-08-27 05:22:41,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56602857] [2021-08-27 05:22:41,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-27 05:22:41,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:41,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 05:22:41,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2021-08-27 05:22:41,079 INFO L87 Difference]: Start difference. First operand 17896 states and 24984 transitions. Second operand has 18 states, 18 states have (on average 4.5) internal successors, (81), 15 states have internal predecessors, (81), 6 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2021-08-27 05:22:42,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:42,254 INFO L93 Difference]: Finished difference Result 14807 states and 19651 transitions. [2021-08-27 05:22:42,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-08-27 05:22:42,256 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 15 states have internal predecessors, (81), 6 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 84 [2021-08-27 05:22:42,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:42,283 INFO L225 Difference]: With dead ends: 14807 [2021-08-27 05:22:42,283 INFO L226 Difference]: Without dead ends: 13835 [2021-08-27 05:22:42,284 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 725.0ms TimeCoverageRelationStatistics Valid=589, Invalid=2063, Unknown=0, NotChecked=0, Total=2652 [2021-08-27 05:22:42,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13835 states. [2021-08-27 05:22:42,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13835 to 13300. [2021-08-27 05:22:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13300 states, 10710 states have (on average 1.3072829131652661) internal successors, (14001), 11900 states have internal predecessors, (14001), 1002 states have call successors, (1002), 897 states have call predecessors, (1002), 1577 states have return successors, (2716), 503 states have call predecessors, (2716), 1001 states have call successors, (2716) [2021-08-27 05:22:42,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13300 states to 13300 states and 17719 transitions. [2021-08-27 05:22:42,473 INFO L78 Accepts]: Start accepts. Automaton has 13300 states and 17719 transitions. Word has length 84 [2021-08-27 05:22:42,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:42,473 INFO L470 AbstractCegarLoop]: Abstraction has 13300 states and 17719 transitions. [2021-08-27 05:22:42,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 15 states have internal predecessors, (81), 6 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2021-08-27 05:22:42,473 INFO L276 IsEmpty]: Start isEmpty. Operand 13300 states and 17719 transitions. [2021-08-27 05:22:42,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-27 05:22:42,475 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:42,475 INFO L512 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:42,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-08-27 05:22:42,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-08-27 05:22:42,689 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:42,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:42,689 INFO L82 PathProgramCache]: Analyzing trace with hash -478636956, now seen corresponding path program 1 times [2021-08-27 05:22:42,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:42,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3436193] [2021-08-27 05:22:42,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:42,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:42,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:42,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:22:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:42,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:22:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:42,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-27 05:22:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:42,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-27 05:22:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:42,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-08-27 05:22:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:42,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-08-27 05:22:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 38 proven. 67 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-08-27 05:22:42,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:42,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3436193] [2021-08-27 05:22:42,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3436193] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:42,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163131480] [2021-08-27 05:22:42,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:42,853 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:22:42,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:22:42,854 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:22:42,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-08-27 05:22:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:43,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 25 conjunts are in the unsatisfiable core [2021-08-27 05:22:43,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:22:43,449 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 49 proven. 65 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-08-27 05:22:43,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163131480] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:43,449 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:22:43,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2021-08-27 05:22:43,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628467169] [2021-08-27 05:22:43,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 05:22:43,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:43,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 05:22:43,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-08-27 05:22:43,450 INFO L87 Difference]: Start difference. First operand 13300 states and 17719 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-27 05:22:44,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:44,099 INFO L93 Difference]: Finished difference Result 13075 states and 17272 transitions. [2021-08-27 05:22:44,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 05:22:44,099 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 85 [2021-08-27 05:22:44,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:44,121 INFO L225 Difference]: With dead ends: 13075 [2021-08-27 05:22:44,121 INFO L226 Difference]: Without dead ends: 13075 [2021-08-27 05:22:44,122 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 293.8ms TimeCoverageRelationStatistics Valid=161, Invalid=541, Unknown=0, NotChecked=0, Total=702 [2021-08-27 05:22:44,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13075 states. [2021-08-27 05:22:44,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13075 to 12880. [2021-08-27 05:22:44,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12880 states, 10360 states have (on average 1.2998069498069498) internal successors, (13466), 11514 states have internal predecessors, (13466), 978 states have call successors, (978), 875 states have call predecessors, (978), 1531 states have return successors, (2628), 491 states have call predecessors, (2628), 977 states have call successors, (2628) [2021-08-27 05:22:44,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12880 states to 12880 states and 17072 transitions. [2021-08-27 05:22:44,280 INFO L78 Accepts]: Start accepts. Automaton has 12880 states and 17072 transitions. Word has length 85 [2021-08-27 05:22:44,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:44,280 INFO L470 AbstractCegarLoop]: Abstraction has 12880 states and 17072 transitions. [2021-08-27 05:22:44,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-27 05:22:44,280 INFO L276 IsEmpty]: Start isEmpty. Operand 12880 states and 17072 transitions. [2021-08-27 05:22:44,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-27 05:22:44,282 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:44,282 INFO L512 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:44,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-08-27 05:22:44,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:22:44,497 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:44,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:44,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1378069754, now seen corresponding path program 1 times [2021-08-27 05:22:44,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:44,497 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845016798] [2021-08-27 05:22:44,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:44,497 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:44,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:44,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:22:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:44,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:22:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:44,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-27 05:22:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:44,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-27 05:22:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:44,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-08-27 05:22:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:44,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-08-27 05:22:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:44,694 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 84 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-08-27 05:22:44,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:44,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845016798] [2021-08-27 05:22:44,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845016798] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:44,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519483991] [2021-08-27 05:22:44,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:44,695 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:22:44,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:22:44,696 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:22:44,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-08-27 05:22:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:45,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-27 05:22:45,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:22:45,399 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 21 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-27 05:22:45,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519483991] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:45,399 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:22:45,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 15 [2021-08-27 05:22:45,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880158857] [2021-08-27 05:22:45,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 05:22:45,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:45,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 05:22:45,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-08-27 05:22:45,401 INFO L87 Difference]: Start difference. First operand 12880 states and 17072 transitions. Second operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-27 05:22:46,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:46,656 INFO L93 Difference]: Finished difference Result 20786 states and 27151 transitions. [2021-08-27 05:22:46,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-27 05:22:46,656 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 86 [2021-08-27 05:22:46,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:46,712 INFO L225 Difference]: With dead ends: 20786 [2021-08-27 05:22:46,713 INFO L226 Difference]: Without dead ends: 19891 [2021-08-27 05:22:46,713 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 690.1ms TimeCoverageRelationStatistics Valid=242, Invalid=1090, Unknown=0, NotChecked=0, Total=1332 [2021-08-27 05:22:46,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19891 states. [2021-08-27 05:22:46,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19891 to 18204. [2021-08-27 05:22:46,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18204 states, 14593 states have (on average 1.2843829233193997) internal successors, (18743), 16269 states have internal predecessors, (18743), 1404 states have call successors, (1404), 1214 states have call predecessors, (1404), 2196 states have return successors, (3836), 721 states have call predecessors, (3836), 1403 states have call successors, (3836) [2021-08-27 05:22:47,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18204 states to 18204 states and 23983 transitions. [2021-08-27 05:22:47,016 INFO L78 Accepts]: Start accepts. Automaton has 18204 states and 23983 transitions. Word has length 86 [2021-08-27 05:22:47,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:47,016 INFO L470 AbstractCegarLoop]: Abstraction has 18204 states and 23983 transitions. [2021-08-27 05:22:47,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-27 05:22:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 18204 states and 23983 transitions. [2021-08-27 05:22:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-08-27 05:22:47,018 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:47,019 INFO L512 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:47,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-08-27 05:22:47,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:22:47,233 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:47,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:47,233 INFO L82 PathProgramCache]: Analyzing trace with hash -616739140, now seen corresponding path program 1 times [2021-08-27 05:22:47,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:47,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862883565] [2021-08-27 05:22:47,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:47,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:47,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:47,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:22:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:47,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:22:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:47,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-27 05:22:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:47,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-08-27 05:22:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:47,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-08-27 05:22:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:47,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-08-27 05:22:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:47,410 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 70 proven. 42 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-08-27 05:22:47,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:47,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862883565] [2021-08-27 05:22:47,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862883565] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:47,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785662199] [2021-08-27 05:22:47,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:47,410 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:22:47,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:22:47,411 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:22:47,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-08-27 05:22:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:47,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 38 conjunts are in the unsatisfiable core [2021-08-27 05:22:47,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:22:48,165 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 108 proven. 46 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-08-27 05:22:48,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785662199] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:48,166 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:22:48,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-08-27 05:22:48,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654262443] [2021-08-27 05:22:48,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-27 05:22:48,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:48,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 05:22:48,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-08-27 05:22:48,167 INFO L87 Difference]: Start difference. First operand 18204 states and 23983 transitions. Second operand has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 15 states have internal predecessors, (93), 6 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2021-08-27 05:22:50,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:50,044 INFO L93 Difference]: Finished difference Result 13417 states and 17122 transitions. [2021-08-27 05:22:50,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-08-27 05:22:50,045 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 15 states have internal predecessors, (93), 6 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 92 [2021-08-27 05:22:50,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:50,067 INFO L225 Difference]: With dead ends: 13417 [2021-08-27 05:22:50,067 INFO L226 Difference]: Without dead ends: 12804 [2021-08-27 05:22:50,068 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 1110.4ms TimeCoverageRelationStatistics Valid=390, Invalid=2262, Unknown=0, NotChecked=0, Total=2652 [2021-08-27 05:22:50,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12804 states. [2021-08-27 05:22:50,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12804 to 12620. [2021-08-27 05:22:50,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12620 states, 10074 states have (on average 1.2790351399642645) internal successors, (12885), 11210 states have internal predecessors, (12885), 988 states have call successors, (988), 899 states have call predecessors, (988), 1547 states have return successors, (2458), 511 states have call predecessors, (2458), 987 states have call successors, (2458) [2021-08-27 05:22:50,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12620 states to 12620 states and 16331 transitions. [2021-08-27 05:22:50,226 INFO L78 Accepts]: Start accepts. Automaton has 12620 states and 16331 transitions. Word has length 92 [2021-08-27 05:22:50,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:50,226 INFO L470 AbstractCegarLoop]: Abstraction has 12620 states and 16331 transitions. [2021-08-27 05:22:50,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 15 states have internal predecessors, (93), 6 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2021-08-27 05:22:50,226 INFO L276 IsEmpty]: Start isEmpty. Operand 12620 states and 16331 transitions. [2021-08-27 05:22:50,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-08-27 05:22:50,228 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:50,228 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:50,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-08-27 05:22:50,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-08-27 05:22:50,437 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting popErr1REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:50,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:50,437 INFO L82 PathProgramCache]: Analyzing trace with hash 259058990, now seen corresponding path program 1 times [2021-08-27 05:22:50,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:50,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436178552] [2021-08-27 05:22:50,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:50,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:50,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:50,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:22:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:50,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:22:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:50,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-27 05:22:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:50,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-27 05:22:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:50,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-08-27 05:22:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:50,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-08-27 05:22:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:50,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-08-27 05:22:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:50,693 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 36 proven. 80 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-08-27 05:22:50,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:50,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436178552] [2021-08-27 05:22:50,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436178552] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:50,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161870810] [2021-08-27 05:22:50,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:50,694 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:22:50,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:22:50,695 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:22:50,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-08-27 05:22:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:51,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 57 conjunts are in the unsatisfiable core [2021-08-27 05:22:51,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:22:51,824 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 108 proven. 33 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-08-27 05:22:51,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161870810] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:51,825 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:22:51,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-08-27 05:22:51,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271966233] [2021-08-27 05:22:51,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-27 05:22:51,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:51,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-27 05:22:51,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2021-08-27 05:22:51,826 INFO L87 Difference]: Start difference. First operand 12620 states and 16331 transitions. Second operand has 22 states, 21 states have (on average 4.619047619047619) internal successors, (97), 19 states have internal predecessors, (97), 7 states have call successors, (14), 10 states have call predecessors, (14), 11 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2021-08-27 05:22:56,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:22:56,853 INFO L93 Difference]: Finished difference Result 21726 states and 27863 transitions. [2021-08-27 05:22:56,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-08-27 05:22:56,854 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.619047619047619) internal successors, (97), 19 states have internal predecessors, (97), 7 states have call successors, (14), 10 states have call predecessors, (14), 11 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 95 [2021-08-27 05:22:56,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:22:56,906 INFO L225 Difference]: With dead ends: 21726 [2021-08-27 05:22:56,907 INFO L226 Difference]: Without dead ends: 21592 [2021-08-27 05:22:56,908 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2006 ImplicationChecksByTransitivity, 3281.2ms TimeCoverageRelationStatistics Valid=1246, Invalid=5726, Unknown=0, NotChecked=0, Total=6972 [2021-08-27 05:22:56,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21592 states. [2021-08-27 05:22:57,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21592 to 20891. [2021-08-27 05:22:57,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20891 states, 16726 states have (on average 1.2621068994380007) internal successors, (21110), 18565 states have internal predecessors, (21110), 1608 states have call successors, (1608), 1485 states have call predecessors, (1608), 2546 states have return successors, (4151), 841 states have call predecessors, (4151), 1607 states have call successors, (4151) [2021-08-27 05:22:57,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20891 states to 20891 states and 26869 transitions. [2021-08-27 05:22:57,196 INFO L78 Accepts]: Start accepts. Automaton has 20891 states and 26869 transitions. Word has length 95 [2021-08-27 05:22:57,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:22:57,197 INFO L470 AbstractCegarLoop]: Abstraction has 20891 states and 26869 transitions. [2021-08-27 05:22:57,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.619047619047619) internal successors, (97), 19 states have internal predecessors, (97), 7 states have call successors, (14), 10 states have call predecessors, (14), 11 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2021-08-27 05:22:57,197 INFO L276 IsEmpty]: Start isEmpty. Operand 20891 states and 26869 transitions. [2021-08-27 05:22:57,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-08-27 05:22:57,200 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:22:57,200 INFO L512 BasicCegarLoop]: trace histogram [10, 9, 8, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:22:57,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-08-27 05:22:57,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-08-27 05:22:57,417 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:22:57,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:22:57,417 INFO L82 PathProgramCache]: Analyzing trace with hash 756702157, now seen corresponding path program 1 times [2021-08-27 05:22:57,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:22:57,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098830791] [2021-08-27 05:22:57,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:57,417 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:22:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:57,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 05:22:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:57,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 05:22:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:57,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 05:22:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:57,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-27 05:22:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:57,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-27 05:22:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:57,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-08-27 05:22:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:57,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-08-27 05:22:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:57,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-08-27 05:22:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:57,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-08-27 05:22:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:57,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-08-27 05:22:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 97 proven. 4 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2021-08-27 05:22:57,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 05:22:57,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098830791] [2021-08-27 05:22:57,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098830791] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:57,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003414808] [2021-08-27 05:22:57,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:22:57,577 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 05:22:57,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:22:57,585 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 05:22:57,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-08-27 05:22:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:22:58,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 30 conjunts are in the unsatisfiable core [2021-08-27 05:22:58,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:22:58,387 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 91 proven. 62 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2021-08-27 05:22:58,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003414808] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 05:22:58,388 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:22:58,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2021-08-27 05:22:58,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309546933] [2021-08-27 05:22:58,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-27 05:22:58,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 05:22:58,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 05:22:58,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-08-27 05:22:58,389 INFO L87 Difference]: Start difference. First operand 20891 states and 26869 transitions. Second operand has 18 states, 18 states have (on average 5.888888888888889) internal successors, (106), 14 states have internal predecessors, (106), 6 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2021-08-27 05:23:00,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:23:00,434 INFO L93 Difference]: Finished difference Result 26244 states and 33478 transitions. [2021-08-27 05:23:00,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-08-27 05:23:00,435 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.888888888888889) internal successors, (106), 14 states have internal predecessors, (106), 6 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 118 [2021-08-27 05:23:00,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:23:00,501 INFO L225 Difference]: With dead ends: 26244 [2021-08-27 05:23:00,502 INFO L226 Difference]: Without dead ends: 26082 [2021-08-27 05:23:00,503 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1368.5ms TimeCoverageRelationStatistics Valid=490, Invalid=2480, Unknown=0, NotChecked=0, Total=2970 [2021-08-27 05:23:00,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26082 states. [2021-08-27 05:23:00,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26082 to 25019. [2021-08-27 05:23:00,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25019 states, 19786 states have (on average 1.2359749317699384) internal successors, (24455), 22050 states have internal predecessors, (24455), 2142 states have call successors, (2142), 1850 states have call predecessors, (2142), 3080 states have return successors, (5385), 1119 states have call predecessors, (5385), 2141 states have call successors, (5385) [2021-08-27 05:23:00,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25019 states to 25019 states and 31982 transitions. [2021-08-27 05:23:00,838 INFO L78 Accepts]: Start accepts. Automaton has 25019 states and 31982 transitions. Word has length 118 [2021-08-27 05:23:00,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:23:00,839 INFO L470 AbstractCegarLoop]: Abstraction has 25019 states and 31982 transitions. [2021-08-27 05:23:00,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.888888888888889) internal successors, (106), 14 states have internal predecessors, (106), 6 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2021-08-27 05:23:00,839 INFO L276 IsEmpty]: Start isEmpty. Operand 25019 states and 31982 transitions. [2021-08-27 05:23:00,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-08-27 05:23:00,843 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:23:00,843 INFO L512 BasicCegarLoop]: trace histogram [11, 10, 9, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:23:00,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-08-27 05:23:01,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-08-27 05:23:01,054 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:23:01,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:23:01,054 INFO L82 PathProgramCache]: Analyzing trace with hash -607088145, now seen corresponding path program 1 times [2021-08-27 05:23:01,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 05:23:01,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467450153] [2021-08-27 05:23:01,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:23:01,055 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 05:23:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 05:23:01,077 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 05:23:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 05:23:01,145 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 05:23:01,145 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 05:23:01,146 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr5ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 05:23:01,147 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr0REQUIRES_VIOLATION [2021-08-27 05:23:01,147 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr1REQUIRES_VIOLATION [2021-08-27 05:23:01,147 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr2REQUIRES_VIOLATION [2021-08-27 05:23:01,147 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr3REQUIRES_VIOLATION [2021-08-27 05:23:01,147 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr4REQUIRES_VIOLATION [2021-08-27 05:23:01,147 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr5REQUIRES_VIOLATION [2021-08-27 05:23:01,148 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr6REQUIRES_VIOLATION [2021-08-27 05:23:01,148 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr7REQUIRES_VIOLATION [2021-08-27 05:23:01,148 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr0REQUIRES_VIOLATION [2021-08-27 05:23:01,148 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr1REQUIRES_VIOLATION [2021-08-27 05:23:01,148 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr2REQUIRES_VIOLATION [2021-08-27 05:23:01,148 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr3REQUIRES_VIOLATION [2021-08-27 05:23:01,148 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr4REQUIRES_VIOLATION [2021-08-27 05:23:01,148 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr5REQUIRES_VIOLATION [2021-08-27 05:23:01,148 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 05:23:01,148 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 05:23:01,149 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:23:01,149 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:23:01,149 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:23:01,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-27 05:23:01,154 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 05:23:01,185 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2021-08-27 05:23:01,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 05:23:01 BoogieIcfgContainer [2021-08-27 05:23:01,236 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 05:23:01,237 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 05:23:01,237 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 05:23:01,238 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 05:23:01,238 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:22:06" (3/4) ... [2021-08-27 05:23:01,240 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 05:23:01,240 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 05:23:01,241 INFO L168 Benchmark]: Toolchain (without parser) took 55243.50 ms. Allocated memory was 60.8 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 38.5 MB in the beginning and 528.6 MB in the end (delta: -490.1 MB). Peak memory consumption was 1.0 GB. Max. memory is 16.1 GB. [2021-08-27 05:23:01,242 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 60.8 MB. Free memory was 43.3 MB in the beginning and 43.3 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 05:23:01,242 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.11 ms. Allocated memory is still 60.8 MB. Free memory was 38.3 MB in the beginning and 37.6 MB in the end (delta: 774.2 kB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 05:23:01,242 INFO L168 Benchmark]: Boogie Preprocessor took 61.30 ms. Allocated memory is still 60.8 MB. Free memory was 37.6 MB in the beginning and 34.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 05:23:01,243 INFO L168 Benchmark]: RCFGBuilder took 563.39 ms. Allocated memory was 60.8 MB in the beginning and 79.7 MB in the end (delta: 18.9 MB). Free memory was 34.6 MB in the beginning and 58.8 MB in the end (delta: -24.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 16.1 GB. [2021-08-27 05:23:01,243 INFO L168 Benchmark]: TraceAbstraction took 54246.94 ms. Allocated memory was 79.7 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 58.7 MB in the beginning and 529.6 MB in the end (delta: -470.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 16.1 GB. [2021-08-27 05:23:01,243 INFO L168 Benchmark]: Witness Printer took 3.88 ms. Allocated memory is still 1.6 GB. Free memory was 529.6 MB in the beginning and 528.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 05:23:01,245 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 60.8 MB. Free memory was 43.3 MB in the beginning and 43.3 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 364.11 ms. Allocated memory is still 60.8 MB. Free memory was 38.3 MB in the beginning and 37.6 MB in the end (delta: 774.2 kB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 61.30 ms. Allocated memory is still 60.8 MB. Free memory was 37.6 MB in the beginning and 34.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 563.39 ms. Allocated memory was 60.8 MB in the beginning and 79.7 MB in the end (delta: 18.9 MB). Free memory was 34.6 MB in the beginning and 58.8 MB in the end (delta: -24.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 54246.94 ms. Allocated memory was 79.7 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 58.7 MB in the beginning and 529.6 MB in the end (delta: -470.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 16.1 GB. * Witness Printer took 3.88 ms. Allocated memory is still 1.6 GB. Free memory was 529.6 MB in the beginning and 528.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - UnprovableResult [Line: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [\old(garbage)=49, \old(garbage)=54, \old(pc1)=67, \old(pc4)=50, \old(res4)=60, \old(S)=57, \old(S)=55, \old(t1)=70, \old(t1)=62, \old(t4)=53, \old(t4)=58, \old(x1)=74, \old(x1)=61, \old(x4)=68, \old(x4)=51, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) [L538] x1->data = 0 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L542] x1->data = 4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L545] t1 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L548] x1->next = t1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L551] COND TRUE S == t1 [L552] S = x1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={-1:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=-1, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L567] pc4++ [L568] case 1: [L569] t4 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=-1, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=2, pc4++=1, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L598] RET pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=2, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=2, res4=0, S={-1:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=0, \old(S)=-1, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=-1, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=2, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L567] pc4++ [L568] case 1: [L571] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=-1, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=-1, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=3, pc4++=2, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L572] COND FALSE !(t4 == ((void *)0)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=-1, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=-1, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=3, pc4++=2, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L598] RET pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=3, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=3, res4=0, S={-1:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=-1, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=-1, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=3, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L567] pc4++ [L568] case 1: [L571] case 2: [L575] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=-1, \old(t1)=0, \old(t1)=0, \old(t4)=-1, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=4, pc4++=3, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L576] EXPR t4->next VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=-1, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=-1, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=4, pc4++=3, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, t4->next={0:0}, x1={-1:0}, x4={0:0}] [L576] x4 = t4->next [L598] RET pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=4, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=4, res4=0, S={-1:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=-1, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=-1, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=4, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L567] pc4++ [L568] case 1: [L571] case 2: [L575] case 3: [L578] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=-1, \old(t1)=0, \old(t1)=0, \old(t4)=-1, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=5, pc4++=4, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L579] COND TRUE S == t4 [L580] S = x4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=-1, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=-1, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=5, pc4++=4, res4=0, S={0:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L598] RET pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=5, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc1++=6, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L594] COND FALSE !(S || 1 != pc1 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, \result=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 585]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 585]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 92 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 54132.1ms, OverallIterations: 28, TraceHistogramMax: 11, EmptinessCheckTime: 48.4ms, AutomataDifference: 32709.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2610 SDtfs, 9650 SDslu, 6262 SDs, 0 SdLazy, 21611 SolverSat, 3963 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11386.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2366 GetRequests, 1507 SyntacticMatches, 6 SemanticMatches, 853 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18139 ImplicationChecksByTransitivity, 19591.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=25019occurred in iteration=27, InterpolantAutomatonStates: 737, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3398.8ms AutomataMinimizationTime, 27 MinimizatonAttempts, 27612 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 414.6ms SsaConstructionTime, 1113.8ms SatisfiabilityAnalysisTime, 8167.6ms InterpolantComputationTime, 2592 NumberOfCodeBlocks, 2592 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 2416 ConstructedInterpolants, 10 QuantifiedInterpolants, 11863 SizeOfPredicates, 78 NumberOfNonLiveVariables, 10163 ConjunctsInSsa, 373 ConjunctsInUnsatCore, 45 InterpolantComputations, 9 PerfectInterpolantSequences, 2905/3662 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 could not prove your program: unable to determine feasibility of some traces [2021-08-27 05:23:01,278 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... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 05:23:02,897 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 05:23:02,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 05:23:02,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 05:23:02,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 05:23:02,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 05:23:02,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 05:23:02,923 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 05:23:02,924 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 05:23:02,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 05:23:02,925 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 05:23:02,926 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 05:23:02,926 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 05:23:02,927 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 05:23:02,928 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 05:23:02,929 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 05:23:02,931 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 05:23:02,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 05:23:02,936 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 05:23:02,937 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 05:23:02,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 05:23:02,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 05:23:02,944 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 05:23:02,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 05:23:02,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 05:23:02,946 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 05:23:02,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 05:23:02,947 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 05:23:02,947 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 05:23:02,948 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 05:23:02,948 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 05:23:02,949 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 05:23:02,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 05:23:02,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 05:23:02,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 05:23:02,951 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 05:23:02,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 05:23:02,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 05:23:02,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 05:23:02,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 05:23:02,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 05:23:02,953 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-08-27 05:23:02,973 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 05:23:02,975 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 05:23:02,976 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 05:23:02,976 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 05:23:02,977 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 05:23:02,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 05:23:02,979 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 05:23:02,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 05:23:02,979 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 05:23:02,979 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 05:23:02,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 05:23:02,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 05:23:02,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 05:23:02,981 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 05:23:02,981 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 05:23:02,981 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 05:23:02,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 05:23:02,989 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 05:23:02,989 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-27 05:23:02,989 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-27 05:23:02,989 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 05:23:02,989 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 05:23:02,990 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 05:23:02,990 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 05:23:02,990 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 05:23:02,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 05:23:02,990 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 05:23:02,990 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 05:23:02,991 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-27 05:23:02,991 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-27 05:23:02,991 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 05:23:02,991 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-27 05:23:02,991 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 39b25c4e2cc4769f7c060343bf6a1efac7abb2b9 [2021-08-27 05:23:03,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 05:23:03,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 05:23:03,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 05:23:03,268 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 05:23:03,268 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 05:23:03,269 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.3.i [2021-08-27 05:23:03,318 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1015535fe/2598dcafc69047df9caaaed3eebbbb57/FLAG56cf7a128 [2021-08-27 05:23:03,732 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 05:23:03,733 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.3.i [2021-08-27 05:23:03,745 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1015535fe/2598dcafc69047df9caaaed3eebbbb57/FLAG56cf7a128 [2021-08-27 05:23:03,753 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1015535fe/2598dcafc69047df9caaaed3eebbbb57 [2021-08-27 05:23:03,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 05:23:03,756 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 05:23:03,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 05:23:03,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 05:23:03,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 05:23:03,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:23:03" (1/1) ... [2021-08-27 05:23:03,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5195a61b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:23:03, skipping insertion in model container [2021-08-27 05:23:03,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:23:03" (1/1) ... [2021-08-27 05:23:03,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 05:23:03,782 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 05:23:03,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 05:23:03,980 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 05:23:04,020 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 05:23:04,040 INFO L208 MainTranslator]: Completed translation [2021-08-27 05:23:04,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:23:04 WrapperNode [2021-08-27 05:23:04,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 05:23:04,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 05:23:04,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 05:23:04,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 05:23:04,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:23:04" (1/1) ... [2021-08-27 05:23:04,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:23:04" (1/1) ... [2021-08-27 05:23:04,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:23:04" (1/1) ... [2021-08-27 05:23:04,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:23:04" (1/1) ... [2021-08-27 05:23:04,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:23:04" (1/1) ... [2021-08-27 05:23:04,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:23:04" (1/1) ... [2021-08-27 05:23:04,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:23:04" (1/1) ... [2021-08-27 05:23:04,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 05:23:04,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 05:23:04,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 05:23:04,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 05:23:04,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:23:04" (1/1) ... [2021-08-27 05:23:04,120 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 05:23:04,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 05:23:04,141 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 05:23:04,155 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 05:23:04,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 05:23:04,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 05:23:04,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 05:23:04,177 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 05:23:04,178 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-27 05:23:04,178 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-27 05:23:04,178 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2021-08-27 05:23:04,178 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2021-08-27 05:23:04,178 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2021-08-27 05:23:04,178 INFO L138 BoogieDeclarations]: Found implementation of procedure push [2021-08-27 05:23:04,178 INFO L138 BoogieDeclarations]: Found implementation of procedure pop [2021-08-27 05:23:04,179 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 05:23:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 05:23:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 05:23:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 05:23:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 05:23:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 05:23:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 05:23:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 05:23:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 05:23:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 05:23:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 05:23:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 05:23:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 05:23:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 05:23:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 05:23:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 05:23:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 05:23:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 05:23:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 05:23:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 05:23:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 05:23:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 05:23:04,186 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 05:23:04,186 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-27 05:23:04,186 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-27 05:23:04,186 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2021-08-27 05:23:04,186 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2021-08-27 05:23:04,187 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2021-08-27 05:23:04,187 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 05:23:04,187 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 05:23:04,187 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 05:23:04,187 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 05:23:04,187 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 05:23:04,187 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 05:23:04,187 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 05:23:04,187 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 05:23:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 05:23:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 05:23:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 05:23:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 05:23:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 05:23:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 05:23:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 05:23:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 05:23:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 05:23:04,189 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 05:23:04,189 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 05:23:04,189 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 05:23:04,189 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 05:23:04,189 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 05:23:04,189 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 05:23:04,189 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 05:23:04,189 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 05:23:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 05:23:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 05:23:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 05:23:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 05:23:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 05:23:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 05:23:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 05:23:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 05:23:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 05:23:04,191 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 05:23:04,191 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 05:23:04,191 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 05:23:04,191 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 05:23:04,191 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 05:23:04,191 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 05:23:04,191 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 05:23:04,191 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 05:23:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 05:23:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 05:23:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 05:23:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 05:23:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 05:23:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 05:23:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 05:23:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 05:23:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 05:23:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 05:23:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 05:23:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 05:23:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 05:23:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 05:23:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 05:23:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 05:23:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 05:23:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 05:23:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 05:23:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 05:23:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 05:23:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 05:23:04,195 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 05:23:04,195 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 05:23:04,195 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 05:23:04,195 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 05:23:04,195 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 05:23:04,195 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 05:23:04,195 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 05:23:04,195 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 05:23:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 05:23:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 05:23:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 05:23:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 05:23:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 05:23:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 05:23:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 05:23:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 05:23:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 05:23:04,197 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 05:23:04,197 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 05:23:04,197 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 05:23:04,197 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 05:23:04,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 05:23:04,197 INFO L130 BoogieDeclarations]: Found specification of procedure push [2021-08-27 05:23:04,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 05:23:04,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-27 05:23:04,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 05:23:04,198 INFO L130 BoogieDeclarations]: Found specification of procedure pop [2021-08-27 05:23:04,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 05:23:04,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-27 05:23:04,198 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 05:23:04,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 05:23:04,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 05:23:04,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-27 05:23:04,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 05:23:04,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 05:23:04,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-08-27 05:23:04,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-08-27 05:23:04,757 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 05:23:04,757 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-08-27 05:23:04,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:23:04 BoogieIcfgContainer [2021-08-27 05:23:04,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 05:23:04,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 05:23:04,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 05:23:04,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 05:23:04,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 05:23:03" (1/3) ... [2021-08-27 05:23:04,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9c11ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 05:23:04, skipping insertion in model container [2021-08-27 05:23:04,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:23:04" (2/3) ... [2021-08-27 05:23:04,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9c11ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 05:23:04, skipping insertion in model container [2021-08-27 05:23:04,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:23:04" (3/3) ... [2021-08-27 05:23:04,766 INFO L111 eAbstractionObserver]: Analyzing ICFG lockfree-3.3.i [2021-08-27 05:23:04,770 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 05:23:04,770 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2021-08-27 05:23:04,808 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 05:23:04,814 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 05:23:04,814 INFO L340 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2021-08-27 05:23:04,826 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 65 states have internal predecessors, (82), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 05:23:04,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-27 05:23:04,844 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:23:04,844 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:23:04,844 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr1REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:23:04,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:23:04,848 INFO L82 PathProgramCache]: Analyzing trace with hash 913050877, now seen corresponding path program 1 times [2021-08-27 05:23:04,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:23:04,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646552016] [2021-08-27 05:23:04,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:23:04,857 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:23:04,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:23:04,865 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:23:04,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-27 05:23:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:23:05,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 1 conjunts are in the unsatisfiable core [2021-08-27 05:23:05,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:23:05,082 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 05:23:05,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:23:05,113 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 05:23:05,114 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:23:05,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646552016] [2021-08-27 05:23:05,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [646552016] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:23:05,115 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:23:05,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 05:23:05,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082989450] [2021-08-27 05:23:05,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-27 05:23:05,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:23:05,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-27 05:23:05,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 05:23:05,131 INFO L87 Difference]: Start difference. First operand has 72 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 65 states have internal predecessors, (82), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 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 05:23:05,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:23:05,147 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2021-08-27 05:23:05,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 05:23:05,148 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 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 8 [2021-08-27 05:23:05,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:23:05,154 INFO L225 Difference]: With dead ends: 72 [2021-08-27 05:23:05,155 INFO L226 Difference]: Without dead ends: 69 [2021-08-27 05:23:05,156 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 05:23:05,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-08-27 05:23:05,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-08-27 05:23:05,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 63 states have internal predecessors, (78), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 05:23:05,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2021-08-27 05:23:05,179 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 8 [2021-08-27 05:23:05,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:23:05,179 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2021-08-27 05:23:05,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 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 05:23:05,180 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2021-08-27 05:23:05,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-27 05:23:05,180 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:23:05,180 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:23:05,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-27 05:23:05,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:23:05,392 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:23:05,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:23:05,393 INFO L82 PathProgramCache]: Analyzing trace with hash 913039345, now seen corresponding path program 1 times [2021-08-27 05:23:05,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:23:05,393 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045530935] [2021-08-27 05:23:05,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:23:05,393 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:23:05,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:23:05,395 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:23:05,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-27 05:23:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:23:05,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 05:23:05,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:23:05,642 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 05:23:05,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:23:05,724 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 05:23:05,724 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:23:05,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045530935] [2021-08-27 05:23:05,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045530935] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:23:05,724 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:23:05,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 05:23:05,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082641979] [2021-08-27 05:23:05,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 05:23:05,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:23:05,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 05:23:05,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:23:05,727 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 05:23:05,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:23:05,779 INFO L93 Difference]: Finished difference Result 120 states and 153 transitions. [2021-08-27 05:23:05,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 05:23:05,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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) Word has length 8 [2021-08-27 05:23:05,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:23:05,784 INFO L225 Difference]: With dead ends: 120 [2021-08-27 05:23:05,784 INFO L226 Difference]: Without dead ends: 120 [2021-08-27 05:23:05,784 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:23:05,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-08-27 05:23:05,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2021-08-27 05:23:05,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 71 states have (on average 1.8732394366197183) internal successors, (133), 93 states have internal predecessors, (133), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2021-08-27 05:23:05,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2021-08-27 05:23:05,804 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 8 [2021-08-27 05:23:05,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:23:05,804 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2021-08-27 05:23:05,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 05:23:05,804 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2021-08-27 05:23:05,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 05:23:05,804 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:23:05,804 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:23:05,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-27 05:23:06,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:23:06,005 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:23:06,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:23:06,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1760552785, now seen corresponding path program 1 times [2021-08-27 05:23:06,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:23:06,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614761219] [2021-08-27 05:23:06,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:23:06,007 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:23:06,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:23:06,009 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:23:06,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-27 05:23:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:23:06,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 05:23:06,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:23:06,194 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 05:23:06,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:23:06,228 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 05:23:06,228 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:23:06,229 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614761219] [2021-08-27 05:23:06,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614761219] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:23:06,229 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:23:06,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 05:23:06,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834191916] [2021-08-27 05:23:06,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 05:23:06,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:23:06,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 05:23:06,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:23:06,231 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 05:23:06,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:23:06,334 INFO L93 Difference]: Finished difference Result 128 states and 182 transitions. [2021-08-27 05:23:06,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 05:23:06,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 9 [2021-08-27 05:23:06,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:23:06,337 INFO L225 Difference]: With dead ends: 128 [2021-08-27 05:23:06,337 INFO L226 Difference]: Without dead ends: 125 [2021-08-27 05:23:06,338 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:23:06,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-08-27 05:23:06,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 115. [2021-08-27 05:23:06,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 78 states have (on average 1.8333333333333333) internal successors, (143), 104 states have internal predecessors, (143), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (15), 5 states have call predecessors, (15), 9 states have call successors, (15) [2021-08-27 05:23:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2021-08-27 05:23:06,360 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 9 [2021-08-27 05:23:06,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:23:06,360 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2021-08-27 05:23:06,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 05:23:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2021-08-27 05:23:06,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 05:23:06,361 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:23:06,361 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:23:06,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-27 05:23:06,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:23:06,574 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting pushErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:23:06,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:23:06,575 INFO L82 PathProgramCache]: Analyzing trace with hash 370381771, now seen corresponding path program 1 times [2021-08-27 05:23:06,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:23:06,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481055993] [2021-08-27 05:23:06,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:23:06,575 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:23:06,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:23:06,576 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:23:06,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-27 05:23:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:23:06,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 05:23:06,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:23:06,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:23:06,775 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 05:23:06,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:23:06,802 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 05:23:06,803 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:23:06,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [481055993] [2021-08-27 05:23:06,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [481055993] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:23:06,803 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:23:06,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 05:23:06,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717037868] [2021-08-27 05:23:06,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 05:23:06,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:23:06,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 05:23:06,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:23:06,804 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:23:06,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:23:06,892 INFO L93 Difference]: Finished difference Result 198 states and 290 transitions. [2021-08-27 05:23:06,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 05:23:06,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-08-27 05:23:06,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:23:06,894 INFO L225 Difference]: With dead ends: 198 [2021-08-27 05:23:06,894 INFO L226 Difference]: Without dead ends: 198 [2021-08-27 05:23:06,895 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 05:23:06,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-08-27 05:23:06,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 177. [2021-08-27 05:23:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 134 states have (on average 1.7761194029850746) internal successors, (238), 160 states have internal predecessors, (238), 14 states have call successors, (14), 10 states have call predecessors, (14), 11 states have return successors, (24), 7 states have call predecessors, (24), 13 states have call successors, (24) [2021-08-27 05:23:06,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 276 transitions. [2021-08-27 05:23:06,901 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 276 transitions. Word has length 11 [2021-08-27 05:23:06,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:23:06,901 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 276 transitions. [2021-08-27 05:23:06,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:23:06,902 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 276 transitions. [2021-08-27 05:23:06,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 05:23:06,902 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:23:06,902 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:23:06,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-27 05:23:07,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:23:07,110 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting pushErr1REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:23:07,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:23:07,110 INFO L82 PathProgramCache]: Analyzing trace with hash 370381772, now seen corresponding path program 1 times [2021-08-27 05:23:07,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:23:07,111 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469822962] [2021-08-27 05:23:07,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:23:07,111 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:23:07,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:23:07,112 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:23:07,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-27 05:23:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:23:07,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 05:23:07,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:23:07,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:23:07,312 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 05:23:07,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:23:07,377 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 05:23:07,378 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:23:07,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469822962] [2021-08-27 05:23:07,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469822962] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:23:07,378 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:23:07,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-08-27 05:23:07,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625174960] [2021-08-27 05:23:07,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:23:07,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:23:07,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:23:07,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:23:07,380 INFO L87 Difference]: Start difference. First operand 177 states and 276 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:23:07,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:23:07,591 INFO L93 Difference]: Finished difference Result 333 states and 499 transitions. [2021-08-27 05:23:07,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 05:23:07,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-08-27 05:23:07,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:23:07,595 INFO L225 Difference]: With dead ends: 333 [2021-08-27 05:23:07,595 INFO L226 Difference]: Without dead ends: 333 [2021-08-27 05:23:07,595 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:23:07,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-08-27 05:23:07,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 295. [2021-08-27 05:23:07,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 242 states have (on average 1.7314049586776858) internal successors, (419), 268 states have internal predecessors, (419), 18 states have call successors, (18), 18 states have call predecessors, (18), 19 states have return successors, (35), 9 states have call predecessors, (35), 17 states have call successors, (35) [2021-08-27 05:23:07,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 472 transitions. [2021-08-27 05:23:07,605 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 472 transitions. Word has length 11 [2021-08-27 05:23:07,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:23:07,606 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 472 transitions. [2021-08-27 05:23:07,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:23:07,606 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 472 transitions. [2021-08-27 05:23:07,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 05:23:07,606 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:23:07,607 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:23:07,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-27 05:23:07,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:23:07,813 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting pushErr4REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:23:07,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:23:07,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1403059964, now seen corresponding path program 1 times [2021-08-27 05:23:07,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:23:07,814 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257604499] [2021-08-27 05:23:07,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:23:07,814 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:23:07,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:23:07,816 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:23:07,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-27 05:23:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:23:07,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 05:23:07,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:23:08,030 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 05:23:08,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:23:08,104 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 05:23:08,104 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:23:08,104 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257604499] [2021-08-27 05:23:08,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257604499] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:23:08,104 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:23:08,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-27 05:23:08,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277887882] [2021-08-27 05:23:08,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:23:08,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:23:08,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:23:08,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:23:08,105 INFO L87 Difference]: Start difference. First operand 295 states and 472 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:23:08,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:23:08,141 INFO L93 Difference]: Finished difference Result 197 states and 283 transitions. [2021-08-27 05:23:08,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 05:23:08,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 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 05:23:08,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:23:08,143 INFO L225 Difference]: With dead ends: 197 [2021-08-27 05:23:08,143 INFO L226 Difference]: Without dead ends: 197 [2021-08-27 05:23:08,143 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 05:23:08,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-08-27 05:23:08,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 181. [2021-08-27 05:23:08,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 144 states have (on average 1.6736111111111112) internal successors, (241), 162 states have internal predecessors, (241), 12 states have call successors, (12), 12 states have call predecessors, (12), 13 states have return successors, (18), 7 states have call predecessors, (18), 11 states have call successors, (18) [2021-08-27 05:23:08,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 271 transitions. [2021-08-27 05:23:08,149 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 271 transitions. Word has length 12 [2021-08-27 05:23:08,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:23:08,165 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 271 transitions. [2021-08-27 05:23:08,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:23:08,165 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 271 transitions. [2021-08-27 05:23:08,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 05:23:08,166 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:23:08,166 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:23:08,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-27 05:23:08,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:23:08,376 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:23:08,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:23:08,376 INFO L82 PathProgramCache]: Analyzing trace with hash -2074754906, now seen corresponding path program 1 times [2021-08-27 05:23:08,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:23:08,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731445916] [2021-08-27 05:23:08,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:23:08,376 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:23:08,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:23:08,377 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:23:08,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-27 05:23:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:23:08,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 05:23:08,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:23:08,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 05:23:08,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:23:08,631 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 05:23:08,631 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:23:08,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731445916] [2021-08-27 05:23:08,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731445916] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 05:23:08,631 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 05:23:08,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-27 05:23:08,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415078283] [2021-08-27 05:23:08,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 05:23:08,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:23:08,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 05:23:08,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 05:23:08,633 INFO L87 Difference]: Start difference. First operand 181 states and 271 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:23:08,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:23:08,657 INFO L93 Difference]: Finished difference Result 297 states and 420 transitions. [2021-08-27 05:23:08,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 05:23:08,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-08-27 05:23:08,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:23:08,659 INFO L225 Difference]: With dead ends: 297 [2021-08-27 05:23:08,659 INFO L226 Difference]: Without dead ends: 297 [2021-08-27 05:23:08,659 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 05:23:08,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-08-27 05:23:08,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 281. [2021-08-27 05:23:08,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 216 states have (on average 1.5648148148148149) internal successors, (338), 246 states have internal predecessors, (338), 22 states have call successors, (22), 22 states have call predecessors, (22), 31 states have return successors, (44), 13 states have call predecessors, (44), 21 states have call successors, (44) [2021-08-27 05:23:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 404 transitions. [2021-08-27 05:23:08,666 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 404 transitions. Word has length 13 [2021-08-27 05:23:08,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:23:08,667 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 404 transitions. [2021-08-27 05:23:08,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 05:23:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 404 transitions. [2021-08-27 05:23:08,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-27 05:23:08,667 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:23:08,668 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:23:08,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-27 05:23:08,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:23:08,880 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:23:08,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:23:08,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1772709125, now seen corresponding path program 1 times [2021-08-27 05:23:08,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:23:08,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369366704] [2021-08-27 05:23:08,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:23:08,881 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:23:08,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:23:08,882 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:23:08,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-27 05:23:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:23:09,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 05:23:09,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:23:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:23:09,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:23:09,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:23:09,312 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:23:09,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [369366704] [2021-08-27 05:23:09,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [369366704] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:23:09,313 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:23:09,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-08-27 05:23:09,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328311550] [2021-08-27 05:23:09,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 05:23:09,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:23:09,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 05:23:09,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-08-27 05:23:09,314 INFO L87 Difference]: Start difference. First operand 281 states and 404 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 05:23:09,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:23:09,874 INFO L93 Difference]: Finished difference Result 690 states and 1010 transitions. [2021-08-27 05:23:09,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 05:23:09,874 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 18 [2021-08-27 05:23:09,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:23:09,877 INFO L225 Difference]: With dead ends: 690 [2021-08-27 05:23:09,877 INFO L226 Difference]: Without dead ends: 690 [2021-08-27 05:23:09,878 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 118.1ms TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2021-08-27 05:23:09,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2021-08-27 05:23:09,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 587. [2021-08-27 05:23:09,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 472 states have (on average 1.5423728813559323) internal successors, (728), 520 states have internal predecessors, (728), 42 states have call successors, (42), 42 states have call predecessors, (42), 61 states have return successors, (95), 25 states have call predecessors, (95), 41 states have call successors, (95) [2021-08-27 05:23:09,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 865 transitions. [2021-08-27 05:23:09,896 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 865 transitions. Word has length 18 [2021-08-27 05:23:09,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:23:09,896 INFO L470 AbstractCegarLoop]: Abstraction has 587 states and 865 transitions. [2021-08-27 05:23:09,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 05:23:09,897 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 865 transitions. [2021-08-27 05:23:09,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 05:23:09,898 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:23:09,898 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:23:09,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-08-27 05:23:10,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:23:10,105 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:23:10,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:23:10,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1092083902, now seen corresponding path program 1 times [2021-08-27 05:23:10,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:23:10,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683735647] [2021-08-27 05:23:10,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:23:10,106 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:23:10,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:23:10,107 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:23:10,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-27 05:23:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:23:10,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 05:23:10,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:23:10,404 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:23:10,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:23:10,572 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:23:10,572 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:23:10,572 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683735647] [2021-08-27 05:23:10,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683735647] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:23:10,573 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:23:10,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-08-27 05:23:10,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664446940] [2021-08-27 05:23:10,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 05:23:10,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:23:10,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 05:23:10,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-27 05:23:10,574 INFO L87 Difference]: Start difference. First operand 587 states and 865 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 05:23:11,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:23:11,011 INFO L93 Difference]: Finished difference Result 945 states and 1354 transitions. [2021-08-27 05:23:11,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 05:23:11,017 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2021-08-27 05:23:11,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:23:11,020 INFO L225 Difference]: With dead ends: 945 [2021-08-27 05:23:11,020 INFO L226 Difference]: Without dead ends: 945 [2021-08-27 05:23:11,020 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 163.2ms TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2021-08-27 05:23:11,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2021-08-27 05:23:11,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 837. [2021-08-27 05:23:11,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 666 states have (on average 1.509009009009009) internal successors, (1005), 738 states have internal predecessors, (1005), 62 states have call successors, (62), 62 states have call predecessors, (62), 97 states have return successors, (127), 37 states have call predecessors, (127), 61 states have call successors, (127) [2021-08-27 05:23:11,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1194 transitions. [2021-08-27 05:23:11,040 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1194 transitions. Word has length 20 [2021-08-27 05:23:11,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:23:11,041 INFO L470 AbstractCegarLoop]: Abstraction has 837 states and 1194 transitions. [2021-08-27 05:23:11,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 05:23:11,041 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1194 transitions. [2021-08-27 05:23:11,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 05:23:11,042 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:23:11,042 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:23:11,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-27 05:23:11,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:23:11,250 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:23:11,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:23:11,250 INFO L82 PathProgramCache]: Analyzing trace with hash -389155418, now seen corresponding path program 2 times [2021-08-27 05:23:11,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:23:11,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13443728] [2021-08-27 05:23:11,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 05:23:11,251 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:23:11,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:23:11,251 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:23:11,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-27 05:23:11,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 05:23:11,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 05:23:11,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 05:23:11,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:23:11,604 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 05:23:11,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:23:11,759 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 05:23:11,759 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:23:11,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [13443728] [2021-08-27 05:23:11,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [13443728] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:23:11,759 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:23:11,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-08-27 05:23:11,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278652229] [2021-08-27 05:23:11,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 05:23:11,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:23:11,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 05:23:11,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-27 05:23:11,760 INFO L87 Difference]: Start difference. First operand 837 states and 1194 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 05:23:11,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:23:11,937 INFO L93 Difference]: Finished difference Result 1191 states and 1639 transitions. [2021-08-27 05:23:11,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 05:23:11,937 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2021-08-27 05:23:11,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:23:11,941 INFO L225 Difference]: With dead ends: 1191 [2021-08-27 05:23:11,942 INFO L226 Difference]: Without dead ends: 1191 [2021-08-27 05:23:11,942 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 111.0ms TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-08-27 05:23:11,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2021-08-27 05:23:11,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1147. [2021-08-27 05:23:11,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 908 states have (on average 1.4515418502202644) internal successors, (1318), 1016 states have internal predecessors, (1318), 82 states have call successors, (82), 82 states have call predecessors, (82), 145 states have return successors, (195), 49 states have call predecessors, (195), 81 states have call successors, (195) [2021-08-27 05:23:11,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1595 transitions. [2021-08-27 05:23:11,967 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1595 transitions. Word has length 27 [2021-08-27 05:23:11,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:23:11,967 INFO L470 AbstractCegarLoop]: Abstraction has 1147 states and 1595 transitions. [2021-08-27 05:23:11,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 05:23:11,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1595 transitions. [2021-08-27 05:23:11,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 05:23:11,972 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:23:11,972 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:23:11,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-08-27 05:23:12,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:23:12,180 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:23:12,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:23:12,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1024254868, now seen corresponding path program 1 times [2021-08-27 05:23:12,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:23:12,181 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354264430] [2021-08-27 05:23:12,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:23:12,181 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:23:12,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:23:12,182 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:23:12,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-08-27 05:23:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:23:12,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-27 05:23:12,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:23:12,641 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:23:12,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:23:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:23:12,990 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:23:12,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354264430] [2021-08-27 05:23:12,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354264430] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:23:12,990 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:23:12,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-08-27 05:23:12,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540270624] [2021-08-27 05:23:12,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 05:23:12,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:23:12,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 05:23:12,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-08-27 05:23:12,992 INFO L87 Difference]: Start difference. First operand 1147 states and 1595 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 05:23:13,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:23:13,555 INFO L93 Difference]: Finished difference Result 1680 states and 2292 transitions. [2021-08-27 05:23:13,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 05:23:13,556 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 29 [2021-08-27 05:23:13,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:23:13,562 INFO L225 Difference]: With dead ends: 1680 [2021-08-27 05:23:13,562 INFO L226 Difference]: Without dead ends: 1680 [2021-08-27 05:23:13,562 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 233.1ms TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2021-08-27 05:23:13,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2021-08-27 05:23:13,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1467. [2021-08-27 05:23:13,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 1157 states have (on average 1.418323249783924) internal successors, (1641), 1297 states have internal predecessors, (1641), 107 states have call successors, (107), 107 states have call predecessors, (107), 191 states have return successors, (265), 63 states have call predecessors, (265), 106 states have call successors, (265) [2021-08-27 05:23:13,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 2013 transitions. [2021-08-27 05:23:13,599 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 2013 transitions. Word has length 29 [2021-08-27 05:23:13,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:23:13,599 INFO L470 AbstractCegarLoop]: Abstraction has 1467 states and 2013 transitions. [2021-08-27 05:23:13,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 05:23:13,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2013 transitions. [2021-08-27 05:23:13,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 05:23:13,600 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:23:13,601 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:23:13,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-08-27 05:23:13,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:23:13,809 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:23:13,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:23:13,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1836404925, now seen corresponding path program 1 times [2021-08-27 05:23:13,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:23:13,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319647125] [2021-08-27 05:23:13,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:23:13,811 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:23:13,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:23:13,811 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:23:13,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-08-27 05:23:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:23:14,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 05:23:14,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:23:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:23:14,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:23:14,485 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:23:14,485 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:23:14,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1319647125] [2021-08-27 05:23:14,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1319647125] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:23:14,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:23:14,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2021-08-27 05:23:14,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401668282] [2021-08-27 05:23:14,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 05:23:14,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:23:14,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 05:23:14,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-08-27 05:23:14,486 INFO L87 Difference]: Start difference. First operand 1467 states and 2013 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 05:23:15,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:23:15,256 INFO L93 Difference]: Finished difference Result 1681 states and 2147 transitions. [2021-08-27 05:23:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-27 05:23:15,257 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2021-08-27 05:23:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:23:15,261 INFO L225 Difference]: With dead ends: 1681 [2021-08-27 05:23:15,261 INFO L226 Difference]: Without dead ends: 1497 [2021-08-27 05:23:15,262 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 376.7ms TimeCoverageRelationStatistics Valid=219, Invalid=711, Unknown=0, NotChecked=0, Total=930 [2021-08-27 05:23:15,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2021-08-27 05:23:15,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1379. [2021-08-27 05:23:15,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1379 states, 1071 states have (on average 1.38468720821662) internal successors, (1483), 1209 states have internal predecessors, (1483), 107 states have call successors, (107), 107 states have call predecessors, (107), 189 states have return successors, (237), 63 states have call predecessors, (237), 106 states have call successors, (237) [2021-08-27 05:23:15,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 1827 transitions. [2021-08-27 05:23:15,294 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 1827 transitions. Word has length 30 [2021-08-27 05:23:15,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:23:15,295 INFO L470 AbstractCegarLoop]: Abstraction has 1379 states and 1827 transitions. [2021-08-27 05:23:15,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 05:23:15,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 1827 transitions. [2021-08-27 05:23:15,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 05:23:15,296 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:23:15,297 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:23:15,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-08-27 05:23:15,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:23:15,505 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:23:15,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:23:15,505 INFO L82 PathProgramCache]: Analyzing trace with hash -746793865, now seen corresponding path program 2 times [2021-08-27 05:23:15,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:23:15,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963556798] [2021-08-27 05:23:15,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 05:23:15,506 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:23:15,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:23:15,507 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:23:15,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-08-27 05:23:15,852 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 05:23:15,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 05:23:15,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 05:23:15,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:23:16,050 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 05:23:16,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:23:16,343 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:23:16,344 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:23:16,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963556798] [2021-08-27 05:23:16,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963556798] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:23:16,344 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:23:16,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2021-08-27 05:23:16,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953178732] [2021-08-27 05:23:16,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 05:23:16,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:23:16,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 05:23:16,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-08-27 05:23:16,346 INFO L87 Difference]: Start difference. First operand 1379 states and 1827 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 11 states have internal predecessors, (51), 6 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2021-08-27 05:23:17,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:23:17,223 INFO L93 Difference]: Finished difference Result 2266 states and 3058 transitions. [2021-08-27 05:23:17,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-27 05:23:17,243 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 11 states have internal predecessors, (51), 6 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) Word has length 39 [2021-08-27 05:23:17,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:23:17,250 INFO L225 Difference]: With dead ends: 2266 [2021-08-27 05:23:17,250 INFO L226 Difference]: Without dead ends: 2170 [2021-08-27 05:23:17,250 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 336.1ms TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2021-08-27 05:23:17,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2021-08-27 05:23:17,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 1993. [2021-08-27 05:23:17,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1993 states, 1543 states have (on average 1.4121840570317563) internal successors, (2179), 1753 states have internal predecessors, (2179), 165 states have call successors, (165), 153 states have call predecessors, (165), 273 states have return successors, (421), 87 states have call predecessors, (421), 164 states have call successors, (421) [2021-08-27 05:23:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 2765 transitions. [2021-08-27 05:23:17,293 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 2765 transitions. Word has length 39 [2021-08-27 05:23:17,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:23:17,294 INFO L470 AbstractCegarLoop]: Abstraction has 1993 states and 2765 transitions. [2021-08-27 05:23:17,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 11 states have internal predecessors, (51), 6 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2021-08-27 05:23:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2765 transitions. [2021-08-27 05:23:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 05:23:17,296 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:23:17,296 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:23:17,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-08-27 05:23:17,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:23:17,504 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:23:17,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:23:17,505 INFO L82 PathProgramCache]: Analyzing trace with hash -268124004, now seen corresponding path program 1 times [2021-08-27 05:23:17,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:23:17,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527061094] [2021-08-27 05:23:17,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:23:17,505 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:23:17,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:23:17,506 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:23:17,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-08-27 05:23:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:23:17,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-27 05:23:17,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:23:18,036 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-27 05:23:18,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:23:18,408 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:23:18,409 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:23:18,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527061094] [2021-08-27 05:23:18,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527061094] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:23:18,409 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:23:18,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 16 [2021-08-27 05:23:18,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393414593] [2021-08-27 05:23:18,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 05:23:18,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:23:18,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 05:23:18,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-08-27 05:23:18,410 INFO L87 Difference]: Start difference. First operand 1993 states and 2765 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-08-27 05:23:19,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:23:19,486 INFO L93 Difference]: Finished difference Result 2261 states and 2971 transitions. [2021-08-27 05:23:19,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-08-27 05:23:19,486 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 39 [2021-08-27 05:23:19,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:23:19,493 INFO L225 Difference]: With dead ends: 2261 [2021-08-27 05:23:19,493 INFO L226 Difference]: Without dead ends: 2089 [2021-08-27 05:23:19,494 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 516.4ms TimeCoverageRelationStatistics Valid=308, Invalid=1098, Unknown=0, NotChecked=0, Total=1406 [2021-08-27 05:23:19,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2021-08-27 05:23:19,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1917. [2021-08-27 05:23:19,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1917 states, 1469 states have (on average 1.3921034717494893) internal successors, (2045), 1677 states have internal predecessors, (2045), 165 states have call successors, (165), 153 states have call predecessors, (165), 271 states have return successors, (393), 87 states have call predecessors, (393), 164 states have call successors, (393) [2021-08-27 05:23:19,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 2603 transitions. [2021-08-27 05:23:19,534 INFO L78 Accepts]: Start accepts. Automaton has 1917 states and 2603 transitions. Word has length 39 [2021-08-27 05:23:19,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:23:19,534 INFO L470 AbstractCegarLoop]: Abstraction has 1917 states and 2603 transitions. [2021-08-27 05:23:19,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-08-27 05:23:19,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2603 transitions. [2021-08-27 05:23:19,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-27 05:23:19,535 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:23:19,535 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:23:19,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-08-27 05:23:19,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:23:19,745 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:23:19,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:23:19,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1040706548, now seen corresponding path program 1 times [2021-08-27 05:23:19,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:23:19,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993597738] [2021-08-27 05:23:19,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:23:19,746 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:23:19,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:23:19,747 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:23:19,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-08-27 05:23:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:23:20,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-27 05:23:20,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:23:20,533 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-27 05:23:20,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:23:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:23:21,723 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:23:21,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993597738] [2021-08-27 05:23:21,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993597738] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:23:21,723 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:23:21,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 26 [2021-08-27 05:23:21,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27740082] [2021-08-27 05:23:21,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-27 05:23:21,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:23:21,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-27 05:23:21,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2021-08-27 05:23:21,725 INFO L87 Difference]: Start difference. First operand 1917 states and 2603 transitions. Second operand has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 20 states have internal predecessors, (58), 9 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2021-08-27 05:23:25,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:23:25,200 INFO L93 Difference]: Finished difference Result 3752 states and 4910 transitions. [2021-08-27 05:23:25,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-08-27 05:23:25,201 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 20 states have internal predecessors, (58), 9 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 45 [2021-08-27 05:23:25,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:23:25,213 INFO L225 Difference]: With dead ends: 3752 [2021-08-27 05:23:25,213 INFO L226 Difference]: Without dead ends: 3716 [2021-08-27 05:23:25,215 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1181 ImplicationChecksByTransitivity, 2087.3ms TimeCoverageRelationStatistics Valid=977, Invalid=4279, Unknown=0, NotChecked=0, Total=5256 [2021-08-27 05:23:25,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3716 states. [2021-08-27 05:23:25,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3716 to 3017. [2021-08-27 05:23:25,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3017 states, 2325 states have (on average 1.3372043010752688) internal successors, (3109), 2625 states have internal predecessors, (3109), 257 states have call successors, (257), 257 states have call predecessors, (257), 423 states have return successors, (665), 135 states have call predecessors, (665), 256 states have call successors, (665) [2021-08-27 05:23:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 4031 transitions. [2021-08-27 05:23:25,300 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 4031 transitions. Word has length 45 [2021-08-27 05:23:25,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:23:25,301 INFO L470 AbstractCegarLoop]: Abstraction has 3017 states and 4031 transitions. [2021-08-27 05:23:25,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 20 states have internal predecessors, (58), 9 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2021-08-27 05:23:25,301 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 4031 transitions. [2021-08-27 05:23:25,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-27 05:23:25,302 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:23:25,302 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:23:25,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-08-27 05:23:25,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:23:25,511 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:23:25,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:23:25,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1515964261, now seen corresponding path program 1 times [2021-08-27 05:23:25,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:23:25,512 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765174413] [2021-08-27 05:23:25,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:23:25,512 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:23:25,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:23:25,513 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:23:25,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-08-27 05:23:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:23:25,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-27 05:23:25,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:23:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-27 05:23:26,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:23:26,640 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:23:26,640 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:23:26,640 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765174413] [2021-08-27 05:23:26,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765174413] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:23:26,640 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:23:26,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 19 [2021-08-27 05:23:26,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126135711] [2021-08-27 05:23:26,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 05:23:26,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:23:26,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 05:23:26,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2021-08-27 05:23:26,641 INFO L87 Difference]: Start difference. First operand 3017 states and 4031 transitions. Second operand has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 13 states have internal predecessors, (51), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-08-27 05:23:27,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:23:27,975 INFO L93 Difference]: Finished difference Result 4090 states and 5262 transitions. [2021-08-27 05:23:27,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-08-27 05:23:27,983 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 13 states have internal predecessors, (51), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 48 [2021-08-27 05:23:27,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:23:27,995 INFO L225 Difference]: With dead ends: 4090 [2021-08-27 05:23:27,995 INFO L226 Difference]: Without dead ends: 3950 [2021-08-27 05:23:27,996 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 663.2ms TimeCoverageRelationStatistics Valid=398, Invalid=1494, Unknown=0, NotChecked=0, Total=1892 [2021-08-27 05:23:27,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3950 states. [2021-08-27 05:23:28,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3950 to 3716. [2021-08-27 05:23:28,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3716 states, 2853 states have (on average 1.3168594461969856) internal successors, (3757), 3219 states have internal predecessors, (3757), 326 states have call successors, (326), 326 states have call predecessors, (326), 525 states have return successors, (779), 171 states have call predecessors, (779), 325 states have call successors, (779) [2021-08-27 05:23:28,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3716 states to 3716 states and 4862 transitions. [2021-08-27 05:23:28,067 INFO L78 Accepts]: Start accepts. Automaton has 3716 states and 4862 transitions. Word has length 48 [2021-08-27 05:23:28,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:23:28,067 INFO L470 AbstractCegarLoop]: Abstraction has 3716 states and 4862 transitions. [2021-08-27 05:23:28,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 13 states have internal predecessors, (51), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-08-27 05:23:28,067 INFO L276 IsEmpty]: Start isEmpty. Operand 3716 states and 4862 transitions. [2021-08-27 05:23:28,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-27 05:23:28,068 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:23:28,068 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:23:28,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-08-27 05:23:28,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:23:28,280 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:23:28,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:23:28,280 INFO L82 PathProgramCache]: Analyzing trace with hash 574627678, now seen corresponding path program 1 times [2021-08-27 05:23:28,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:23:28,280 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [110421312] [2021-08-27 05:23:28,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:23:28,280 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:23:28,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:23:28,281 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:23:28,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-08-27 05:23:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:23:28,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 24 conjunts are in the unsatisfiable core [2021-08-27 05:23:28,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:23:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 5 proven. 48 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-08-27 05:23:29,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:23:29,640 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 5 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 05:23:29,640 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:23:29,640 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [110421312] [2021-08-27 05:23:29,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [110421312] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:23:29,640 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:23:29,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 22 [2021-08-27 05:23:29,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89836345] [2021-08-27 05:23:29,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-27 05:23:29,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:23:29,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-27 05:23:29,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2021-08-27 05:23:29,641 INFO L87 Difference]: Start difference. First operand 3716 states and 4862 transitions. Second operand has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 15 states have internal predecessors, (64), 6 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2021-08-27 05:23:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:23:31,634 INFO L93 Difference]: Finished difference Result 4249 states and 5467 transitions. [2021-08-27 05:23:31,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-08-27 05:23:31,636 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 15 states have internal predecessors, (64), 6 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 59 [2021-08-27 05:23:31,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:23:31,646 INFO L225 Difference]: With dead ends: 4249 [2021-08-27 05:23:31,647 INFO L226 Difference]: Without dead ends: 4177 [2021-08-27 05:23:31,648 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 919.0ms TimeCoverageRelationStatistics Valid=493, Invalid=1957, Unknown=0, NotChecked=0, Total=2450 [2021-08-27 05:23:31,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4177 states. [2021-08-27 05:23:31,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4177 to 4017. [2021-08-27 05:23:31,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4017 states, 3083 states have (on average 1.3139798897178074) internal successors, (4051), 3485 states have internal predecessors, (4051), 349 states have call successors, (349), 349 states have call predecessors, (349), 573 states have return successors, (833), 183 states have call predecessors, (833), 348 states have call successors, (833) [2021-08-27 05:23:31,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 5233 transitions. [2021-08-27 05:23:31,720 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 5233 transitions. Word has length 59 [2021-08-27 05:23:31,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:23:31,721 INFO L470 AbstractCegarLoop]: Abstraction has 4017 states and 5233 transitions. [2021-08-27 05:23:31,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 15 states have internal predecessors, (64), 6 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2021-08-27 05:23:31,721 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 5233 transitions. [2021-08-27 05:23:31,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-08-27 05:23:31,722 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:23:31,722 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:23:31,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-08-27 05:23:31,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:23:31,932 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:23:31,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:23:31,933 INFO L82 PathProgramCache]: Analyzing trace with hash 517554629, now seen corresponding path program 2 times [2021-08-27 05:23:31,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:23:31,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356889188] [2021-08-27 05:23:31,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 05:23:31,934 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:23:31,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:23:31,934 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:23:31,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-08-27 05:23:32,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 05:23:32,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 05:23:32,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-27 05:23:32,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:23:33,141 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 49 proven. 49 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-08-27 05:23:33,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:23:35,083 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 20 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 05:23:35,083 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:23:35,083 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356889188] [2021-08-27 05:23:35,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1356889188] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:23:35,083 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:23:35,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21] total 32 [2021-08-27 05:23:35,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850771408] [2021-08-27 05:23:35,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-08-27 05:23:35,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:23:35,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-08-27 05:23:35,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2021-08-27 05:23:35,084 INFO L87 Difference]: Start difference. First operand 4017 states and 5233 transitions. Second operand has 32 states, 32 states have (on average 2.90625) internal successors, (93), 26 states have internal predecessors, (93), 12 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2021-08-27 05:23:40,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:23:40,848 INFO L93 Difference]: Finished difference Result 7214 states and 9448 transitions. [2021-08-27 05:23:40,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-08-27 05:23:40,849 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.90625) internal successors, (93), 26 states have internal predecessors, (93), 12 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) Word has length 70 [2021-08-27 05:23:40,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:23:40,867 INFO L225 Difference]: With dead ends: 7214 [2021-08-27 05:23:40,868 INFO L226 Difference]: Without dead ends: 7154 [2021-08-27 05:23:40,869 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1952 ImplicationChecksByTransitivity, 3717.9ms TimeCoverageRelationStatistics Valid=1482, Invalid=6890, Unknown=0, NotChecked=0, Total=8372 [2021-08-27 05:23:40,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7154 states. [2021-08-27 05:23:40,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7154 to 5071. [2021-08-27 05:23:40,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5071 states, 3907 states have (on average 1.3137957512157665) internal successors, (5133), 4429 states have internal predecessors, (5133), 421 states have call successors, (421), 421 states have call predecessors, (421), 731 states have return successors, (1057), 221 states have call predecessors, (1057), 420 states have call successors, (1057) [2021-08-27 05:23:40,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5071 states to 5071 states and 6611 transitions. [2021-08-27 05:23:40,993 INFO L78 Accepts]: Start accepts. Automaton has 5071 states and 6611 transitions. Word has length 70 [2021-08-27 05:23:40,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:23:40,994 INFO L470 AbstractCegarLoop]: Abstraction has 5071 states and 6611 transitions. [2021-08-27 05:23:40,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.90625) internal successors, (93), 26 states have internal predecessors, (93), 12 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2021-08-27 05:23:40,995 INFO L276 IsEmpty]: Start isEmpty. Operand 5071 states and 6611 transitions. [2021-08-27 05:23:40,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-27 05:23:40,995 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:23:40,995 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:23:41,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-08-27 05:23:41,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:23:41,205 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:23:41,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:23:41,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1608789574, now seen corresponding path program 1 times [2021-08-27 05:23:41,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:23:41,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [225069901] [2021-08-27 05:23:41,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:23:41,206 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:23:41,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:23:41,207 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:23:41,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-08-27 05:23:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:23:41,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-27 05:23:41,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:23:42,118 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 32 proven. 52 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-08-27 05:23:42,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:23:42,505 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 26 proven. 58 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-08-27 05:23:42,505 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:23:42,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [225069901] [2021-08-27 05:23:42,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [225069901] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:23:42,505 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:23:42,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-08-27 05:23:42,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551263436] [2021-08-27 05:23:42,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 05:23:42,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:23:42,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 05:23:42,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-27 05:23:42,506 INFO L87 Difference]: Start difference. First operand 5071 states and 6611 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (7), 5 states have call predecessors, (7), 8 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-08-27 05:23:42,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:23:42,964 INFO L93 Difference]: Finished difference Result 9835 states and 12944 transitions. [2021-08-27 05:23:42,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 05:23:42,965 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (7), 5 states have call predecessors, (7), 8 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 71 [2021-08-27 05:23:42,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:23:42,988 INFO L225 Difference]: With dead ends: 9835 [2021-08-27 05:23:42,988 INFO L226 Difference]: Without dead ends: 9835 [2021-08-27 05:23:42,989 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 110.5ms TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2021-08-27 05:23:42,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9835 states. [2021-08-27 05:23:43,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9835 to 9811. [2021-08-27 05:23:43,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9811 states, 7495 states have (on average 1.313809206137425) internal successors, (9847), 8623 states have internal predecessors, (9847), 778 states have call successors, (778), 778 states have call predecessors, (778), 1526 states have return successors, (2299), 410 states have call predecessors, (2299), 777 states have call successors, (2299) [2021-08-27 05:23:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9811 states to 9811 states and 12924 transitions. [2021-08-27 05:23:43,151 INFO L78 Accepts]: Start accepts. Automaton has 9811 states and 12924 transitions. Word has length 71 [2021-08-27 05:23:43,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:23:43,151 INFO L470 AbstractCegarLoop]: Abstraction has 9811 states and 12924 transitions. [2021-08-27 05:23:43,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (7), 5 states have call predecessors, (7), 8 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-08-27 05:23:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand 9811 states and 12924 transitions. [2021-08-27 05:23:43,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-08-27 05:23:43,153 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:23:43,153 INFO L512 BasicCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:23:43,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-08-27 05:23:43,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:23:43,363 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:23:43,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:23:43,363 INFO L82 PathProgramCache]: Analyzing trace with hash -511357765, now seen corresponding path program 1 times [2021-08-27 05:23:43,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:23:43,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065508051] [2021-08-27 05:23:43,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:23:43,364 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:23:43,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:23:43,365 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:23:43,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-08-27 05:23:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:23:44,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 26 conjunts are in the unsatisfiable core [2021-08-27 05:23:44,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:23:44,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:23:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 32 proven. 47 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-27 05:23:44,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:23:45,252 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 29 proven. 50 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-27 05:23:45,253 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:23:45,253 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065508051] [2021-08-27 05:23:45,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065508051] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:23:45,253 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:23:45,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2021-08-27 05:23:45,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372734627] [2021-08-27 05:23:45,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 05:23:45,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:23:45,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 05:23:45,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-08-27 05:23:45,255 INFO L87 Difference]: Start difference. First operand 9811 states and 12924 transitions. Second operand has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 states have internal predecessors, (64), 4 states have call successors, (10), 8 states have call predecessors, (10), 10 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2021-08-27 05:23:47,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:23:47,030 INFO L93 Difference]: Finished difference Result 16626 states and 22220 transitions. [2021-08-27 05:23:47,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-27 05:23:47,031 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 states have internal predecessors, (64), 4 states have call successors, (10), 8 states have call predecessors, (10), 10 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 79 [2021-08-27 05:23:47,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:23:47,068 INFO L225 Difference]: With dead ends: 16626 [2021-08-27 05:23:47,069 INFO L226 Difference]: Without dead ends: 16626 [2021-08-27 05:23:47,069 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 144 SyntacticMatches, 9 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 722.1ms TimeCoverageRelationStatistics Valid=302, Invalid=888, Unknown=0, NotChecked=0, Total=1190 [2021-08-27 05:23:47,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16626 states. [2021-08-27 05:23:47,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16626 to 14338. [2021-08-27 05:23:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14338 states, 11019 states have (on average 1.329793992195299) internal successors, (14653), 12646 states have internal predecessors, (14653), 1114 states have call successors, (1114), 1114 states have call predecessors, (1114), 2194 states have return successors, (3523), 578 states have call predecessors, (3523), 1113 states have call successors, (3523) [2021-08-27 05:23:47,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14338 states to 14338 states and 19290 transitions. [2021-08-27 05:23:47,332 INFO L78 Accepts]: Start accepts. Automaton has 14338 states and 19290 transitions. Word has length 79 [2021-08-27 05:23:47,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:23:47,332 INFO L470 AbstractCegarLoop]: Abstraction has 14338 states and 19290 transitions. [2021-08-27 05:23:47,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 states have internal predecessors, (64), 4 states have call successors, (10), 8 states have call predecessors, (10), 10 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2021-08-27 05:23:47,333 INFO L276 IsEmpty]: Start isEmpty. Operand 14338 states and 19290 transitions. [2021-08-27 05:23:47,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-08-27 05:23:47,338 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:23:47,338 INFO L512 BasicCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:23:47,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-08-27 05:23:47,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:23:47,549 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting popErr1REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:23:47,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:23:47,549 INFO L82 PathProgramCache]: Analyzing trace with hash -511357764, now seen corresponding path program 1 times [2021-08-27 05:23:47,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:23:47,549 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481472083] [2021-08-27 05:23:47,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:23:47,549 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:23:47,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:23:47,550 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:23:47,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-08-27 05:23:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:23:48,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 43 conjunts are in the unsatisfiable core [2021-08-27 05:23:48,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:23:48,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 05:23:49,209 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 32 proven. 47 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-27 05:23:49,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:23:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 29 proven. 50 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-27 05:23:51,389 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:23:51,389 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481472083] [2021-08-27 05:23:51,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481472083] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:23:51,389 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:23:51,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2021-08-27 05:23:51,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128296061] [2021-08-27 05:23:51,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-27 05:23:51,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:23:51,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 05:23:51,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-08-27 05:23:51,390 INFO L87 Difference]: Start difference. First operand 14338 states and 19290 transitions. Second operand has 18 states, 17 states have (on average 4.647058823529412) internal successors, (79), 18 states have internal predecessors, (79), 7 states have call successors, (11), 9 states have call predecessors, (11), 11 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2021-08-27 05:23:55,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:23:55,900 INFO L93 Difference]: Finished difference Result 22975 states and 31271 transitions. [2021-08-27 05:23:55,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-08-27 05:23:55,903 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.647058823529412) internal successors, (79), 18 states have internal predecessors, (79), 7 states have call successors, (11), 9 states have call predecessors, (11), 11 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) Word has length 79 [2021-08-27 05:23:55,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:23:55,965 INFO L225 Difference]: With dead ends: 22975 [2021-08-27 05:23:55,965 INFO L226 Difference]: Without dead ends: 22975 [2021-08-27 05:23:55,966 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 2551.0ms TimeCoverageRelationStatistics Valid=481, Invalid=1411, Unknown=0, NotChecked=0, Total=1892 [2021-08-27 05:23:55,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22975 states. [2021-08-27 05:23:56,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22975 to 19568. [2021-08-27 05:23:56,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19568 states, 15241 states have (on average 1.3503707105832952) internal successors, (20581), 17376 states have internal predecessors, (20581), 1446 states have call successors, (1446), 1446 states have call predecessors, (1446), 2870 states have return successors, (4913), 746 states have call predecessors, (4913), 1445 states have call successors, (4913) [2021-08-27 05:23:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19568 states to 19568 states and 26940 transitions. [2021-08-27 05:23:56,330 INFO L78 Accepts]: Start accepts. Automaton has 19568 states and 26940 transitions. Word has length 79 [2021-08-27 05:23:56,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:23:56,331 INFO L470 AbstractCegarLoop]: Abstraction has 19568 states and 26940 transitions. [2021-08-27 05:23:56,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.647058823529412) internal successors, (79), 18 states have internal predecessors, (79), 7 states have call successors, (11), 9 states have call predecessors, (11), 11 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2021-08-27 05:23:56,331 INFO L276 IsEmpty]: Start isEmpty. Operand 19568 states and 26940 transitions. [2021-08-27 05:23:56,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-27 05:23:56,333 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:23:56,334 INFO L512 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:23:56,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-08-27 05:23:56,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:23:56,544 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:23:56,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:23:56,545 INFO L82 PathProgramCache]: Analyzing trace with hash 175036294, now seen corresponding path program 1 times [2021-08-27 05:23:56,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:23:56,545 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991332730] [2021-08-27 05:23:56,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:23:56,545 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:23:56,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:23:56,546 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:23:56,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-08-27 05:23:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 05:23:57,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-27 05:23:57,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:23:57,823 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 59 proven. 36 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2021-08-27 05:23:57,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:23:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 29 proven. 42 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2021-08-27 05:23:58,333 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:23:58,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991332730] [2021-08-27 05:23:58,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991332730] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:23:58,333 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:23:58,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 16 [2021-08-27 05:23:58,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996138059] [2021-08-27 05:23:58,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 05:23:58,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:23:58,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 05:23:58,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-08-27 05:23:58,334 INFO L87 Difference]: Start difference. First operand 19568 states and 26940 transitions. Second operand has 16 states, 16 states have (on average 5.0625) internal successors, (81), 12 states have internal predecessors, (81), 5 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-08-27 05:23:59,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:23:59,432 INFO L93 Difference]: Finished difference Result 26145 states and 35199 transitions. [2021-08-27 05:23:59,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-08-27 05:23:59,435 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 12 states have internal predecessors, (81), 5 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 98 [2021-08-27 05:23:59,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:23:59,496 INFO L225 Difference]: With dead ends: 26145 [2021-08-27 05:23:59,496 INFO L226 Difference]: Without dead ends: 24927 [2021-08-27 05:23:59,497 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 522.5ms TimeCoverageRelationStatistics Valid=317, Invalid=1165, Unknown=0, NotChecked=0, Total=1482 [2021-08-27 05:23:59,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24927 states. [2021-08-27 05:23:59,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24927 to 23061. [2021-08-27 05:23:59,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23061 states, 17872 states have (on average 1.3545210384959714) internal successors, (24208), 20491 states have internal predecessors, (24208), 1698 states have call successors, (1698), 1698 states have call predecessors, (1698), 3480 states have return successors, (5737), 872 states have call predecessors, (5737), 1697 states have call successors, (5737) [2021-08-27 05:23:59,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23061 states to 23061 states and 31643 transitions. [2021-08-27 05:23:59,915 INFO L78 Accepts]: Start accepts. Automaton has 23061 states and 31643 transitions. Word has length 98 [2021-08-27 05:23:59,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:23:59,915 INFO L470 AbstractCegarLoop]: Abstraction has 23061 states and 31643 transitions. [2021-08-27 05:23:59,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 12 states have internal predecessors, (81), 5 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-08-27 05:23:59,916 INFO L276 IsEmpty]: Start isEmpty. Operand 23061 states and 31643 transitions. [2021-08-27 05:23:59,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-08-27 05:23:59,919 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:23:59,919 INFO L512 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:23:59,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-08-27 05:24:00,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:24:00,131 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:24:00,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:24:00,131 INFO L82 PathProgramCache]: Analyzing trace with hash -159277390, now seen corresponding path program 2 times [2021-08-27 05:24:00,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:24:00,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612261029] [2021-08-27 05:24:00,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 05:24:00,132 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:24:00,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:24:00,133 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:24:00,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-08-27 05:24:01,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 05:24:01,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 05:24:01,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-27 05:24:01,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 05:24:01,715 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 92 proven. 37 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-27 05:24:01,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 05:24:02,482 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 48 proven. 57 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-08-27 05:24:02,482 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 05:24:02,482 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612261029] [2021-08-27 05:24:02,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612261029] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 05:24:02,482 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 05:24:02,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 20 [2021-08-27 05:24:02,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71416208] [2021-08-27 05:24:02,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-27 05:24:02,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 05:24:02,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-27 05:24:02,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-08-27 05:24:02,484 INFO L87 Difference]: Start difference. First operand 23061 states and 31643 transitions. Second operand has 20 states, 20 states have (on average 5.15) internal successors, (103), 16 states have internal predecessors, (103), 8 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2021-08-27 05:24:04,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 05:24:04,663 INFO L93 Difference]: Finished difference Result 65936 states and 93992 transitions. [2021-08-27 05:24:04,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-08-27 05:24:04,664 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.15) internal successors, (103), 16 states have internal predecessors, (103), 8 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) Word has length 107 [2021-08-27 05:24:04,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 05:24:04,884 INFO L225 Difference]: With dead ends: 65936 [2021-08-27 05:24:04,884 INFO L226 Difference]: Without dead ends: 64256 [2021-08-27 05:24:04,884 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1242.3ms TimeCoverageRelationStatistics Valid=605, Invalid=2475, Unknown=0, NotChecked=0, Total=3080 [2021-08-27 05:24:04,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64256 states. [2021-08-27 05:24:05,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64256 to 61721. [2021-08-27 05:24:05,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61721 states, 48744 states have (on average 1.338667323157722) internal successors, (65252), 54131 states have internal predecessors, (65252), 5038 states have call successors, (5038), 5038 states have call predecessors, (5038), 7928 states have return successors, (18397), 2552 states have call predecessors, (18397), 5037 states have call successors, (18397) [2021-08-27 05:24:06,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61721 states to 61721 states and 88687 transitions. [2021-08-27 05:24:06,190 INFO L78 Accepts]: Start accepts. Automaton has 61721 states and 88687 transitions. Word has length 107 [2021-08-27 05:24:06,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 05:24:06,191 INFO L470 AbstractCegarLoop]: Abstraction has 61721 states and 88687 transitions. [2021-08-27 05:24:06,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.15) internal successors, (103), 16 states have internal predecessors, (103), 8 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2021-08-27 05:24:06,191 INFO L276 IsEmpty]: Start isEmpty. Operand 61721 states and 88687 transitions. [2021-08-27 05:24:06,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-08-27 05:24:06,204 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 05:24:06,213 INFO L512 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 05:24:06,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-08-27 05:24:06,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:24:06,424 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-27 05:24:06,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 05:24:06,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1851960145, now seen corresponding path program 1 times [2021-08-27 05:24:06,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 05:24:06,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816962472] [2021-08-27 05:24:06,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 05:24:06,425 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 05:24:06,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 05:24:06,427 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 05:24:06,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-08-27 05:24:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 05:24:07,802 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 05:24:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 05:24:08,151 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-08-27 05:24:08,152 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 05:24:08,152 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr5ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 05:24:08,153 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr0REQUIRES_VIOLATION [2021-08-27 05:24:08,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr1REQUIRES_VIOLATION [2021-08-27 05:24:08,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr2REQUIRES_VIOLATION [2021-08-27 05:24:08,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr3REQUIRES_VIOLATION [2021-08-27 05:24:08,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr4REQUIRES_VIOLATION [2021-08-27 05:24:08,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr5REQUIRES_VIOLATION [2021-08-27 05:24:08,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr6REQUIRES_VIOLATION [2021-08-27 05:24:08,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr7REQUIRES_VIOLATION [2021-08-27 05:24:08,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr0REQUIRES_VIOLATION [2021-08-27 05:24:08,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr1REQUIRES_VIOLATION [2021-08-27 05:24:08,154 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr2REQUIRES_VIOLATION [2021-08-27 05:24:08,155 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr3REQUIRES_VIOLATION [2021-08-27 05:24:08,155 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr4REQUIRES_VIOLATION [2021-08-27 05:24:08,155 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr5REQUIRES_VIOLATION [2021-08-27 05:24:08,155 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 05:24:08,155 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 05:24:08,155 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:24:08,155 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:24:08,155 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 05:24:08,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-08-27 05:24:08,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 05:24:08,374 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 05:24:08,402 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2021-08-27 05:24:08,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 05:24:08 BoogieIcfgContainer [2021-08-27 05:24:08,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 05:24:08,456 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 05:24:08,456 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 05:24:08,456 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 05:24:08,457 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:23:04" (3/4) ... [2021-08-27 05:24:08,459 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 05:24:08,459 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 05:24:08,460 INFO L168 Benchmark]: Toolchain (without parser) took 64703.37 ms. Allocated memory was 54.5 MB in the beginning and 1.3 GB in the end (delta: 1.3 GB). Free memory was 30.4 MB in the beginning and 817.3 MB in the end (delta: -786.9 MB). Peak memory consumption was 492.7 MB. Max. memory is 16.1 GB. [2021-08-27 05:24:08,460 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 54.5 MB. Free memory was 36.8 MB in the beginning and 36.7 MB in the end (delta: 38.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 05:24:08,460 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.27 ms. Allocated memory was 54.5 MB in the beginning and 69.2 MB in the end (delta: 14.7 MB). Free memory was 30.2 MB in the beginning and 44.2 MB in the end (delta: -14.1 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2021-08-27 05:24:08,461 INFO L168 Benchmark]: Boogie Preprocessor took 68.38 ms. Allocated memory is still 69.2 MB. Free memory was 44.2 MB in the beginning and 41.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 05:24:08,462 INFO L168 Benchmark]: RCFGBuilder took 646.39 ms. Allocated memory is still 69.2 MB. Free memory was 41.0 MB in the beginning and 38.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 19.2 MB. Max. memory is 16.1 GB. [2021-08-27 05:24:08,462 INFO L168 Benchmark]: TraceAbstraction took 63695.25 ms. Allocated memory was 69.2 MB in the beginning and 1.3 GB in the end (delta: 1.3 GB). Free memory was 38.1 MB in the beginning and 818.4 MB in the end (delta: -780.3 MB). Peak memory consumption was 484.6 MB. Max. memory is 16.1 GB. [2021-08-27 05:24:08,462 INFO L168 Benchmark]: Witness Printer took 2.82 ms. Allocated memory is still 1.3 GB. Free memory is still 817.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 05:24:08,463 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.14 ms. Allocated memory is still 54.5 MB. Free memory was 36.8 MB in the beginning and 36.7 MB in the end (delta: 38.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 286.27 ms. Allocated memory was 54.5 MB in the beginning and 69.2 MB in the end (delta: 14.7 MB). Free memory was 30.2 MB in the beginning and 44.2 MB in the end (delta: -14.1 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 68.38 ms. Allocated memory is still 69.2 MB. Free memory was 44.2 MB in the beginning and 41.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 646.39 ms. Allocated memory is still 69.2 MB. Free memory was 41.0 MB in the beginning and 38.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 19.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 63695.25 ms. Allocated memory was 69.2 MB in the beginning and 1.3 GB in the end (delta: 1.3 GB). Free memory was 38.1 MB in the beginning and 818.4 MB in the end (delta: -780.3 MB). Peak memory consumption was 484.6 MB. Max. memory is 16.1 GB. * Witness Printer took 2.82 ms. Allocated memory is still 1.3 GB. Free memory is still 817.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - UnprovableResult [Line: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=18, \old(pc4)=28, \old(res4)=22, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) [L538] x1->data = 0 VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L542] x1->data = 4 VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L545] t1 = S VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L548] x1->next = t1 VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L551] COND TRUE S == t1 [L552] S = x1 VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={1:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=1, res4=0, S={1:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=1, res4=0, S={1:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L567] pc4++ [L568] case 1: [L569] t4 = S VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=2, pc4++=1, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L598] RET pop() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=2, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=2, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L567] pc4++ [L568] case 1: [L571] case 2: VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=3, pc4++=2, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L572] COND FALSE !(t4 == ((void *)0)) VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=3, pc4++=2, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L598] RET pop() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=3, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=3, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L567] pc4++ [L568] case 1: [L571] case 2: [L575] case 3: VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=4, pc4++=3, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L576] EXPR t4->next VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=4, pc4++=3, res4=0, S={1:0}, t1={0:0}, t4={1:0}, t4->next={0:0}, x1={1:0}, x4={0:0}] [L576] x4 = t4->next [L598] RET pop() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=4, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=4, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L567] pc4++ [L568] case 1: [L571] case 2: [L575] case 3: [L578] case 4: VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=5, pc4++=4, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L579] COND TRUE S == t4 [L580] S = x4 VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=5, pc4++=4, res4=0, S={0:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L598] RET pop() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=1, pc1++=6, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L594] COND FALSE !(S || 1 != pc1 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, \result=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 585]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 585]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 96 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 63565.7ms, OverallIterations: 24, TraceHistogramMax: 10, EmptinessCheckTime: 62.6ms, AutomataDifference: 28175.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3107 SDtfs, 16252 SDslu, 5564 SDs, 0 SdLazy, 14139 SolverSat, 3928 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12833.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2263 GetRequests, 1651 SyntacticMatches, 10 SemanticMatches, 602 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6128 ImplicationChecksByTransitivity, 14440.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=61721occurred in iteration=23, InterpolantAutomatonStates: 468, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3162.6ms AutomataMinimizationTime, 23 MinimizatonAttempts, 14350 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 476.5ms SsaConstructionTime, 1844.4ms SatisfiabilityAnalysisTime, 16176.2ms InterpolantComputationTime, 1039 NumberOfCodeBlocks, 1039 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1814 ConstructedInterpolants, 20 QuantifiedInterpolants, 11966 SizeOfPredicates, 83 NumberOfNonLiveVariables, 6593 ConjunctsInSsa, 325 ConjunctsInUnsatCore, 46 InterpolantComputations, 14 PerfectInterpolantSequences, 1431/2450 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 could not prove your program: unable to determine feasibility of some traces [2021-08-27 05:24:08,502 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...