./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0220.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0220.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1080615baa8f6ab055f34c400ddd3cb1288c5bcfd5f3427bea182230e940eff7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:45:01,914 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:45:01,916 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:45:01,939 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:45:01,941 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:45:01,944 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:45:01,946 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:45:01,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:45:01,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:45:01,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:45:01,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:45:01,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:45:01,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:45:01,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:45:01,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:45:01,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:45:01,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:45:01,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:45:01,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:45:01,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:45:01,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:45:01,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:45:01,977 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:45:01,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:45:01,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:45:01,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:45:01,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:45:01,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:45:01,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:45:01,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:45:01,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:45:01,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:45:01,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:45:01,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:45:01,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:45:01,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:45:01,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:45:01,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:45:01,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:45:01,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:45:01,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:45:01,990 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:45:02,019 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:45:02,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:45:02,020 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:45:02,020 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:45:02,021 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:45:02,021 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:45:02,021 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:45:02,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:45:02,022 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:45:02,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:45:02,023 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:45:02,023 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:45:02,023 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:45:02,023 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:45:02,023 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:45:02,024 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:45:02,024 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:45:02,024 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:45:02,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:45:02,024 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:45:02,024 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:45:02,025 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:45:02,025 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:45:02,025 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:45:02,025 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:45:02,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:45:02,025 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:45:02,026 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:45:02,026 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:45:02,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:45:02,027 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1080615baa8f6ab055f34c400ddd3cb1288c5bcfd5f3427bea182230e940eff7 [2022-02-20 23:45:02,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:45:02,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:45:02,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:45:02,216 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:45:02,216 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:45:02,217 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0220.i [2022-02-20 23:45:02,258 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/becd20e78/3675ec65046644cc9316f2ec0e5154da/FLAG854db5272 [2022-02-20 23:45:02,702 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:45:02,702 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0220.i [2022-02-20 23:45:02,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/becd20e78/3675ec65046644cc9316f2ec0e5154da/FLAG854db5272 [2022-02-20 23:45:03,043 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/becd20e78/3675ec65046644cc9316f2ec0e5154da [2022-02-20 23:45:03,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:45:03,045 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:45:03,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:45:03,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:45:03,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:45:03,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:45:03" (1/1) ... [2022-02-20 23:45:03,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11046736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:03, skipping insertion in model container [2022-02-20 23:45:03,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:45:03" (1/1) ... [2022-02-20 23:45:03,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:45:03,083 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:45:03,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:45:03,330 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:45:03,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:45:03,382 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:45:03,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:03 WrapperNode [2022-02-20 23:45:03,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:45:03,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:45:03,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:45:03,384 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:45:03,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:03" (1/1) ... [2022-02-20 23:45:03,398 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:03" (1/1) ... [2022-02-20 23:45:03,416 INFO L137 Inliner]: procedures = 180, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 113 [2022-02-20 23:45:03,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:45:03,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:45:03,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:45:03,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:45:03,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:03" (1/1) ... [2022-02-20 23:45:03,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:03" (1/1) ... [2022-02-20 23:45:03,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:03" (1/1) ... [2022-02-20 23:45:03,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:03" (1/1) ... [2022-02-20 23:45:03,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:03" (1/1) ... [2022-02-20 23:45:03,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:03" (1/1) ... [2022-02-20 23:45:03,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:03" (1/1) ... [2022-02-20 23:45:03,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:45:03,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:45:03,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:45:03,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:45:03,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:03" (1/1) ... [2022-02-20 23:45:03,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:45:03,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:03,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:45:03,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:45:03,539 INFO L130 BoogieDeclarations]: Found specification of procedure calloc_model [2022-02-20 23:45:03,539 INFO L138 BoogieDeclarations]: Found implementation of procedure calloc_model [2022-02-20 23:45:03,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:45:03,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:45:03,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:45:03,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:45:03,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:45:03,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:45:03,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:45:03,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:45:03,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:45:03,715 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:45:03,716 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:45:04,146 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:45:04,151 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:45:04,151 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 23:45:04,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:45:04 BoogieIcfgContainer [2022-02-20 23:45:04,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:45:04,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:45:04,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:45:04,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:45:04,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:45:03" (1/3) ... [2022-02-20 23:45:04,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d1edac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:45:04, skipping insertion in model container [2022-02-20 23:45:04,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:03" (2/3) ... [2022-02-20 23:45:04,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d1edac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:45:04, skipping insertion in model container [2022-02-20 23:45:04,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:45:04" (3/3) ... [2022-02-20 23:45:04,168 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0220.i [2022-02-20 23:45:04,172 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:45:04,172 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2022-02-20 23:45:04,196 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:45:04,200 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 [2022-02-20 23:45:04,200 INFO L340 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-02-20 23:45:04,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 105 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:04,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:45:04,217 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:04,218 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:45:04,218 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:45:04,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:04,221 INFO L85 PathProgramCache]: Analyzing trace with hash 928072, now seen corresponding path program 1 times [2022-02-20 23:45:04,227 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:04,227 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872593939] [2022-02-20 23:45:04,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:04,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:04,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {112#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {112#true} is VALID [2022-02-20 23:45:04,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {112#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset; {112#true} is VALID [2022-02-20 23:45:04,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {112#true} assume !true; {113#false} is VALID [2022-02-20 23:45:04,332 INFO L290 TraceCheckUtils]: 3: Hoare triple {113#false} assume !(1 == #valid[~#list~0.base]); {113#false} is VALID [2022-02-20 23:45:04,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:04,333 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:04,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872593939] [2022-02-20 23:45:04,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872593939] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:04,334 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:04,334 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:04,335 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055891921] [2022-02-20 23:45:04,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:04,339 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2022-02-20 23:45:04,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:04,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:04,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:04,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:45:04,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:04,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:45:04,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:45:04,370 INFO L87 Difference]: Start difference. First operand has 109 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 105 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:04,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:04,452 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2022-02-20 23:45:04,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:45:04,453 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2022-02-20 23:45:04,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:04,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 121 transitions. [2022-02-20 23:45:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:04,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 121 transitions. [2022-02-20 23:45:04,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 121 transitions. [2022-02-20 23:45:04,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:04,588 INFO L225 Difference]: With dead ends: 109 [2022-02-20 23:45:04,588 INFO L226 Difference]: Without dead ends: 107 [2022-02-20 23:45:04,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:45:04,598 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:04,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:04,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-02-20 23:45:04,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-02-20 23:45:04,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:04,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 107 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 103 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:04,638 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 107 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 103 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:04,639 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 107 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 103 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:04,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:04,644 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2022-02-20 23:45:04,644 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2022-02-20 23:45:04,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:04,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:04,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 103 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 107 states. [2022-02-20 23:45:04,646 INFO L87 Difference]: Start difference. First operand has 107 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 103 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 107 states. [2022-02-20 23:45:04,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:04,664 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2022-02-20 23:45:04,664 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2022-02-20 23:45:04,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:04,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:04,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:04,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:04,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 103 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2022-02-20 23:45:04,669 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 4 [2022-02-20 23:45:04,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:04,670 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2022-02-20 23:45:04,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:04,670 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2022-02-20 23:45:04,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:45:04,671 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:04,671 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:45:04,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:45:04,671 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:45:04,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:04,672 INFO L85 PathProgramCache]: Analyzing trace with hash 889700811, now seen corresponding path program 1 times [2022-02-20 23:45:04,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:04,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699956214] [2022-02-20 23:45:04,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:04,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:04,697 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:04,698 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [421559967] [2022-02-20 23:45:04,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:04,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:04,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:04,711 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:45:04,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 23:45:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:04,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:45:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:04,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:04,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:45:04,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {546#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {546#true} is VALID [2022-02-20 23:45:04,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset; {546#true} is VALID [2022-02-20 23:45:04,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {546#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset, l1_insert_#t~nondet12#1, l1_insert_#t~mem13#1.base, l1_insert_#t~mem13#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {546#true} is VALID [2022-02-20 23:45:04,911 INFO L272 TraceCheckUtils]: 3: Hoare triple {546#true} call l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset := calloc_model(1, 8); {546#true} is VALID [2022-02-20 23:45:04,912 INFO L290 TraceCheckUtils]: 4: Hoare triple {546#true} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {563#(= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1)} is VALID [2022-02-20 23:45:04,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {563#(= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1)} assume !(1 == #valid[#Ultimate.C_memset_#ptr#1.base]); {547#false} is VALID [2022-02-20 23:45:04,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:04,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:04,913 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:04,913 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699956214] [2022-02-20 23:45:04,913 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:04,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421559967] [2022-02-20 23:45:04,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421559967] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:04,914 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:04,914 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:04,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796248054] [2022-02-20 23:45:04,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:04,915 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:45:04,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:04,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:04,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:04,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:04,922 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:04,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:04,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:04,923 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:05,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:05,084 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-02-20 23:45:05,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:05,084 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:45:05,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:05,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:05,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-02-20 23:45:05,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-02-20 23:45:05,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 112 transitions. [2022-02-20 23:45:05,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:05,174 INFO L225 Difference]: With dead ends: 106 [2022-02-20 23:45:05,174 INFO L226 Difference]: Without dead ends: 106 [2022-02-20 23:45:05,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:05,175 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 7 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:05,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 163 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:05,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-02-20 23:45:05,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-02-20 23:45:05,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:05,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 106 states, 58 states have (on average 1.8448275862068966) internal successors, (107), 102 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:05,180 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 106 states, 58 states have (on average 1.8448275862068966) internal successors, (107), 102 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:05,180 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 106 states, 58 states have (on average 1.8448275862068966) internal successors, (107), 102 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:05,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:05,183 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-02-20 23:45:05,183 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-02-20 23:45:05,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:05,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:05,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 58 states have (on average 1.8448275862068966) internal successors, (107), 102 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 106 states. [2022-02-20 23:45:05,184 INFO L87 Difference]: Start difference. First operand has 106 states, 58 states have (on average 1.8448275862068966) internal successors, (107), 102 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 106 states. [2022-02-20 23:45:05,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:05,187 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-02-20 23:45:05,187 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-02-20 23:45:05,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:05,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:05,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:05,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:05,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 58 states have (on average 1.8448275862068966) internal successors, (107), 102 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2022-02-20 23:45:05,190 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 6 [2022-02-20 23:45:05,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:05,191 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2022-02-20 23:45:05,191 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:05,191 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-02-20 23:45:05,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:45:05,191 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:05,192 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:05,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:05,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:05,409 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:45:05,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:05,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1810921558, now seen corresponding path program 1 times [2022-02-20 23:45:05,410 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:05,410 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511555780] [2022-02-20 23:45:05,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:05,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:05,424 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:05,424 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [917411700] [2022-02-20 23:45:05,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:05,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:05,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:05,430 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:45:05,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 23:45:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:05,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:45:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:05,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:05,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:45:06,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {990#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {990#true} is VALID [2022-02-20 23:45:06,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {990#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset; {990#true} is VALID [2022-02-20 23:45:06,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {990#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset, l1_insert_#t~nondet12#1, l1_insert_#t~mem13#1.base, l1_insert_#t~mem13#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {990#true} is VALID [2022-02-20 23:45:06,342 INFO L272 TraceCheckUtils]: 3: Hoare triple {990#true} call l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset := calloc_model(1, 8); {990#true} is VALID [2022-02-20 23:45:06,352 INFO L290 TraceCheckUtils]: 4: Hoare triple {990#true} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {1007#(and (= |calloc_model_#Ultimate.C_memset_#ptr#1.offset| 0) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= (* |calloc_model_~nmemb#1| |calloc_model_~size#1|) (select |#length| |calloc_model_#Ultimate.C_memset_#ptr#1.base|)) (<= |calloc_model_#Ultimate.C_memset_#amount#1| (* |calloc_model_~nmemb#1| |calloc_model_~size#1|)))))} is VALID [2022-02-20 23:45:06,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {1007#(and (= |calloc_model_#Ultimate.C_memset_#ptr#1.offset| 0) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= (* |calloc_model_~nmemb#1| |calloc_model_~size#1|) (select |#length| |calloc_model_#Ultimate.C_memset_#ptr#1.base|)) (<= |calloc_model_#Ultimate.C_memset_#amount#1| (* |calloc_model_~nmemb#1| |calloc_model_~size#1|)))))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {1007#(and (= |calloc_model_#Ultimate.C_memset_#ptr#1.offset| 0) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= (* |calloc_model_~nmemb#1| |calloc_model_~size#1|) (select |#length| |calloc_model_#Ultimate.C_memset_#ptr#1.base|)) (<= |calloc_model_#Ultimate.C_memset_#amount#1| (* |calloc_model_~nmemb#1| |calloc_model_~size#1|)))))} is VALID [2022-02-20 23:45:06,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {1007#(and (= |calloc_model_#Ultimate.C_memset_#ptr#1.offset| 0) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= (* |calloc_model_~nmemb#1| |calloc_model_~size#1|) (select |#length| |calloc_model_#Ultimate.C_memset_#ptr#1.base|)) (<= |calloc_model_#Ultimate.C_memset_#amount#1| (* |calloc_model_~nmemb#1| |calloc_model_~size#1|)))))} assume !(#Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset); {991#false} is VALID [2022-02-20 23:45:06,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:06,355 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:06,355 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:06,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511555780] [2022-02-20 23:45:06,355 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:06,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917411700] [2022-02-20 23:45:06,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917411700] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:06,356 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:06,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:06,356 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114284924] [2022-02-20 23:45:06,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:06,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:45:06,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:06,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:06,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:06,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:06,372 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:06,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:06,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:06,373 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:06,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:06,472 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2022-02-20 23:45:06,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:06,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:45:06,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:06,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-02-20 23:45:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:06,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-02-20 23:45:06,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-02-20 23:45:06,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:06,589 INFO L225 Difference]: With dead ends: 105 [2022-02-20 23:45:06,589 INFO L226 Difference]: Without dead ends: 105 [2022-02-20 23:45:06,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:06,590 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:06,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 41 Unchecked, 0.0s Time] [2022-02-20 23:45:06,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-02-20 23:45:06,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-02-20 23:45:06,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:06,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 105 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 101 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:06,596 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 105 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 101 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:06,596 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 105 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 101 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:06,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:06,599 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2022-02-20 23:45:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2022-02-20 23:45:06,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:06,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:06,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 101 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 105 states. [2022-02-20 23:45:06,601 INFO L87 Difference]: Start difference. First operand has 105 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 101 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 105 states. [2022-02-20 23:45:06,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:06,605 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2022-02-20 23:45:06,605 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2022-02-20 23:45:06,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:06,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:06,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:06,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:06,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 101 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:06,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2022-02-20 23:45:06,609 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 7 [2022-02-20 23:45:06,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:06,610 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2022-02-20 23:45:06,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:06,610 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2022-02-20 23:45:06,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:45:06,611 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:06,611 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:06,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:06,835 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,SelfDestructingSolverStorable2 [2022-02-20 23:45:06,836 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:45:06,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:06,836 INFO L85 PathProgramCache]: Analyzing trace with hash -713444144, now seen corresponding path program 1 times [2022-02-20 23:45:06,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:06,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167320704] [2022-02-20 23:45:06,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:06,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:06,868 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:06,868 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1061196329] [2022-02-20 23:45:06,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:06,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:06,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:06,883 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:45:06,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 23:45:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:06,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:45:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:06,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:07,093 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 23:45:07,093 INFO L390 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 [2022-02-20 23:45:07,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {1433#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {1433#true} is VALID [2022-02-20 23:45:07,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {1433#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset; {1433#true} is VALID [2022-02-20 23:45:07,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {1433#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset, l1_insert_#t~nondet12#1, l1_insert_#t~mem13#1.base, l1_insert_#t~mem13#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {1433#true} is VALID [2022-02-20 23:45:07,106 INFO L272 TraceCheckUtils]: 3: Hoare triple {1433#true} call l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset := calloc_model(1, 8); {1433#true} is VALID [2022-02-20 23:45:07,106 INFO L290 TraceCheckUtils]: 4: Hoare triple {1433#true} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {1433#true} is VALID [2022-02-20 23:45:07,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {1433#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {1433#true} is VALID [2022-02-20 23:45:07,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {1433#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr22#1;#Ultimate.C_memset_#t~loopctr22#1 := 0; {1433#true} is VALID [2022-02-20 23:45:07,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {1433#true} assume !(#Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {1433#true} is VALID [2022-02-20 23:45:07,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {1433#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res4#1.base, #t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;#res#1.base, #res#1.offset := ~ptr~0#1.base, ~ptr~0#1.offset;havoc #t~memset~res4#1.base, #t~memset~res4#1.offset; {1433#true} is VALID [2022-02-20 23:45:07,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {1433#true} assume true; {1433#true} is VALID [2022-02-20 23:45:07,108 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1433#true} {1433#true} #174#return; {1433#true} is VALID [2022-02-20 23:45:07,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {1433#true} l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset := l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset; {1433#true} is VALID [2022-02-20 23:45:07,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {1433#true} assume !(l1_insert_~item~1#1.base == 0 && l1_insert_~item~1#1.offset == 0); {1433#true} is VALID [2022-02-20 23:45:07,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {1433#true} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~1#1.base, 4 + l1_insert_~item~1#1.offset;havoc l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset, l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset, l2_insert_#t~mem7#1.base, l2_insert_#t~mem7#1.offset, l2_insert_#t~mem8#1.base, l2_insert_#t~mem8#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {1433#true} is VALID [2022-02-20 23:45:07,108 INFO L272 TraceCheckUtils]: 14: Hoare triple {1433#true} call l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset := calloc_model(1, 8); {1433#true} is VALID [2022-02-20 23:45:07,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {1433#true} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {1483#(= |calloc_model_~ptr~0#1.base| |calloc_model_#Ultimate.C_memset_#ptr#1.base|)} is VALID [2022-02-20 23:45:07,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {1483#(= |calloc_model_~ptr~0#1.base| |calloc_model_#Ultimate.C_memset_#ptr#1.base|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {1487#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:07,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {1487#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr22#1;#Ultimate.C_memset_#t~loopctr22#1 := 0; {1487#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:07,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {1487#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {1487#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:07,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {1487#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res4#1.base, #t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;#res#1.base, #res#1.offset := ~ptr~0#1.base, ~ptr~0#1.offset;havoc #t~memset~res4#1.base, #t~memset~res4#1.offset; {1497#(= (select |#valid| |calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:45:07,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {1497#(= (select |#valid| |calloc_model_#res#1.base|) 1)} assume true; {1497#(= (select |#valid| |calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:45:07,112 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1497#(= (select |#valid| |calloc_model_#res#1.base|) 1)} {1433#true} #176#return; {1504#(= (select |#valid| |ULTIMATE.start_l2_insert_#t~ret5#1.base|) 1)} is VALID [2022-02-20 23:45:07,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {1504#(= (select |#valid| |ULTIMATE.start_l2_insert_#t~ret5#1.base|) 1)} l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset := l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset;havoc l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset; {1508#(= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:07,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {1508#(= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1)} assume !(l2_insert_~item~0#1.base == 0 && l2_insert_~item~0#1.offset == 0); {1508#(= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:07,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {1508#(= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1)} call l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset := #Ultimate.allocOnHeap(119); {1508#(= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:07,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {1508#(= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1)} assume !(1 == #valid[l2_insert_~item~0#1.base]); {1434#false} is VALID [2022-02-20 23:45:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:45:07,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:07,115 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:07,115 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167320704] [2022-02-20 23:45:07,115 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:07,115 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061196329] [2022-02-20 23:45:07,115 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061196329] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:07,115 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:07,115 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:45:07,116 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261242417] [2022-02-20 23:45:07,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:07,116 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-02-20 23:45:07,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:07,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:07,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:07,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:45:07,133 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:07,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:45:07,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:45:07,134 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:07,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:07,679 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2022-02-20 23:45:07,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:45:07,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-02-20 23:45:07,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:07,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:07,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2022-02-20 23:45:07,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:07,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2022-02-20 23:45:07,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 137 transitions. [2022-02-20 23:45:07,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:07,778 INFO L225 Difference]: With dead ends: 128 [2022-02-20 23:45:07,778 INFO L226 Difference]: Without dead ends: 128 [2022-02-20 23:45:07,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:45:07,779 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 65 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:07,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 348 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:45:07,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-02-20 23:45:07,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 102. [2022-02-20 23:45:07,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:07,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 102 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 98 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:07,788 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 102 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 98 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:07,788 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 102 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 98 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:07,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:07,811 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2022-02-20 23:45:07,812 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2022-02-20 23:45:07,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:07,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:07,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 98 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 128 states. [2022-02-20 23:45:07,813 INFO L87 Difference]: Start difference. First operand has 102 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 98 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 128 states. [2022-02-20 23:45:07,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:07,815 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2022-02-20 23:45:07,815 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2022-02-20 23:45:07,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:07,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:07,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:07,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:07,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 98 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:07,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2022-02-20 23:45:07,818 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 26 [2022-02-20 23:45:07,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:07,818 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2022-02-20 23:45:07,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:07,819 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2022-02-20 23:45:07,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:45:07,819 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:07,819 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:07,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:08,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:08,036 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:45:08,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:08,036 INFO L85 PathProgramCache]: Analyzing trace with hash -713444143, now seen corresponding path program 1 times [2022-02-20 23:45:08,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:08,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372973441] [2022-02-20 23:45:08,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:08,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:08,049 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:08,049 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [747697177] [2022-02-20 23:45:08,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:08,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:08,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:08,057 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:45:08,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 23:45:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:08,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 34 conjunts are in the unsatisfiable core [2022-02-20 23:45:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:08,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:13,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:45:13,931 INFO L390 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 19 treesize of output 21 [2022-02-20 23:45:14,236 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:45:14,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:45:14,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {2008#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {2008#true} is VALID [2022-02-20 23:45:14,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {2008#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset; {2008#true} is VALID [2022-02-20 23:45:14,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {2008#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset, l1_insert_#t~nondet12#1, l1_insert_#t~mem13#1.base, l1_insert_#t~mem13#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {2008#true} is VALID [2022-02-20 23:45:14,911 INFO L272 TraceCheckUtils]: 3: Hoare triple {2008#true} call l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset := calloc_model(1, 8); {2008#true} is VALID [2022-02-20 23:45:14,911 INFO L290 TraceCheckUtils]: 4: Hoare triple {2008#true} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {2008#true} is VALID [2022-02-20 23:45:14,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {2008#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2008#true} is VALID [2022-02-20 23:45:14,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {2008#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr22#1;#Ultimate.C_memset_#t~loopctr22#1 := 0; {2008#true} is VALID [2022-02-20 23:45:14,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {2008#true} assume !(#Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2008#true} is VALID [2022-02-20 23:45:14,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {2008#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res4#1.base, #t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;#res#1.base, #res#1.offset := ~ptr~0#1.base, ~ptr~0#1.offset;havoc #t~memset~res4#1.base, #t~memset~res4#1.offset; {2008#true} is VALID [2022-02-20 23:45:14,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {2008#true} assume true; {2008#true} is VALID [2022-02-20 23:45:14,915 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2008#true} {2008#true} #174#return; {2008#true} is VALID [2022-02-20 23:45:14,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {2008#true} l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset := l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset; {2008#true} is VALID [2022-02-20 23:45:14,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {2008#true} assume !(l1_insert_~item~1#1.base == 0 && l1_insert_~item~1#1.offset == 0); {2008#true} is VALID [2022-02-20 23:45:14,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {2008#true} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~1#1.base, 4 + l1_insert_~item~1#1.offset;havoc l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset, l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset, l2_insert_#t~mem7#1.base, l2_insert_#t~mem7#1.offset, l2_insert_#t~mem8#1.base, l2_insert_#t~mem8#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {2008#true} is VALID [2022-02-20 23:45:14,915 INFO L272 TraceCheckUtils]: 14: Hoare triple {2008#true} call l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset := calloc_model(1, 8); {2008#true} is VALID [2022-02-20 23:45:14,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {2008#true} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {2058#(and (= |calloc_model_~ptr~0#1.base| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= |calloc_model_#in~size#1| |calloc_model_~size#1|) (<= (* |calloc_model_~nmemb#1| |calloc_model_~size#1|) |calloc_model_#Ultimate.C_memset_#amount#1|) (<= |calloc_model_#in~nmemb#1| |calloc_model_~nmemb#1|))) (= |calloc_model_~ptr~0#1.offset| 0))} is VALID [2022-02-20 23:45:15,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {2058#(and (= |calloc_model_~ptr~0#1.base| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= |calloc_model_#in~size#1| |calloc_model_~size#1|) (<= (* |calloc_model_~nmemb#1| |calloc_model_~size#1|) |calloc_model_#Ultimate.C_memset_#amount#1|) (<= |calloc_model_#in~nmemb#1| |calloc_model_~nmemb#1|))) (= |calloc_model_~ptr~0#1.offset| 0))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2062#(and (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1) (= |calloc_model_~ptr~0#1.base| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= |calloc_model_#in~size#1| |calloc_model_~size#1|) (<= (* |calloc_model_~nmemb#1| |calloc_model_~size#1|) |calloc_model_#Ultimate.C_memset_#amount#1|) (<= |calloc_model_#in~nmemb#1| |calloc_model_~nmemb#1|))) (= |calloc_model_~ptr~0#1.offset| 0))} is VALID [2022-02-20 23:45:15,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {2062#(and (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1) (= |calloc_model_~ptr~0#1.base| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= |calloc_model_#in~size#1| |calloc_model_~size#1|) (<= (* |calloc_model_~nmemb#1| |calloc_model_~size#1|) |calloc_model_#Ultimate.C_memset_#amount#1|) (<= |calloc_model_#in~nmemb#1| |calloc_model_~nmemb#1|))) (= |calloc_model_~ptr~0#1.offset| 0))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr22#1;#Ultimate.C_memset_#t~loopctr22#1 := 0; {2066#(and (= (select |#valid| |calloc_model_~ptr~0#1.base|) 1) (= |calloc_model_#Ultimate.C_memset_#t~loopctr22#1| 0) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= |calloc_model_#in~size#1| |calloc_model_~size#1|) (<= (* |calloc_model_~nmemb#1| |calloc_model_~size#1|) |calloc_model_#Ultimate.C_memset_#amount#1|) (<= |calloc_model_#in~nmemb#1| |calloc_model_~nmemb#1|))) (= |calloc_model_~ptr~0#1.offset| 0) (<= |calloc_model_#Ultimate.C_memset_#amount#1| (select |#length| |calloc_model_~ptr~0#1.base|)))} is VALID [2022-02-20 23:45:15,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {2066#(and (= (select |#valid| |calloc_model_~ptr~0#1.base|) 1) (= |calloc_model_#Ultimate.C_memset_#t~loopctr22#1| 0) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= |calloc_model_#in~size#1| |calloc_model_~size#1|) (<= (* |calloc_model_~nmemb#1| |calloc_model_~size#1|) |calloc_model_#Ultimate.C_memset_#amount#1|) (<= |calloc_model_#in~nmemb#1| |calloc_model_~nmemb#1|))) (= |calloc_model_~ptr~0#1.offset| 0) (<= |calloc_model_#Ultimate.C_memset_#amount#1| (select |#length| |calloc_model_~ptr~0#1.base|)))} assume !(#Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2070#(and (= (select |#valid| |calloc_model_~ptr~0#1.base|) 1) (= |calloc_model_~ptr~0#1.offset| 0) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int) (|aux_div_calloc_model_#Ultimate.C_memset_#amount#1_60| Int)) (and (<= (* |aux_div_calloc_model_#Ultimate.C_memset_#amount#1_60| 4294967296) (select |#length| |calloc_model_~ptr~0#1.base|)) (<= |calloc_model_#in~size#1| |calloc_model_~size#1|) (<= (* |calloc_model_~nmemb#1| |calloc_model_~size#1|) (* |aux_div_calloc_model_#Ultimate.C_memset_#amount#1_60| 4294967296)) (<= |calloc_model_#in~nmemb#1| |calloc_model_~nmemb#1|))))} is VALID [2022-02-20 23:45:17,065 WARN L290 TraceCheckUtils]: 19: Hoare triple {2070#(and (= (select |#valid| |calloc_model_~ptr~0#1.base|) 1) (= |calloc_model_~ptr~0#1.offset| 0) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int) (|aux_div_calloc_model_#Ultimate.C_memset_#amount#1_60| Int)) (and (<= (* |aux_div_calloc_model_#Ultimate.C_memset_#amount#1_60| 4294967296) (select |#length| |calloc_model_~ptr~0#1.base|)) (<= |calloc_model_#in~size#1| |calloc_model_~size#1|) (<= (* |calloc_model_~nmemb#1| |calloc_model_~size#1|) (* |aux_div_calloc_model_#Ultimate.C_memset_#amount#1_60| 4294967296)) (<= |calloc_model_#in~nmemb#1| |calloc_model_~nmemb#1|))))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res4#1.base, #t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;#res#1.base, #res#1.offset := ~ptr~0#1.base, ~ptr~0#1.offset;havoc #t~memset~res4#1.base, #t~memset~res4#1.offset; {2074#(and (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= (div (- (* |calloc_model_~nmemb#1| |calloc_model_~size#1|)) (- 4294967296)) (div (select |#length| |calloc_model_#res#1.base|) 4294967296)) (<= |calloc_model_#in~size#1| |calloc_model_~size#1|) (<= |calloc_model_#in~nmemb#1| |calloc_model_~nmemb#1|))) (= |calloc_model_#res#1.offset| 0) (= (select |#valid| |calloc_model_#res#1.base|) 1))} is UNKNOWN [2022-02-20 23:45:17,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {2074#(and (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= (div (- (* |calloc_model_~nmemb#1| |calloc_model_~size#1|)) (- 4294967296)) (div (select |#length| |calloc_model_#res#1.base|) 4294967296)) (<= |calloc_model_#in~size#1| |calloc_model_~size#1|) (<= |calloc_model_#in~nmemb#1| |calloc_model_~nmemb#1|))) (= |calloc_model_#res#1.offset| 0) (= (select |#valid| |calloc_model_#res#1.base|) 1))} assume true; {2074#(and (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= (div (- (* |calloc_model_~nmemb#1| |calloc_model_~size#1|)) (- 4294967296)) (div (select |#length| |calloc_model_#res#1.base|) 4294967296)) (<= |calloc_model_#in~size#1| |calloc_model_~size#1|) (<= |calloc_model_#in~nmemb#1| |calloc_model_~nmemb#1|))) (= |calloc_model_#res#1.offset| 0) (= (select |#valid| |calloc_model_#res#1.base|) 1))} is VALID [2022-02-20 23:45:17,765 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2074#(and (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= (div (- (* |calloc_model_~nmemb#1| |calloc_model_~size#1|)) (- 4294967296)) (div (select |#length| |calloc_model_#res#1.base|) 4294967296)) (<= |calloc_model_#in~size#1| |calloc_model_~size#1|) (<= |calloc_model_#in~nmemb#1| |calloc_model_~nmemb#1|))) (= |calloc_model_#res#1.offset| 0) (= (select |#valid| |calloc_model_#res#1.base|) 1))} {2008#true} #176#return; {2081#(and (= |ULTIMATE.start_l2_insert_#t~ret5#1.offset| 0) (= (select |#valid| |ULTIMATE.start_l2_insert_#t~ret5#1.base|) 1) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= (div (* (- 1) |calloc_model_~nmemb#1| |calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l2_insert_#t~ret5#1.base|) 4294967296)) (<= 8 |calloc_model_~size#1|) (<= 1 |calloc_model_~nmemb#1|))))} is VALID [2022-02-20 23:45:17,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {2081#(and (= |ULTIMATE.start_l2_insert_#t~ret5#1.offset| 0) (= (select |#valid| |ULTIMATE.start_l2_insert_#t~ret5#1.base|) 1) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= (div (* (- 1) |calloc_model_~nmemb#1| |calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l2_insert_#t~ret5#1.base|) 4294967296)) (<= 8 |calloc_model_~size#1|) (<= 1 |calloc_model_~nmemb#1|))))} l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset := l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset;havoc l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset; {2085#(and (= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= 8 |calloc_model_~size#1|) (<= 1 |calloc_model_~nmemb#1|) (<= (div (* (- 1) |calloc_model_~nmemb#1| |calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) 4294967296)))) (= |ULTIMATE.start_l2_insert_~item~0#1.offset| 0))} is VALID [2022-02-20 23:45:17,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {2085#(and (= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= 8 |calloc_model_~size#1|) (<= 1 |calloc_model_~nmemb#1|) (<= (div (* (- 1) |calloc_model_~nmemb#1| |calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) 4294967296)))) (= |ULTIMATE.start_l2_insert_~item~0#1.offset| 0))} assume !(l2_insert_~item~0#1.base == 0 && l2_insert_~item~0#1.offset == 0); {2085#(and (= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= 8 |calloc_model_~size#1|) (<= 1 |calloc_model_~nmemb#1|) (<= (div (* (- 1) |calloc_model_~nmemb#1| |calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) 4294967296)))) (= |ULTIMATE.start_l2_insert_~item~0#1.offset| 0))} is VALID [2022-02-20 23:45:17,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {2085#(and (= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1) (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= 8 |calloc_model_~size#1|) (<= 1 |calloc_model_~nmemb#1|) (<= (div (* (- 1) |calloc_model_~nmemb#1| |calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) 4294967296)))) (= |ULTIMATE.start_l2_insert_~item~0#1.offset| 0))} call l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset := #Ultimate.allocOnHeap(119); {2092#(and (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= 8 |calloc_model_~size#1|) (<= 1 |calloc_model_~nmemb#1|) (<= (div (* (- 1) |calloc_model_~nmemb#1| |calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) 4294967296)))) (= |ULTIMATE.start_l2_insert_~item~0#1.offset| 0))} is VALID [2022-02-20 23:45:17,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {2092#(and (exists ((|calloc_model_~nmemb#1| Int) (|calloc_model_~size#1| Int)) (and (<= 8 |calloc_model_~size#1|) (<= 1 |calloc_model_~nmemb#1|) (<= (div (* (- 1) |calloc_model_~nmemb#1| |calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) 4294967296)))) (= |ULTIMATE.start_l2_insert_~item~0#1.offset| 0))} assume !(4 + l2_insert_~item~0#1.offset <= #length[l2_insert_~item~0#1.base] && 0 <= l2_insert_~item~0#1.offset); {2009#false} is VALID [2022-02-20 23:45:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:45:17,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:17,774 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:17,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372973441] [2022-02-20 23:45:17,774 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:17,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747697177] [2022-02-20 23:45:17,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747697177] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:17,774 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:17,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:45:17,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470411328] [2022-02-20 23:45:17,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:17,775 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-02-20 23:45:17,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:17,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:21,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 25 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:21,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:45:21,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:21,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:45:21,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2022-02-20 23:45:21,356 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:21,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:21,668 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-02-20 23:45:21,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:45:21,669 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-02-20 23:45:21,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:21,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:21,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2022-02-20 23:45:21,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:21,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2022-02-20 23:45:21,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 118 transitions. [2022-02-20 23:45:23,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 117 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:23,806 INFO L225 Difference]: With dead ends: 110 [2022-02-20 23:45:23,806 INFO L226 Difference]: Without dead ends: 110 [2022-02-20 23:45:23,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2022-02-20 23:45:23,807 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 343 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:23,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 436 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 343 Unchecked, 0.0s Time] [2022-02-20 23:45:23,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-02-20 23:45:23,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-02-20 23:45:23,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:23,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 110 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 105 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:45:23,810 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 110 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 105 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:45:23,811 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 110 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 105 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:45:23,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:23,825 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-02-20 23:45:23,825 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2022-02-20 23:45:23,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:23,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:23,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 105 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 110 states. [2022-02-20 23:45:23,826 INFO L87 Difference]: Start difference. First operand has 110 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 105 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 110 states. [2022-02-20 23:45:23,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:23,830 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-02-20 23:45:23,830 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2022-02-20 23:45:23,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:23,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:23,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:23,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:23,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 105 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:45:23,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2022-02-20 23:45:23,836 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 26 [2022-02-20 23:45:23,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:23,836 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2022-02-20 23:45:23,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:23,836 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2022-02-20 23:45:23,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:45:23,842 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:23,842 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:23,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:24,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:24,043 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:45:24,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:24,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1369822126, now seen corresponding path program 1 times [2022-02-20 23:45:24,043 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:24,043 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460406019] [2022-02-20 23:45:24,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:24,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:24,059 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:24,063 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [887070664] [2022-02-20 23:45:24,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:24,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:24,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:24,068 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:45:24,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 23:45:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:24,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 35 conjunts are in the unsatisfiable core [2022-02-20 23:45:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:24,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:24,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 23:45:52,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:45:52,609 INFO L390 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 21 treesize of output 21 [2022-02-20 23:45:52,651 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:45:52,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:45:52,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {2535#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {2535#true} is VALID [2022-02-20 23:45:52,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {2535#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset; {2535#true} is VALID [2022-02-20 23:45:52,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {2535#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset, l1_insert_#t~nondet12#1, l1_insert_#t~mem13#1.base, l1_insert_#t~mem13#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {2535#true} is VALID [2022-02-20 23:45:52,701 INFO L272 TraceCheckUtils]: 3: Hoare triple {2535#true} call l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset := calloc_model(1, 8); {2535#true} is VALID [2022-02-20 23:45:52,702 INFO L290 TraceCheckUtils]: 4: Hoare triple {2535#true} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {2535#true} is VALID [2022-02-20 23:45:52,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {2535#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2535#true} is VALID [2022-02-20 23:45:52,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {2535#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr22#1;#Ultimate.C_memset_#t~loopctr22#1 := 0; {2535#true} is VALID [2022-02-20 23:45:52,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {2535#true} assume !(#Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2535#true} is VALID [2022-02-20 23:45:52,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {2535#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res4#1.base, #t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;#res#1.base, #res#1.offset := ~ptr~0#1.base, ~ptr~0#1.offset;havoc #t~memset~res4#1.base, #t~memset~res4#1.offset; {2535#true} is VALID [2022-02-20 23:45:52,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {2535#true} assume true; {2535#true} is VALID [2022-02-20 23:45:52,703 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2535#true} {2535#true} #174#return; {2535#true} is VALID [2022-02-20 23:45:52,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {2535#true} l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset := l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset; {2535#true} is VALID [2022-02-20 23:45:52,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {2535#true} assume !(l1_insert_~item~1#1.base == 0 && l1_insert_~item~1#1.offset == 0); {2535#true} is VALID [2022-02-20 23:45:52,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {2535#true} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~1#1.base, 4 + l1_insert_~item~1#1.offset;havoc l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset, l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset, l2_insert_#t~mem7#1.base, l2_insert_#t~mem7#1.offset, l2_insert_#t~mem8#1.base, l2_insert_#t~mem8#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {2535#true} is VALID [2022-02-20 23:45:52,703 INFO L272 TraceCheckUtils]: 14: Hoare triple {2535#true} call l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset := calloc_model(1, 8); {2535#true} is VALID [2022-02-20 23:45:52,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {2535#true} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {2585#(and (= |calloc_model_~ptr~0#1.base| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) (= (select |#length| |calloc_model_~ptr~0#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_~ptr~0#1.offset| 0))} is VALID [2022-02-20 23:45:52,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {2585#(and (= |calloc_model_~ptr~0#1.base| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) (= (select |#length| |calloc_model_~ptr~0#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_~ptr~0#1.offset| 0))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2589#(and (= (select |#valid| |calloc_model_~ptr~0#1.base|) 1) (= (select |#length| |calloc_model_~ptr~0#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_~ptr~0#1.offset| 0))} is VALID [2022-02-20 23:45:52,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {2589#(and (= (select |#valid| |calloc_model_~ptr~0#1.base|) 1) (= (select |#length| |calloc_model_~ptr~0#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_~ptr~0#1.offset| 0))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr22#1;#Ultimate.C_memset_#t~loopctr22#1 := 0; {2589#(and (= (select |#valid| |calloc_model_~ptr~0#1.base|) 1) (= (select |#length| |calloc_model_~ptr~0#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_~ptr~0#1.offset| 0))} is VALID [2022-02-20 23:45:52,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {2589#(and (= (select |#valid| |calloc_model_~ptr~0#1.base|) 1) (= (select |#length| |calloc_model_~ptr~0#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_~ptr~0#1.offset| 0))} assume #Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr22#1 := #Ultimate.C_memset_#value#1];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr22#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr22#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr22#1 := 1 + #Ultimate.C_memset_#t~loopctr22#1; {2589#(and (= (select |#valid| |calloc_model_~ptr~0#1.base|) 1) (= (select |#length| |calloc_model_~ptr~0#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_~ptr~0#1.offset| 0))} is VALID [2022-02-20 23:45:52,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {2589#(and (= (select |#valid| |calloc_model_~ptr~0#1.base|) 1) (= (select |#length| |calloc_model_~ptr~0#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_~ptr~0#1.offset| 0))} assume !(#Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2589#(and (= (select |#valid| |calloc_model_~ptr~0#1.base|) 1) (= (select |#length| |calloc_model_~ptr~0#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_~ptr~0#1.offset| 0))} is VALID [2022-02-20 23:45:52,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {2589#(and (= (select |#valid| |calloc_model_~ptr~0#1.base|) 1) (= (select |#length| |calloc_model_~ptr~0#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_~ptr~0#1.offset| 0))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res4#1.base, #t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;#res#1.base, #res#1.offset := ~ptr~0#1.base, ~ptr~0#1.offset;havoc #t~memset~res4#1.base, #t~memset~res4#1.offset; {2602#(and (= (select |#length| |calloc_model_#res#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_#res#1.offset| 0) (= (select |#valid| |calloc_model_#res#1.base|) 1))} is VALID [2022-02-20 23:45:52,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {2602#(and (= (select |#length| |calloc_model_#res#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_#res#1.offset| 0) (= (select |#valid| |calloc_model_#res#1.base|) 1))} assume true; {2602#(and (= (select |#length| |calloc_model_#res#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_#res#1.offset| 0) (= (select |#valid| |calloc_model_#res#1.base|) 1))} is VALID [2022-02-20 23:45:52,712 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2602#(and (= (select |#length| |calloc_model_#res#1.base|) (* |calloc_model_#in~nmemb#1| |calloc_model_#in~size#1|)) (= |calloc_model_#res#1.offset| 0) (= (select |#valid| |calloc_model_#res#1.base|) 1))} {2535#true} #176#return; {2609#(and (exists ((|v_calloc_model_#in~size#1_AFTER_CALL_6| Int)) (and (<= 1 (div (select |#length| |ULTIMATE.start_l2_insert_#t~ret5#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|)) (= (mod (select |#length| |ULTIMATE.start_l2_insert_#t~ret5#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|) 0) (<= 8 |v_calloc_model_#in~size#1_AFTER_CALL_6|))) (= |ULTIMATE.start_l2_insert_#t~ret5#1.offset| 0) (= (select |#valid| |ULTIMATE.start_l2_insert_#t~ret5#1.base|) 1))} is VALID [2022-02-20 23:45:52,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {2609#(and (exists ((|v_calloc_model_#in~size#1_AFTER_CALL_6| Int)) (and (<= 1 (div (select |#length| |ULTIMATE.start_l2_insert_#t~ret5#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|)) (= (mod (select |#length| |ULTIMATE.start_l2_insert_#t~ret5#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|) 0) (<= 8 |v_calloc_model_#in~size#1_AFTER_CALL_6|))) (= |ULTIMATE.start_l2_insert_#t~ret5#1.offset| 0) (= (select |#valid| |ULTIMATE.start_l2_insert_#t~ret5#1.base|) 1))} l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset := l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset;havoc l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset; {2613#(and (= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1) (exists ((|v_calloc_model_#in~size#1_AFTER_CALL_6| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|) 0) (<= 1 (div (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|)) (<= 8 |v_calloc_model_#in~size#1_AFTER_CALL_6|))) (= |ULTIMATE.start_l2_insert_~item~0#1.offset| 0))} is VALID [2022-02-20 23:45:52,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {2613#(and (= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1) (exists ((|v_calloc_model_#in~size#1_AFTER_CALL_6| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|) 0) (<= 1 (div (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|)) (<= 8 |v_calloc_model_#in~size#1_AFTER_CALL_6|))) (= |ULTIMATE.start_l2_insert_~item~0#1.offset| 0))} assume !(l2_insert_~item~0#1.base == 0 && l2_insert_~item~0#1.offset == 0); {2613#(and (= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1) (exists ((|v_calloc_model_#in~size#1_AFTER_CALL_6| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|) 0) (<= 1 (div (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|)) (<= 8 |v_calloc_model_#in~size#1_AFTER_CALL_6|))) (= |ULTIMATE.start_l2_insert_~item~0#1.offset| 0))} is VALID [2022-02-20 23:45:52,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {2613#(and (= (select |#valid| |ULTIMATE.start_l2_insert_~item~0#1.base|) 1) (exists ((|v_calloc_model_#in~size#1_AFTER_CALL_6| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|) 0) (<= 1 (div (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|)) (<= 8 |v_calloc_model_#in~size#1_AFTER_CALL_6|))) (= |ULTIMATE.start_l2_insert_~item~0#1.offset| 0))} call l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset := #Ultimate.allocOnHeap(119); {2620#(and (exists ((|v_calloc_model_#in~size#1_AFTER_CALL_6| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|) 0) (<= 1 (div (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|)) (<= 8 |v_calloc_model_#in~size#1_AFTER_CALL_6|))) (= |ULTIMATE.start_l2_insert_~item~0#1.offset| 0))} is VALID [2022-02-20 23:45:52,718 INFO L290 TraceCheckUtils]: 26: Hoare triple {2620#(and (exists ((|v_calloc_model_#in~size#1_AFTER_CALL_6| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|) 0) (<= 1 (div (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|) |v_calloc_model_#in~size#1_AFTER_CALL_6|)) (<= 8 |v_calloc_model_#in~size#1_AFTER_CALL_6|))) (= |ULTIMATE.start_l2_insert_~item~0#1.offset| 0))} assume !(4 + l2_insert_~item~0#1.offset <= #length[l2_insert_~item~0#1.base] && 0 <= l2_insert_~item~0#1.offset); {2536#false} is VALID [2022-02-20 23:45:52,718 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:45:52,719 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:52,719 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:52,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460406019] [2022-02-20 23:45:52,719 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:52,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887070664] [2022-02-20 23:45:52,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887070664] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:52,719 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:52,719 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:45:52,719 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494882039] [2022-02-20 23:45:52,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:52,720 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2022-02-20 23:45:52,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:52,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:52,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:52,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:45:52,746 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:52,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:45:52,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:45:52,747 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:53,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:53,166 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2022-02-20 23:45:53,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:45:53,166 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2022-02-20 23:45:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:53,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:53,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-02-20 23:45:53,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:53,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-02-20 23:45:53,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 107 transitions. [2022-02-20 23:45:53,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:53,252 INFO L225 Difference]: With dead ends: 109 [2022-02-20 23:45:53,252 INFO L226 Difference]: Without dead ends: 109 [2022-02-20 23:45:53,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:45:53,253 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 8 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:53,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 327 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 107 Unchecked, 0.1s Time] [2022-02-20 23:45:53,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-02-20 23:45:53,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2022-02-20 23:45:53,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:53,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 101 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 97 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:53,256 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 101 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 97 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:53,257 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 101 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 97 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:53,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:53,259 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2022-02-20 23:45:53,259 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2022-02-20 23:45:53,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:53,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:53,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 97 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 109 states. [2022-02-20 23:45:53,259 INFO L87 Difference]: Start difference. First operand has 101 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 97 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 109 states. [2022-02-20 23:45:53,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:53,261 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2022-02-20 23:45:53,262 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2022-02-20 23:45:53,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:53,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:53,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:53,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 97 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:53,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2022-02-20 23:45:53,264 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 27 [2022-02-20 23:45:53,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:53,264 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2022-02-20 23:45:53,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:53,265 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2022-02-20 23:45:53,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:45:53,265 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:53,265 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:53,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:53,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:53,484 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:45:53,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:53,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1574944978, now seen corresponding path program 1 times [2022-02-20 23:45:53,485 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:53,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916705349] [2022-02-20 23:45:53,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:53,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:53,499 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:53,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [865211734] [2022-02-20 23:45:53,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:53,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:53,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:53,515 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) [2022-02-20 23:45:53,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 23:45:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:53,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:45:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:53,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:53,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {3056#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {3056#true} is VALID [2022-02-20 23:45:53,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {3056#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset; {3056#true} is VALID [2022-02-20 23:45:53,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {3056#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset, l1_insert_#t~nondet12#1, l1_insert_#t~mem13#1.base, l1_insert_#t~mem13#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {3056#true} is VALID [2022-02-20 23:45:53,651 INFO L272 TraceCheckUtils]: 3: Hoare triple {3056#true} call l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset := calloc_model(1, 8); {3056#true} is VALID [2022-02-20 23:45:53,651 INFO L290 TraceCheckUtils]: 4: Hoare triple {3056#true} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {3056#true} is VALID [2022-02-20 23:45:53,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {3056#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3056#true} is VALID [2022-02-20 23:45:53,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {3056#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr22#1;#Ultimate.C_memset_#t~loopctr22#1 := 0; {3056#true} is VALID [2022-02-20 23:45:53,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {3056#true} assume !(#Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3056#true} is VALID [2022-02-20 23:45:53,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {3056#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res4#1.base, #t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;#res#1.base, #res#1.offset := ~ptr~0#1.base, ~ptr~0#1.offset;havoc #t~memset~res4#1.base, #t~memset~res4#1.offset; {3056#true} is VALID [2022-02-20 23:45:53,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {3056#true} assume true; {3056#true} is VALID [2022-02-20 23:45:53,652 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3056#true} {3056#true} #174#return; {3056#true} is VALID [2022-02-20 23:45:53,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {3056#true} l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset := l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset; {3056#true} is VALID [2022-02-20 23:45:53,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {3056#true} assume !(l1_insert_~item~1#1.base == 0 && l1_insert_~item~1#1.offset == 0); {3056#true} is VALID [2022-02-20 23:45:53,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {3056#true} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~1#1.base, 4 + l1_insert_~item~1#1.offset;havoc l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset, l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset, l2_insert_#t~mem7#1.base, l2_insert_#t~mem7#1.offset, l2_insert_#t~mem8#1.base, l2_insert_#t~mem8#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {3056#true} is VALID [2022-02-20 23:45:53,653 INFO L272 TraceCheckUtils]: 14: Hoare triple {3056#true} call l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset := calloc_model(1, 8); {3056#true} is VALID [2022-02-20 23:45:53,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {3056#true} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {3056#true} is VALID [2022-02-20 23:45:53,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {3056#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3056#true} is VALID [2022-02-20 23:45:53,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {3056#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr22#1;#Ultimate.C_memset_#t~loopctr22#1 := 0; {3056#true} is VALID [2022-02-20 23:45:53,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {3056#true} assume !(#Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3056#true} is VALID [2022-02-20 23:45:53,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {3056#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res4#1.base, #t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;#res#1.base, #res#1.offset := ~ptr~0#1.base, ~ptr~0#1.offset;havoc #t~memset~res4#1.base, #t~memset~res4#1.offset; {3056#true} is VALID [2022-02-20 23:45:53,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {3056#true} assume true; {3056#true} is VALID [2022-02-20 23:45:53,654 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3056#true} {3056#true} #176#return; {3056#true} is VALID [2022-02-20 23:45:53,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {3056#true} l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset := l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset;havoc l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset; {3056#true} is VALID [2022-02-20 23:45:53,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {3056#true} assume !(l2_insert_~item~0#1.base == 0 && l2_insert_~item~0#1.offset == 0); {3056#true} is VALID [2022-02-20 23:45:53,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {3056#true} call l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset := #Ultimate.allocOnHeap(119); {3056#true} is VALID [2022-02-20 23:45:53,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {3056#true} SUMMARY for call write~$Pointer$(l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset, l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset, 4); srcloc: L658 {3136#(and (<= (+ |ULTIMATE.start_l2_insert_~item~0#1.offset| 4) (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|)) (<= 0 |ULTIMATE.start_l2_insert_~item~0#1.offset|))} is VALID [2022-02-20 23:45:53,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {3136#(and (<= (+ |ULTIMATE.start_l2_insert_~item~0#1.offset| 4) (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|)) (<= 0 |ULTIMATE.start_l2_insert_~item~0#1.offset|))} havoc l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset; {3136#(and (<= (+ |ULTIMATE.start_l2_insert_~item~0#1.offset| 4) (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|)) (<= 0 |ULTIMATE.start_l2_insert_~item~0#1.offset|))} is VALID [2022-02-20 23:45:53,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {3136#(and (<= (+ |ULTIMATE.start_l2_insert_~item~0#1.offset| 4) (select |#length| |ULTIMATE.start_l2_insert_~item~0#1.base|)) (<= 0 |ULTIMATE.start_l2_insert_~item~0#1.offset|))} assume !(4 + l2_insert_~item~0#1.offset <= #length[l2_insert_~item~0#1.base] && 0 <= l2_insert_~item~0#1.offset); {3057#false} is VALID [2022-02-20 23:45:53,658 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 23:45:53,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:53,658 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:53,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916705349] [2022-02-20 23:45:53,658 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:53,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865211734] [2022-02-20 23:45:53,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865211734] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:53,658 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:53,659 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:53,659 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832300173] [2022-02-20 23:45:53,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:53,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-02-20 23:45:53,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:53,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:53,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:53,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:53,676 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:53,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:53,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:53,676 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:53,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:53,803 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2022-02-20 23:45:53,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:53,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-02-20 23:45:53,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:53,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:53,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-20 23:45:53,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:53,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-20 23:45:53,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-02-20 23:45:53,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:53,917 INFO L225 Difference]: With dead ends: 103 [2022-02-20 23:45:53,917 INFO L226 Difference]: Without dead ends: 103 [2022-02-20 23:45:53,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:53,917 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 84 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:53,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 91 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:53,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-02-20 23:45:53,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2022-02-20 23:45:53,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:53,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 100 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 96 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:53,920 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 100 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 96 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:53,921 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 100 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 96 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:53,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:53,922 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2022-02-20 23:45:53,923 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2022-02-20 23:45:53,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:53,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:53,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 96 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 103 states. [2022-02-20 23:45:53,924 INFO L87 Difference]: Start difference. First operand has 100 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 96 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 103 states. [2022-02-20 23:45:53,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:53,925 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2022-02-20 23:45:53,926 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2022-02-20 23:45:53,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:53,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:53,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:53,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:53,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 96 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:45:53,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2022-02-20 23:45:53,936 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 28 [2022-02-20 23:45:53,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:53,936 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2022-02-20 23:45:53,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:45:53,936 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2022-02-20 23:45:53,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:45:53,937 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:53,937 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:53,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:54,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:54,154 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:45:54,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:54,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1693634963, now seen corresponding path program 1 times [2022-02-20 23:45:54,155 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:54,155 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576223634] [2022-02-20 23:45:54,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:54,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:54,167 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:54,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [530342170] [2022-02-20 23:45:54,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:54,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:54,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:54,169 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) [2022-02-20 23:45:54,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 23:45:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:54,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 23:45:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:54,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:54,532 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:45:54,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:45:54,561 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:45:54,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:45:54,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {3551#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {3551#true} is VALID [2022-02-20 23:45:54,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {3551#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset; {3551#true} is VALID [2022-02-20 23:45:54,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {3551#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset, l1_insert_#t~nondet12#1, l1_insert_#t~mem13#1.base, l1_insert_#t~mem13#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {3551#true} is VALID [2022-02-20 23:45:54,581 INFO L272 TraceCheckUtils]: 3: Hoare triple {3551#true} call l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset := calloc_model(1, 8); {3551#true} is VALID [2022-02-20 23:45:54,582 INFO L290 TraceCheckUtils]: 4: Hoare triple {3551#true} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {3568#(= |calloc_model_~ptr~0#1.base| |calloc_model_#Ultimate.C_memset_#ptr#1.base|)} is VALID [2022-02-20 23:45:54,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {3568#(= |calloc_model_~ptr~0#1.base| |calloc_model_#Ultimate.C_memset_#ptr#1.base|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3572#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:54,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {3572#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr22#1;#Ultimate.C_memset_#t~loopctr22#1 := 0; {3572#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:54,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {3572#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3572#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:54,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {3572#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res4#1.base, #t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;#res#1.base, #res#1.offset := ~ptr~0#1.base, ~ptr~0#1.offset;havoc #t~memset~res4#1.base, #t~memset~res4#1.offset; {3582#(= (select |#valid| |calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:45:54,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {3582#(= (select |#valid| |calloc_model_#res#1.base|) 1)} assume true; {3582#(= (select |#valid| |calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:45:54,584 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3582#(= (select |#valid| |calloc_model_#res#1.base|) 1)} {3551#true} #174#return; {3589#(= (select |#valid| |ULTIMATE.start_l1_insert_#t~ret11#1.base|) 1)} is VALID [2022-02-20 23:45:54,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {3589#(= (select |#valid| |ULTIMATE.start_l1_insert_#t~ret11#1.base|) 1)} l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset := l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset; {3593#(= (select |#valid| |ULTIMATE.start_l1_insert_~item~1#1.base|) 1)} is VALID [2022-02-20 23:45:54,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {3593#(= (select |#valid| |ULTIMATE.start_l1_insert_~item~1#1.base|) 1)} assume !(l1_insert_~item~1#1.base == 0 && l1_insert_~item~1#1.offset == 0); {3593#(= (select |#valid| |ULTIMATE.start_l1_insert_~item~1#1.base|) 1)} is VALID [2022-02-20 23:45:54,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {3593#(= (select |#valid| |ULTIMATE.start_l1_insert_~item~1#1.base|) 1)} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~1#1.base, 4 + l1_insert_~item~1#1.offset;havoc l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset, l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset, l2_insert_#t~mem7#1.base, l2_insert_#t~mem7#1.offset, l2_insert_#t~mem8#1.base, l2_insert_#t~mem8#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:54,586 INFO L272 TraceCheckUtils]: 14: Hoare triple {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} call l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset := calloc_model(1, 8); {3604#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:45:54,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {3604#(= |old(#valid)| |#valid|)} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {3608#(exists ((v_ArrVal_111 Int)) (= |#valid| (store |old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_111)))} is VALID [2022-02-20 23:45:54,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {3608#(exists ((v_ArrVal_111 Int)) (= |#valid| (store |old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_111)))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3612#(exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1) (exists ((v_ArrVal_111 Int)) (= |#valid| (store |old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_111)))))} is VALID [2022-02-20 23:45:54,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {3612#(exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1) (exists ((v_ArrVal_111 Int)) (= |#valid| (store |old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_111)))))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr22#1;#Ultimate.C_memset_#t~loopctr22#1 := 0; {3612#(exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1) (exists ((v_ArrVal_111 Int)) (= |#valid| (store |old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_111)))))} is VALID [2022-02-20 23:45:54,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {3612#(exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1) (exists ((v_ArrVal_111 Int)) (= |#valid| (store |old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_111)))))} assume !(#Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3612#(exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1) (exists ((v_ArrVal_111 Int)) (= |#valid| (store |old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_111)))))} is VALID [2022-02-20 23:45:54,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {3612#(exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1) (exists ((v_ArrVal_111 Int)) (= |#valid| (store |old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_111)))))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res4#1.base, #t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;#res#1.base, #res#1.offset := ~ptr~0#1.base, ~ptr~0#1.offset;havoc #t~memset~res4#1.base, #t~memset~res4#1.offset; {3612#(exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1) (exists ((v_ArrVal_111 Int)) (= |#valid| (store |old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_111)))))} is VALID [2022-02-20 23:45:54,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {3612#(exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1) (exists ((v_ArrVal_111 Int)) (= |#valid| (store |old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_111)))))} assume true; {3612#(exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1) (exists ((v_ArrVal_111 Int)) (= |#valid| (store |old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_111)))))} is VALID [2022-02-20 23:45:54,589 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3612#(exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1) (exists ((v_ArrVal_111 Int)) (= |#valid| (store |old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_111)))))} {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} #176#return; {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:54,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset := l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset;havoc l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset; {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:54,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} assume !(l2_insert_~item~0#1.base == 0 && l2_insert_~item~0#1.offset == 0); {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:54,591 INFO L290 TraceCheckUtils]: 24: Hoare triple {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} call l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset := #Ultimate.allocOnHeap(119); {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:54,591 INFO L290 TraceCheckUtils]: 25: Hoare triple {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} SUMMARY for call write~$Pointer$(l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset, l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset, 4); srcloc: L658 {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:54,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} havoc l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset; {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:54,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} SUMMARY for call l2_insert_#t~mem7#1.base, l2_insert_#t~mem7#1.offset := read~$Pointer$(l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset, 4); srcloc: L659 {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:54,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} assume !(l2_insert_#t~mem7#1.base == 0 && l2_insert_#t~mem7#1.offset == 0);havoc l2_insert_#t~mem7#1.base, l2_insert_#t~mem7#1.offset; {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:54,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} assume !(1 == #valid[l2_insert_~list#1.base]); {3552#false} is VALID [2022-02-20 23:45:54,592 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:54,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:45:54,975 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:45:54,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-02-20 23:45:54,987 INFO L290 TraceCheckUtils]: 29: Hoare triple {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} assume !(1 == #valid[l2_insert_~list#1.base]); {3552#false} is VALID [2022-02-20 23:45:54,987 INFO L290 TraceCheckUtils]: 28: Hoare triple {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} assume !(l2_insert_#t~mem7#1.base == 0 && l2_insert_#t~mem7#1.offset == 0);havoc l2_insert_#t~mem7#1.base, l2_insert_#t~mem7#1.offset; {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:54,988 INFO L290 TraceCheckUtils]: 27: Hoare triple {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} SUMMARY for call l2_insert_#t~mem7#1.base, l2_insert_#t~mem7#1.offset := read~$Pointer$(l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset, 4); srcloc: L659 {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:54,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} havoc l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset; {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:54,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} SUMMARY for call write~$Pointer$(l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset, l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset, 4); srcloc: L658 {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:54,989 INFO L290 TraceCheckUtils]: 24: Hoare triple {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} call l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset := #Ultimate.allocOnHeap(119); {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:54,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} assume !(l2_insert_~item~0#1.base == 0 && l2_insert_~item~0#1.offset == 0); {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:54,990 INFO L290 TraceCheckUtils]: 22: Hoare triple {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset := l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset;havoc l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset; {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:54,991 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3679#(forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1))))} {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} #176#return; {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:54,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {3679#(forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1))))} assume true; {3679#(forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1))))} is VALID [2022-02-20 23:45:54,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {3679#(forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1))))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res4#1.base, #t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;#res#1.base, #res#1.offset := ~ptr~0#1.base, ~ptr~0#1.offset;havoc #t~memset~res4#1.base, #t~memset~res4#1.offset; {3679#(forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1))))} is VALID [2022-02-20 23:45:54,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {3679#(forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1))))} assume !(#Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3679#(forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1))))} is VALID [2022-02-20 23:45:54,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {3679#(forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1))))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr22#1;#Ultimate.C_memset_#t~loopctr22#1 := 0; {3679#(forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1))))} is VALID [2022-02-20 23:45:54,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {3695#(or (forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1)))) (not (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3679#(forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1))))} is VALID [2022-02-20 23:45:54,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {3679#(forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1))))} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {3695#(or (forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1)))) (not (= (select |#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:45:54,995 INFO L272 TraceCheckUtils]: 14: Hoare triple {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} call l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset := calloc_model(1, 8); {3679#(forall ((|v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l2_insert_~list#1.base_BEFORE_CALL_2|) 1))))} is VALID [2022-02-20 23:45:54,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {3593#(= (select |#valid| |ULTIMATE.start_l1_insert_~item~1#1.base|) 1)} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~1#1.base, 4 + l1_insert_~item~1#1.offset;havoc l2_insert_#t~ret5#1.base, l2_insert_#t~ret5#1.offset, l2_insert_#t~malloc6#1.base, l2_insert_#t~malloc6#1.offset, l2_insert_#t~mem7#1.base, l2_insert_#t~mem7#1.offset, l2_insert_#t~mem8#1.base, l2_insert_#t~mem8#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~0#1.base, l2_insert_~item~0#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {3600#(= (select |#valid| |ULTIMATE.start_l2_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:45:54,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {3593#(= (select |#valid| |ULTIMATE.start_l1_insert_~item~1#1.base|) 1)} assume !(l1_insert_~item~1#1.base == 0 && l1_insert_~item~1#1.offset == 0); {3593#(= (select |#valid| |ULTIMATE.start_l1_insert_~item~1#1.base|) 1)} is VALID [2022-02-20 23:45:54,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {3589#(= (select |#valid| |ULTIMATE.start_l1_insert_#t~ret11#1.base|) 1)} l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset := l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset; {3593#(= (select |#valid| |ULTIMATE.start_l1_insert_~item~1#1.base|) 1)} is VALID [2022-02-20 23:45:54,999 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3582#(= (select |#valid| |calloc_model_#res#1.base|) 1)} {3551#true} #174#return; {3589#(= (select |#valid| |ULTIMATE.start_l1_insert_#t~ret11#1.base|) 1)} is VALID [2022-02-20 23:45:54,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {3582#(= (select |#valid| |calloc_model_#res#1.base|) 1)} assume true; {3582#(= (select |#valid| |calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:45:55,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {3572#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res4#1.base, #t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;#res#1.base, #res#1.offset := ~ptr~0#1.base, ~ptr~0#1.offset;havoc #t~memset~res4#1.base, #t~memset~res4#1.offset; {3582#(= (select |#valid| |calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:45:55,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {3572#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr22#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3572#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:55,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {3572#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr22#1;#Ultimate.C_memset_#t~loopctr22#1 := 0; {3572#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:55,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {3568#(= |calloc_model_~ptr~0#1.base| |calloc_model_#Ultimate.C_memset_#ptr#1.base|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3572#(= (select |#valid| |calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:55,003 INFO L290 TraceCheckUtils]: 4: Hoare triple {3551#true} ~nmemb#1 := #in~nmemb#1;~size#1 := #in~size#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(~nmemb#1 * ~size#1);~ptr~0#1.base, ~ptr~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~ptr~0#1.base, ~ptr~0#1.offset, 0, ~nmemb#1 * ~size#1; {3568#(= |calloc_model_~ptr~0#1.base| |calloc_model_#Ultimate.C_memset_#ptr#1.base|)} is VALID [2022-02-20 23:45:55,003 INFO L272 TraceCheckUtils]: 3: Hoare triple {3551#true} call l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset := calloc_model(1, 8); {3551#true} is VALID [2022-02-20 23:45:55,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {3551#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l1_insert_#t~ret11#1.base, l1_insert_#t~ret11#1.offset, l1_insert_#t~nondet12#1, l1_insert_#t~mem13#1.base, l1_insert_#t~mem13#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~1#1.base, l1_insert_~item~1#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {3551#true} is VALID [2022-02-20 23:45:55,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {3551#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset; {3551#true} is VALID [2022-02-20 23:45:55,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {3551#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {3551#true} is VALID [2022-02-20 23:45:55,003 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:55,004 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:55,004 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576223634] [2022-02-20 23:45:55,004 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:55,004 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530342170] [2022-02-20 23:45:55,004 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530342170] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:45:55,004 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:45:55,004 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2022-02-20 23:45:55,004 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923580428] [2022-02-20 23:45:55,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:45:55,005 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-02-20 23:45:55,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:55,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:45:55,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:55,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 23:45:55,045 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:55,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 23:45:55,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:45:55,046 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:45:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:55,727 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2022-02-20 23:45:55,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:45:55,728 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-02-20 23:45:55,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:55,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:45:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 151 transitions. [2022-02-20 23:45:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:45:55,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 151 transitions. [2022-02-20 23:45:55,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 151 transitions. [2022-02-20 23:45:55,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:55,836 INFO L225 Difference]: With dead ends: 142 [2022-02-20 23:45:55,836 INFO L226 Difference]: Without dead ends: 142 [2022-02-20 23:45:55,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:45:55,837 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 86 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:55,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 494 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 341 Invalid, 0 Unknown, 68 Unchecked, 0.2s Time] [2022-02-20 23:45:55,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-02-20 23:45:55,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 116. [2022-02-20 23:45:55,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:55,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 116 states, 73 states have (on average 1.6027397260273972) internal successors, (117), 110 states have internal predecessors, (117), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:45:55,845 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 116 states, 73 states have (on average 1.6027397260273972) internal successors, (117), 110 states have internal predecessors, (117), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:45:55,846 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 116 states, 73 states have (on average 1.6027397260273972) internal successors, (117), 110 states have internal predecessors, (117), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:45:55,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:55,848 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2022-02-20 23:45:55,851 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2022-02-20 23:45:55,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:55,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:55,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 73 states have (on average 1.6027397260273972) internal successors, (117), 110 states have internal predecessors, (117), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 142 states. [2022-02-20 23:45:55,856 INFO L87 Difference]: Start difference. First operand has 116 states, 73 states have (on average 1.6027397260273972) internal successors, (117), 110 states have internal predecessors, (117), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 142 states. [2022-02-20 23:45:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:55,860 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2022-02-20 23:45:55,860 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2022-02-20 23:45:55,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:55,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:55,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:55,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:55,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 73 states have (on average 1.6027397260273972) internal successors, (117), 110 states have internal predecessors, (117), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:45:55,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2022-02-20 23:45:55,866 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 30 [2022-02-20 23:45:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:55,866 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2022-02-20 23:45:55,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:45:55,866 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2022-02-20 23:45:55,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:45:55,868 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:55,868 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:55,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:56,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:56,079 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:45:56,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:56,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1693634964, now seen corresponding path program 1 times [2022-02-20 23:45:56,079 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:56,079 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130323223] [2022-02-20 23:45:56,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:56,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:56,091 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:56,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1664474649] [2022-02-20 23:45:56,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:56,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:56,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:56,093 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:45:56,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 23:45:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:56,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 53 conjunts are in the unsatisfiable core [2022-02-20 23:45:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:56,223 INFO L286 TraceCheckSpWp]: Computing forward predicates...