./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version ae007674 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/list-ext3-properties/dll_nullified-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7887c90df48e0e32a16c0ae4217eb11a41b3b1af1e02493e847dc25239198c19 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 05:41:26,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 05:41:26,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 05:41:26,675 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 05:41:26,677 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 05:41:26,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 05:41:26,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 05:41:26,688 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 05:41:26,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 05:41:26,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 05:41:26,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 05:41:26,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 05:41:26,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 05:41:26,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 05:41:26,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 05:41:26,692 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 05:41:26,693 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 05:41:26,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 05:41:26,694 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 05:41:26,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 05:41:26,696 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 05:41:26,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 05:41:26,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 05:41:26,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 05:41:26,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 05:41:26,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 05:41:26,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 05:41:26,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 05:41:26,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 05:41:26,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 05:41:26,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 05:41:26,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 05:41:26,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 05:41:26,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 05:41:26,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 05:41:26,711 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 05:41:26,712 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 05:41:26,712 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 05:41:26,712 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 05:41:26,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 05:41:26,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 05:41:26,715 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-12-28 05:41:26,738 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 05:41:26,738 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 05:41:26,739 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 05:41:26,739 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 05:41:26,740 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 05:41:26,740 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 05:41:26,740 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 05:41:26,741 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 05:41:26,741 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 05:41:26,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 05:41:26,741 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 05:41:26,742 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 05:41:26,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 05:41:26,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 05:41:26,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 05:41:26,742 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 05:41:26,742 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 05:41:26,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 05:41:26,743 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 05:41:26,743 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 05:41:26,743 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 05:41:26,743 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 05:41:26,743 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 05:41:26,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 05:41:26,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:41:26,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 05:41:26,744 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 05:41:26,744 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 05:41:26,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 05:41:26,744 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7887c90df48e0e32a16c0ae4217eb11a41b3b1af1e02493e847dc25239198c19 [2021-12-28 05:41:27,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 05:41:27,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 05:41:27,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 05:41:27,028 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 05:41:27,029 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 05:41:27,030 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2021-12-28 05:41:27,078 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca3c2ad05/f6f2fa981b5c49e4b43d805e054dc8cc/FLAG8306b8115 [2021-12-28 05:41:27,473 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 05:41:27,474 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2021-12-28 05:41:27,485 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca3c2ad05/f6f2fa981b5c49e4b43d805e054dc8cc/FLAG8306b8115 [2021-12-28 05:41:27,840 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca3c2ad05/f6f2fa981b5c49e4b43d805e054dc8cc [2021-12-28 05:41:27,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 05:41:27,843 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 05:41:27,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 05:41:27,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 05:41:27,856 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 05:41:27,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:41:27" (1/1) ... [2021-12-28 05:41:27,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b884bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:27, skipping insertion in model container [2021-12-28 05:41:27,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:41:27" (1/1) ... [2021-12-28 05:41:27,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 05:41:27,895 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 05:41:28,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i[24046,24059] [2021-12-28 05:41:28,146 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:41:28,154 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 05:41:28,187 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i[24046,24059] [2021-12-28 05:41:28,189 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:41:28,212 INFO L208 MainTranslator]: Completed translation [2021-12-28 05:41:28,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:28 WrapperNode [2021-12-28 05:41:28,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 05:41:28,214 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 05:41:28,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 05:41:28,215 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 05:41:28,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:28" (1/1) ... [2021-12-28 05:41:28,242 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:28" (1/1) ... [2021-12-28 05:41:28,265 INFO L137 Inliner]: procedures = 123, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117 [2021-12-28 05:41:28,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 05:41:28,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 05:41:28,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 05:41:28,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 05:41:28,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:28" (1/1) ... [2021-12-28 05:41:28,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:28" (1/1) ... [2021-12-28 05:41:28,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:28" (1/1) ... [2021-12-28 05:41:28,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:28" (1/1) ... [2021-12-28 05:41:28,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:28" (1/1) ... [2021-12-28 05:41:28,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:28" (1/1) ... [2021-12-28 05:41:28,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:28" (1/1) ... [2021-12-28 05:41:28,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 05:41:28,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 05:41:28,309 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 05:41:28,309 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 05:41:28,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:28" (1/1) ... [2021-12-28 05:41:28,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:41:28,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:28,333 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-28 05:41:28,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-28 05:41:28,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 05:41:28,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 05:41:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 05:41:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 05:41:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 05:41:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 05:41:28,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 05:41:28,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 05:41:28,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 05:41:28,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 05:41:28,460 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 05:41:28,461 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 05:41:28,695 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 05:41:28,699 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 05:41:28,700 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-28 05:41:28,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:41:28 BoogieIcfgContainer [2021-12-28 05:41:28,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 05:41:28,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 05:41:28,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 05:41:28,704 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 05:41:28,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:41:27" (1/3) ... [2021-12-28 05:41:28,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421bf0e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:41:28, skipping insertion in model container [2021-12-28 05:41:28,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:28" (2/3) ... [2021-12-28 05:41:28,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421bf0e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:41:28, skipping insertion in model container [2021-12-28 05:41:28,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:41:28" (3/3) ... [2021-12-28 05:41:28,706 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2021-12-28 05:41:28,709 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 05:41:28,709 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2021-12-28 05:41:28,743 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 05:41:28,749 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, mAutomataTypeConcurrency=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-12-28 05:41:28,749 INFO L340 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2021-12-28 05:41:28,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 87 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:28,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-28 05:41:28,765 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:28,766 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-28 05:41:28,766 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2021-12-28 05:41:28,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:28,770 INFO L85 PathProgramCache]: Analyzing trace with hash 28699851, now seen corresponding path program 1 times [2021-12-28 05:41:28,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:28,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033744269] [2021-12-28 05:41:28,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:28,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:28,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:28,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033744269] [2021-12-28 05:41:28,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033744269] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:28,898 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:28,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:41:28,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132092942] [2021-12-28 05:41:28,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:28,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:28,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:28,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:28,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:28,922 INFO L87 Difference]: Start difference. First operand has 88 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 87 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:29,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:29,002 INFO L93 Difference]: Finished difference Result 144 states and 161 transitions. [2021-12-28 05:41:29,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:29,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-28 05:41:29,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:29,019 INFO L225 Difference]: With dead ends: 144 [2021-12-28 05:41:29,019 INFO L226 Difference]: Without dead ends: 139 [2021-12-28 05:41:29,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:29,024 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 88 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:29,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 168 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:29,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-28 05:41:29,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 80. [2021-12-28 05:41:29,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.78) internal successors, (89), 79 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2021-12-28 05:41:29,056 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 5 [2021-12-28 05:41:29,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:29,056 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2021-12-28 05:41:29,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:29,057 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2021-12-28 05:41:29,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-28 05:41:29,057 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:29,058 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-28 05:41:29,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 05:41:29,058 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2021-12-28 05:41:29,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:29,060 INFO L85 PathProgramCache]: Analyzing trace with hash 28699852, now seen corresponding path program 1 times [2021-12-28 05:41:29,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:29,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238615086] [2021-12-28 05:41:29,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:29,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:29,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:29,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:29,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238615086] [2021-12-28 05:41:29,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238615086] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:29,108 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:29,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:41:29,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256570008] [2021-12-28 05:41:29,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:29,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:29,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:29,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:29,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:29,111 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:29,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:29,198 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2021-12-28 05:41:29,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:29,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-28 05:41:29,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:29,200 INFO L225 Difference]: With dead ends: 134 [2021-12-28 05:41:29,200 INFO L226 Difference]: Without dead ends: 134 [2021-12-28 05:41:29,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:29,201 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 80 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:29,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 169 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:29,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-28 05:41:29,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 75. [2021-12-28 05:41:29,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.68) internal successors, (84), 74 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:29,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2021-12-28 05:41:29,205 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 5 [2021-12-28 05:41:29,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:29,205 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2021-12-28 05:41:29,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:29,206 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2021-12-28 05:41:29,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-28 05:41:29,206 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:29,206 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-28 05:41:29,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 05:41:29,207 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2021-12-28 05:41:29,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:29,207 INFO L85 PathProgramCache]: Analyzing trace with hash 889673528, now seen corresponding path program 1 times [2021-12-28 05:41:29,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:29,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222941189] [2021-12-28 05:41:29,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:29,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:29,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:29,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:29,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222941189] [2021-12-28 05:41:29,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222941189] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:29,224 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:29,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:41:29,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530317733] [2021-12-28 05:41:29,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:29,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:29,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:29,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:29,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:29,226 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:29,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:29,236 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2021-12-28 05:41:29,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:29,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-28 05:41:29,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:29,237 INFO L225 Difference]: With dead ends: 90 [2021-12-28 05:41:29,238 INFO L226 Difference]: Without dead ends: 90 [2021-12-28 05:41:29,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:29,239 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:29,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 158 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:41:29,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-28 05:41:29,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 76. [2021-12-28 05:41:29,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 75 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:29,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2021-12-28 05:41:29,249 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 6 [2021-12-28 05:41:29,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:29,250 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2021-12-28 05:41:29,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:29,250 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2021-12-28 05:41:29,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-28 05:41:29,251 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:29,251 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:29,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 05:41:29,251 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2021-12-28 05:41:29,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:29,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1959623991, now seen corresponding path program 1 times [2021-12-28 05:41:29,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:29,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164845227] [2021-12-28 05:41:29,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:29,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:29,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:29,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:29,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164845227] [2021-12-28 05:41:29,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164845227] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:29,307 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:29,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:41:29,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833987542] [2021-12-28 05:41:29,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:29,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:29,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:29,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:29,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:29,309 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:29,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:29,319 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2021-12-28 05:41:29,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:29,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-28 05:41:29,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:29,321 INFO L225 Difference]: With dead ends: 87 [2021-12-28 05:41:29,321 INFO L226 Difference]: Without dead ends: 87 [2021-12-28 05:41:29,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:29,322 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:29,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 157 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:41:29,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-28 05:41:29,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2021-12-28 05:41:29,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 85 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:29,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2021-12-28 05:41:29,326 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 14 [2021-12-28 05:41:29,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:29,326 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2021-12-28 05:41:29,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:29,326 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2021-12-28 05:41:29,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-28 05:41:29,327 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:29,328 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:29,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 05:41:29,329 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2021-12-28 05:41:29,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:29,329 INFO L85 PathProgramCache]: Analyzing trace with hash 866232140, now seen corresponding path program 1 times [2021-12-28 05:41:29,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:29,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625766546] [2021-12-28 05:41:29,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:29,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:29,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:29,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625766546] [2021-12-28 05:41:29,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625766546] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:41:29,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224846796] [2021-12-28 05:41:29,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:29,397 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:29,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:29,399 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:41:29,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-28 05:41:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:29,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 05:41:29,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:29,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:29,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:29,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:29,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224846796] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:41:29,611 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:41:29,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2021-12-28 05:41:29,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163375842] [2021-12-28 05:41:29,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:41:29,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:41:29,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:29,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:41:29,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:41:29,613 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:29,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:29,641 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2021-12-28 05:41:29,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:41:29,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-28 05:41:29,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:29,648 INFO L225 Difference]: With dead ends: 118 [2021-12-28 05:41:29,648 INFO L226 Difference]: Without dead ends: 118 [2021-12-28 05:41:29,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:41:29,651 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 66 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:29,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 249 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:41:29,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-28 05:41:29,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2021-12-28 05:41:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.4831460674157304) internal successors, (132), 113 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:29,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2021-12-28 05:41:29,656 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 18 [2021-12-28 05:41:29,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:29,656 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2021-12-28 05:41:29,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:29,656 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2021-12-28 05:41:29,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 05:41:29,657 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:29,657 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:29,675 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-12-28 05:41:29,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:29,862 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2021-12-28 05:41:29,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:29,862 INFO L85 PathProgramCache]: Analyzing trace with hash 829454667, now seen corresponding path program 1 times [2021-12-28 05:41:29,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:29,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887398183] [2021-12-28 05:41:29,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:29,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:29,950 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:29,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:29,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887398183] [2021-12-28 05:41:29,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887398183] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:41:29,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624477229] [2021-12-28 05:41:29,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:29,952 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:29,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:29,953 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:41:29,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-28 05:41:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:30,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-28 05:41:30,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:30,070 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:41:30,115 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-28 05:41:30,115 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-28 05:41:30,136 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:30,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:30,340 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:30,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624477229] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:41:30,340 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:41:30,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2021-12-28 05:41:30,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034807465] [2021-12-28 05:41:30,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:41:30,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:41:30,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:30,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:41:30,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:41:30,342 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:30,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:30,414 INFO L93 Difference]: Finished difference Result 145 states and 163 transitions. [2021-12-28 05:41:30,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:41:30,414 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-28 05:41:30,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:30,415 INFO L225 Difference]: With dead ends: 145 [2021-12-28 05:41:30,415 INFO L226 Difference]: Without dead ends: 145 [2021-12-28 05:41:30,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:41:30,418 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 156 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:30,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 182 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2021-12-28 05:41:30,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-12-28 05:41:30,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 113. [2021-12-28 05:41:30,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 89 states have (on average 1.449438202247191) internal successors, (129), 112 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:30,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2021-12-28 05:41:30,435 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 26 [2021-12-28 05:41:30,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:30,436 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2021-12-28 05:41:30,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:30,437 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2021-12-28 05:41:30,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 05:41:30,438 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:30,439 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:30,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-28 05:41:30,647 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,SelfDestructingSolverStorable5 [2021-12-28 05:41:30,648 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2021-12-28 05:41:30,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:30,648 INFO L85 PathProgramCache]: Analyzing trace with hash 829454668, now seen corresponding path program 1 times [2021-12-28 05:41:30,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:30,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907551104] [2021-12-28 05:41:30,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:30,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:30,748 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:30,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:30,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907551104] [2021-12-28 05:41:30,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907551104] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:41:30,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893721300] [2021-12-28 05:41:30,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:30,749 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:30,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:30,750 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:41:30,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-28 05:41:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:30,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-28 05:41:30,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:30,851 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:41:30,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:41:30,930 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-28 05:41:30,936 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:41:30,936 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 05:41:30,977 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:30,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:31,209 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2021-12-28 05:41:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:31,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893721300] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:41:31,315 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:41:31,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-12-28 05:41:31,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491613101] [2021-12-28 05:41:31,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:41:31,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 05:41:31,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:31,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 05:41:31,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-28 05:41:31,316 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:31,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:31,418 INFO L93 Difference]: Finished difference Result 147 states and 163 transitions. [2021-12-28 05:41:31,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:41:31,419 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-28 05:41:31,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:31,419 INFO L225 Difference]: With dead ends: 147 [2021-12-28 05:41:31,419 INFO L226 Difference]: Without dead ends: 147 [2021-12-28 05:41:31,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-12-28 05:41:31,420 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 628 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:31,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [628 Valid, 100 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 68 Unchecked, 0.1s Time] [2021-12-28 05:41:31,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-28 05:41:31,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 112. [2021-12-28 05:41:31,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 111 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:31,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2021-12-28 05:41:31,423 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 26 [2021-12-28 05:41:31,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:31,423 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2021-12-28 05:41:31,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:31,423 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2021-12-28 05:41:31,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-28 05:41:31,424 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:31,424 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:31,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-28 05:41:31,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:31,641 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2021-12-28 05:41:31,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:31,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1598053496, now seen corresponding path program 2 times [2021-12-28 05:41:31,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:31,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024730640] [2021-12-28 05:41:31,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:31,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:31,701 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 50 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-28 05:41:31,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:31,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024730640] [2021-12-28 05:41:31,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024730640] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:41:31,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284705028] [2021-12-28 05:41:31,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 05:41:31,702 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:31,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:31,704 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:41:31,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-28 05:41:31,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-28 05:41:31,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 05:41:31,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-28 05:41:31,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:31,934 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:31,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:32,023 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:32,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284705028] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:41:32,024 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:41:32,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 9 [2021-12-28 05:41:32,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087774952] [2021-12-28 05:41:32,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:41:32,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 05:41:32,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:32,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 05:41:32,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:41:32,026 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:32,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:32,127 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2021-12-28 05:41:32,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 05:41:32,127 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-12-28 05:41:32,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:32,128 INFO L225 Difference]: With dead ends: 125 [2021-12-28 05:41:32,128 INFO L226 Difference]: Without dead ends: 125 [2021-12-28 05:41:32,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-12-28 05:41:32,129 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 219 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:32,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 275 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:32,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-28 05:41:32,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-28 05:41:32,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 124 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:32,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2021-12-28 05:41:32,131 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 54 [2021-12-28 05:41:32,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:32,131 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2021-12-28 05:41:32,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:32,132 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2021-12-28 05:41:32,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-28 05:41:32,133 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:32,133 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:32,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-28 05:41:32,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:32,349 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2021-12-28 05:41:32,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:32,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1121714636, now seen corresponding path program 1 times [2021-12-28 05:41:32,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:32,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137732574] [2021-12-28 05:41:32,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:32,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2021-12-28 05:41:32,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:32,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137732574] [2021-12-28 05:41:32,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137732574] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:32,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:32,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:41:32,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548069898] [2021-12-28 05:41:32,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:32,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:41:32,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:32,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:41:32,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:41:32,451 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:32,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:32,576 INFO L93 Difference]: Finished difference Result 171 states and 189 transitions. [2021-12-28 05:41:32,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:41:32,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-12-28 05:41:32,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:32,577 INFO L225 Difference]: With dead ends: 171 [2021-12-28 05:41:32,577 INFO L226 Difference]: Without dead ends: 171 [2021-12-28 05:41:32,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:41:32,578 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 410 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:32,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 91 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:32,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-12-28 05:41:32,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 152. [2021-12-28 05:41:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 129 states have (on average 1.4031007751937985) internal successors, (181), 151 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:32,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 181 transitions. [2021-12-28 05:41:32,580 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 181 transitions. Word has length 70 [2021-12-28 05:41:32,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:32,580 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 181 transitions. [2021-12-28 05:41:32,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:32,581 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 181 transitions. [2021-12-28 05:41:32,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-28 05:41:32,581 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:32,581 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:32,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 05:41:32,581 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2021-12-28 05:41:32,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:32,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1121714635, now seen corresponding path program 1 times [2021-12-28 05:41:32,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:32,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914661106] [2021-12-28 05:41:32,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:32,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:32,694 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2021-12-28 05:41:32,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:32,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914661106] [2021-12-28 05:41:32,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914661106] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:32,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:32,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:41:32,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275469367] [2021-12-28 05:41:32,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:32,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:41:32,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:32,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:41:32,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:41:32,702 INFO L87 Difference]: Start difference. First operand 152 states and 181 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:32,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:32,790 INFO L93 Difference]: Finished difference Result 171 states and 193 transitions. [2021-12-28 05:41:32,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:41:32,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-12-28 05:41:32,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:32,792 INFO L225 Difference]: With dead ends: 171 [2021-12-28 05:41:32,792 INFO L226 Difference]: Without dead ends: 171 [2021-12-28 05:41:32,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:41:32,793 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 252 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:32,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 122 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:32,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-12-28 05:41:32,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 146. [2021-12-28 05:41:32,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 131 states have (on average 1.282442748091603) internal successors, (168), 145 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:32,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 168 transitions. [2021-12-28 05:41:32,795 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 168 transitions. Word has length 70 [2021-12-28 05:41:32,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:32,796 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 168 transitions. [2021-12-28 05:41:32,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:32,796 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 168 transitions. [2021-12-28 05:41:32,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-28 05:41:32,796 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:32,796 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:32,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 05:41:32,797 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2021-12-28 05:41:32,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:32,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1909311012, now seen corresponding path program 1 times [2021-12-28 05:41:32,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:32,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137295706] [2021-12-28 05:41:32,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:32,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:32,857 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2021-12-28 05:41:32,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:32,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137295706] [2021-12-28 05:41:32,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137295706] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:32,858 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:32,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:41:32,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427049736] [2021-12-28 05:41:32,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:32,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:41:32,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:32,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:41:32,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:41:32,859 INFO L87 Difference]: Start difference. First operand 146 states and 168 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:32,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:32,953 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2021-12-28 05:41:32,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:41:32,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-12-28 05:41:32,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:32,954 INFO L225 Difference]: With dead ends: 152 [2021-12-28 05:41:32,954 INFO L226 Difference]: Without dead ends: 152 [2021-12-28 05:41:32,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:41:32,955 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 333 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:32,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 116 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:32,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-28 05:41:32,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 146. [2021-12-28 05:41:32,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 145 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:32,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 167 transitions. [2021-12-28 05:41:32,958 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 167 transitions. Word has length 74 [2021-12-28 05:41:32,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:32,958 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 167 transitions. [2021-12-28 05:41:32,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:32,959 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 167 transitions. [2021-12-28 05:41:32,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-28 05:41:32,960 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:32,961 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:32,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 05:41:32,961 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2021-12-28 05:41:32,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:32,962 INFO L85 PathProgramCache]: Analyzing trace with hash -522705552, now seen corresponding path program 1 times [2021-12-28 05:41:32,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:32,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803816678] [2021-12-28 05:41:32,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:32,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-12-28 05:41:33,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:33,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803816678] [2021-12-28 05:41:33,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803816678] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:41:33,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821534367] [2021-12-28 05:41:33,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:33,129 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:33,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:33,130 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:41:33,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-28 05:41:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:33,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-28 05:41:33,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:33,359 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:41:33,386 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:41:33,386 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 05:41:33,406 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:41:33,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:41:33,428 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-28 05:41:33,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:41:33,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:41:33,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:41:33,467 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-28 05:41:33,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:41:33,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:41:33,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:41:33,491 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-28 05:41:33,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:41:33,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:41:33,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:41:33,508 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-28 05:41:33,535 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-28 05:41:33,619 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:33,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2021-12-28 05:41:33,628 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 78 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-28 05:41:33,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:33,656 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2021-12-28 05:41:33,679 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1546 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1546)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2021-12-28 05:41:33,698 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1545 Int) (v_ArrVal_1546 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) v_ArrVal_1545) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1546)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2021-12-28 05:41:33,706 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1543 Int) (v_ArrVal_1545 Int) (v_ArrVal_1546 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1543) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) v_ArrVal_1545) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1546)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2021-12-28 05:41:33,729 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1543 Int) (v_ArrVal_1545 Int) (v_ArrVal_1546 Int)) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1543) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) v_ArrVal_1545) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1546)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) is different from false [2021-12-28 05:41:33,824 INFO L353 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2021-12-28 05:41:33,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 59 [2021-12-28 05:41:33,828 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-28 05:41:33,828 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 26 [2021-12-28 05:41:33,830 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-28 05:41:33,900 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 78 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 9 not checked. [2021-12-28 05:41:33,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821534367] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:41:33,900 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:41:33,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 16] total 26 [2021-12-28 05:41:33,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231979364] [2021-12-28 05:41:33,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:41:33,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-28 05:41:33,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:33,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-28 05:41:33,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=367, Unknown=5, NotChecked=210, Total=650 [2021-12-28 05:41:33,903 INFO L87 Difference]: Start difference. First operand 146 states and 167 transitions. Second operand has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:34,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:34,484 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2021-12-28 05:41:34,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-28 05:41:34,485 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-12-28 05:41:34,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:34,485 INFO L225 Difference]: With dead ends: 185 [2021-12-28 05:41:34,485 INFO L226 Difference]: Without dead ends: 185 [2021-12-28 05:41:34,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 5 IntricatePredicates, 3 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=395, Invalid=1260, Unknown=5, NotChecked=410, Total=2070 [2021-12-28 05:41:34,486 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 638 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 511 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:34,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [638 Valid, 560 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 491 Invalid, 0 Unknown, 511 Unchecked, 0.2s Time] [2021-12-28 05:41:34,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-12-28 05:41:34,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 146. [2021-12-28 05:41:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 131 states have (on average 1.2671755725190839) internal successors, (166), 145 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 166 transitions. [2021-12-28 05:41:34,489 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 166 transitions. Word has length 78 [2021-12-28 05:41:34,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:34,489 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 166 transitions. [2021-12-28 05:41:34,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:34,489 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 166 transitions. [2021-12-28 05:41:34,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-28 05:41:34,490 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:34,490 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:34,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-28 05:41:34,699 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,SelfDestructingSolverStorable11 [2021-12-28 05:41:34,699 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2021-12-28 05:41:34,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:34,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1817927893, now seen corresponding path program 1 times [2021-12-28 05:41:34,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:34,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710736438] [2021-12-28 05:41:34,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:34,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:34,905 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 65 proven. 44 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-28 05:41:34,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:34,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710736438] [2021-12-28 05:41:34,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710736438] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:41:34,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443581501] [2021-12-28 05:41:34,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:34,906 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:34,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:34,907 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:41:34,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-28 05:41:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:35,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-28 05:41:35,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:35,144 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:41:35,169 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:41:35,169 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 05:41:35,191 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-28 05:41:35,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:41:35,224 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-28 05:41:35,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:41:35,241 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-28 05:41:35,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:41:35,254 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-28 05:41:35,271 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-28 05:41:35,354 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-28 05:41:35,362 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 78 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-28 05:41:35,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:35,613 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:41:35,617 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:35,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2021-12-28 05:41:35,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2021-12-28 05:41:35,624 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-28 05:41:35,751 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 78 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-28 05:41:35,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443581501] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:41:35,751 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:41:35,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 16] total 31 [2021-12-28 05:41:35,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264027845] [2021-12-28 05:41:35,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:41:35,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-28 05:41:35,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:35,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-28 05:41:35,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=819, Unknown=5, NotChecked=0, Total=930 [2021-12-28 05:41:35,753 INFO L87 Difference]: Start difference. First operand 146 states and 166 transitions. Second operand has 31 states, 31 states have (on average 3.967741935483871) internal successors, (123), 31 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:36,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:36,273 INFO L93 Difference]: Finished difference Result 177 states and 195 transitions. [2021-12-28 05:41:36,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 05:41:36,274 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.967741935483871) internal successors, (123), 31 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-12-28 05:41:36,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:36,274 INFO L225 Difference]: With dead ends: 177 [2021-12-28 05:41:36,274 INFO L226 Difference]: Without dead ends: 177 [2021-12-28 05:41:36,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 151 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=366, Invalid=1521, Unknown=5, NotChecked=0, Total=1892 [2021-12-28 05:41:36,275 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 770 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:36,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [770 Valid, 516 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 477 Invalid, 0 Unknown, 17 Unchecked, 0.3s Time] [2021-12-28 05:41:36,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-12-28 05:41:36,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 146. [2021-12-28 05:41:36,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 131 states have (on average 1.2595419847328244) internal successors, (165), 145 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:36,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 165 transitions. [2021-12-28 05:41:36,278 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 165 transitions. Word has length 80 [2021-12-28 05:41:36,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:36,279 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 165 transitions. [2021-12-28 05:41:36,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.967741935483871) internal successors, (123), 31 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:36,279 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 165 transitions. [2021-12-28 05:41:36,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-12-28 05:41:36,279 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:36,279 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:36,300 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-12-28 05:41:36,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:36,500 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2021-12-28 05:41:36,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:36,500 INFO L85 PathProgramCache]: Analyzing trace with hash 182605743, now seen corresponding path program 1 times [2021-12-28 05:41:36,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:36,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373494199] [2021-12-28 05:41:36,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:36,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:36,633 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-12-28 05:41:36,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:36,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373494199] [2021-12-28 05:41:36,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373494199] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:41:36,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719554390] [2021-12-28 05:41:36,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:36,634 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:36,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:36,635 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:41:36,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-28 05:41:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:36,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-28 05:41:36,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:36,879 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:41:36,955 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:41:36,955 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 05:41:37,027 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-28 05:41:37,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:41:37,053 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-28 05:41:37,073 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:37,073 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2021-12-28 05:41:37,152 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:37,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2021-12-28 05:41:37,223 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 78 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-28 05:41:37,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:37,483 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2304 (Array Int Int)) (|v_ULTIMATE.start_main_~head~1#1.offset_34| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_34|) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2304) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_34| 4)) 0)) (and (<= |v_ULTIMATE.start_main_~head~1#1.offset_34| 0) (not (= |v_ULTIMATE.start_main_~head~1#1.offset_34| 0))))) is different from false [2021-12-28 05:41:37,534 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2304 (Array Int Int)) (|v_ULTIMATE.start_main_~head~1#1.offset_34| Int) (v_ArrVal_2301 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_34|) (and (<= |v_ULTIMATE.start_main_~head~1#1.offset_34| 0) (not (= |v_ULTIMATE.start_main_~head~1#1.offset_34| 0))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2301)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2304) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_34| 4)) 0)))) is different from false [2021-12-28 05:41:37,542 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:41:37,546 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:37,546 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2021-12-28 05:41:37,553 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:37,553 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 39 [2021-12-28 05:41:37,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2021-12-28 05:41:37,897 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 78 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 3 not checked. [2021-12-28 05:41:37,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719554390] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:41:37,898 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:41:37,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 32 [2021-12-28 05:41:37,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172069890] [2021-12-28 05:41:37,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:41:37,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-28 05:41:37,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:37,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-28 05:41:37,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=794, Unknown=2, NotChecked=114, Total=992 [2021-12-28 05:41:37,900 INFO L87 Difference]: Start difference. First operand 146 states and 165 transitions. Second operand has 32 states, 32 states have (on average 3.84375) internal successors, (123), 32 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:38,328 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2304 (Array Int Int)) (|v_ULTIMATE.start_main_~head~1#1.offset_34| Int) (v_ArrVal_2301 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_34|) (and (<= |v_ULTIMATE.start_main_~head~1#1.offset_34| 0) (not (= |v_ULTIMATE.start_main_~head~1#1.offset_34| 0))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2301)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2304) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_34| 4)) 0)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2021-12-28 05:41:38,770 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (forall ((v_ArrVal_2304 (Array Int Int)) (|v_ULTIMATE.start_main_~head~1#1.offset_34| Int) (v_ArrVal_2301 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~head~1#1.offset_34|) (and (<= |v_ULTIMATE.start_main_~head~1#1.offset_34| 0) (not (= |v_ULTIMATE.start_main_~head~1#1.offset_34| 0))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2301)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2304) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_34| 4)) 0)))) (<= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= .cse0 0)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0))) is different from false [2021-12-28 05:41:39,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:39,104 INFO L93 Difference]: Finished difference Result 164 states and 178 transitions. [2021-12-28 05:41:39,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-28 05:41:39,104 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.84375) internal successors, (123), 32 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-12-28 05:41:39,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:39,105 INFO L225 Difference]: With dead ends: 164 [2021-12-28 05:41:39,105 INFO L226 Difference]: Without dead ends: 160 [2021-12-28 05:41:39,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=346, Invalid=1922, Unknown=4, NotChecked=380, Total=2652 [2021-12-28 05:41:39,106 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 574 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 366 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:39,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [574 Valid, 783 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 505 Invalid, 0 Unknown, 366 Unchecked, 0.2s Time] [2021-12-28 05:41:39,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-28 05:41:39,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 132. [2021-12-28 05:41:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 131 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:39,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 147 transitions. [2021-12-28 05:41:39,108 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 147 transitions. Word has length 81 [2021-12-28 05:41:39,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:39,108 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 147 transitions. [2021-12-28 05:41:39,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.84375) internal successors, (123), 32 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:39,109 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 147 transitions. [2021-12-28 05:41:39,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-12-28 05:41:39,109 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:39,109 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:39,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-28 05:41:39,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:39,310 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2021-12-28 05:41:39,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:39,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1021407014, now seen corresponding path program 1 times [2021-12-28 05:41:39,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:39,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461177397] [2021-12-28 05:41:39,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:39,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 05:41:39,366 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 05:41:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 05:41:39,475 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 05:41:39,476 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-28 05:41:39,476 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK (34 of 35 remaining) [2021-12-28 05:41:39,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (33 of 35 remaining) [2021-12-28 05:41:39,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (32 of 35 remaining) [2021-12-28 05:41:39,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (31 of 35 remaining) [2021-12-28 05:41:39,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (30 of 35 remaining) [2021-12-28 05:41:39,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (29 of 35 remaining) [2021-12-28 05:41:39,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (28 of 35 remaining) [2021-12-28 05:41:39,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (27 of 35 remaining) [2021-12-28 05:41:39,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (26 of 35 remaining) [2021-12-28 05:41:39,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (25 of 35 remaining) [2021-12-28 05:41:39,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (24 of 35 remaining) [2021-12-28 05:41:39,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (23 of 35 remaining) [2021-12-28 05:41:39,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (22 of 35 remaining) [2021-12-28 05:41:39,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (21 of 35 remaining) [2021-12-28 05:41:39,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (20 of 35 remaining) [2021-12-28 05:41:39,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (19 of 35 remaining) [2021-12-28 05:41:39,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (18 of 35 remaining) [2021-12-28 05:41:39,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (17 of 35 remaining) [2021-12-28 05:41:39,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (16 of 35 remaining) [2021-12-28 05:41:39,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (15 of 35 remaining) [2021-12-28 05:41:39,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (14 of 35 remaining) [2021-12-28 05:41:39,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (13 of 35 remaining) [2021-12-28 05:41:39,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (12 of 35 remaining) [2021-12-28 05:41:39,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (11 of 35 remaining) [2021-12-28 05:41:39,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (10 of 35 remaining) [2021-12-28 05:41:39,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (9 of 35 remaining) [2021-12-28 05:41:39,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (8 of 35 remaining) [2021-12-28 05:41:39,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (7 of 35 remaining) [2021-12-28 05:41:39,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (6 of 35 remaining) [2021-12-28 05:41:39,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (5 of 35 remaining) [2021-12-28 05:41:39,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (4 of 35 remaining) [2021-12-28 05:41:39,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE (3 of 35 remaining) [2021-12-28 05:41:39,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (2 of 35 remaining) [2021-12-28 05:41:39,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (1 of 35 remaining) [2021-12-28 05:41:39,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (0 of 35 remaining) [2021-12-28 05:41:39,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 05:41:39,485 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:39,487 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 05:41:39,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 05:41:39 BoogieIcfgContainer [2021-12-28 05:41:39,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 05:41:39,547 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 05:41:39,547 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 05:41:39,547 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 05:41:39,548 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:41:28" (3/4) ... [2021-12-28 05:41:39,549 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-28 05:41:39,600 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 05:41:39,600 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 05:41:39,601 INFO L158 Benchmark]: Toolchain (without parser) took 11758.09ms. Allocated memory was 62.9MB in the beginning and 136.3MB in the end (delta: 73.4MB). Free memory was 42.6MB in the beginning and 96.5MB in the end (delta: -53.9MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2021-12-28 05:41:39,601 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 62.9MB. Free memory was 45.4MB in the beginning and 45.4MB in the end (delta: 49.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 05:41:39,602 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.31ms. Allocated memory is still 62.9MB. Free memory was 42.3MB in the beginning and 40.2MB in the end (delta: 2.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-28 05:41:39,602 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.28ms. Allocated memory is still 62.9MB. Free memory was 40.0MB in the beginning and 37.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 05:41:39,602 INFO L158 Benchmark]: Boogie Preprocessor took 41.91ms. Allocated memory is still 62.9MB. Free memory was 37.9MB in the beginning and 36.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 05:41:39,603 INFO L158 Benchmark]: RCFGBuilder took 391.97ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 36.4MB in the beginning and 51.2MB in the end (delta: -14.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-28 05:41:39,603 INFO L158 Benchmark]: TraceAbstraction took 10844.45ms. Allocated memory was 77.6MB in the beginning and 136.3MB in the end (delta: 58.7MB). Free memory was 50.8MB in the beginning and 101.8MB in the end (delta: -50.9MB). Peak memory consumption was 76.5MB. Max. memory is 16.1GB. [2021-12-28 05:41:39,603 INFO L158 Benchmark]: Witness Printer took 53.55ms. Allocated memory is still 136.3MB. Free memory was 101.8MB in the beginning and 96.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-28 05:41:39,605 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 62.9MB. Free memory was 45.4MB in the beginning and 45.4MB in the end (delta: 49.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.31ms. Allocated memory is still 62.9MB. Free memory was 42.3MB in the beginning and 40.2MB in the end (delta: 2.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.28ms. Allocated memory is still 62.9MB. Free memory was 40.0MB in the beginning and 37.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.91ms. Allocated memory is still 62.9MB. Free memory was 37.9MB in the beginning and 36.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 391.97ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 36.4MB in the beginning and 51.2MB in the end (delta: -14.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10844.45ms. Allocated memory was 77.6MB in the beginning and 136.3MB in the end (delta: 58.7MB). Free memory was 50.8MB in the beginning and 101.8MB in the end (delta: -50.9MB). Peak memory consumption was 76.5MB. Max. memory is 16.1GB. * Witness Printer took 53.55ms. Allocated memory is still 136.3MB. Free memory was 101.8MB in the beginning and 96.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 616]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L599] const int len = 5; [L600] CALL, EXPR dll_create(len) [L579] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, new_head={-1:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, new_head={-1:0}] [L588] new_head->next = head VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L590] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-1:0}, len=4, new_head={-1:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-1:0}, len=4, new_head={-2:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-1:0}, len=4, new_head={-2:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-2:0}, len=3, new_head={-2:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=3, new_head={-3:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=3, new_head={-3:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-3:0}, len=2, new_head={-3:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=2, new_head={-4:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=2, new_head={-4:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-4:0}, len=1, new_head={-4:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=1, new_head={-5:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=1, new_head={-5:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-5:0}, len=0, new_head={-5:0}] [L580] COND FALSE !(len > 0) VAL [\old(len)=5, head={-5:0}, len=0, new_head={-5:0}] [L596] return head; VAL [\old(len)=5, \result={-5:0}, head={-5:0}, len=0, new_head={-5:0}] [L600] RET, EXPR dll_create(len) [L600] DLL head = dll_create(len); [L601] head->next VAL [head={-5:0}, head->next={-4:0}, len=5] [L601] COND TRUE head->next [L602] EXPR head->data_0 VAL [head={-5:0}, head->data_0=0, len=5] [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, len=5] [L602] EXPR head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] EXPR head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L602] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L616] reach_error() VAL [head={-5:0}, len=5] - 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: 587]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 587]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 591]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 598]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 88 locations, 35 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4232 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4232 mSDsluCounter, 3646 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 999 IncrementalHoareTripleChecker+Unchecked, 2676 mSDsCounter, 199 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2293 IncrementalHoareTripleChecker+Invalid, 3491 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 199 mSolverCounterUnsat, 970 mSDtfsCounter, 2293 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 904 GetRequests, 701 SyntacticMatches, 7 SemanticMatches, 196 ConstructedPredicates, 9 IntricatePredicates, 3 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=9, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 352 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1052 NumberOfCodeBlocks, 1052 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1305 ConstructedInterpolants, 61 QuantifiedInterpolants, 6443 SizeOfPredicates, 50 NumberOfNonLiveVariables, 3161 ConjunctsInSsa, 152 ConjunctsInUnsatCore, 28 InterpolantComputations, 7 PerfectInterpolantSequences, 1502/1869 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-28 05:41:39,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)