/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 13:46:37,249 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 13:46:37,253 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 13:46:37,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 13:46:37,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 13:46:37,329 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 13:46:37,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 13:46:37,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 13:46:37,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 13:46:37,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 13:46:37,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 13:46:37,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 13:46:37,356 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 13:46:37,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 13:46:37,361 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 13:46:37,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 13:46:37,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 13:46:37,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 13:46:37,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 13:46:37,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 13:46:37,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 13:46:37,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 13:46:37,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 13:46:37,392 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 13:46:37,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 13:46:37,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 13:46:37,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 13:46:37,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 13:46:37,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 13:46:37,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 13:46:37,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 13:46:37,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 13:46:37,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 13:46:37,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 13:46:37,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 13:46:37,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 13:46:37,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 13:46:37,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 13:46:37,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 13:46:37,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 13:46:37,417 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 13:46:37,422 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-16 13:46:37,477 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 13:46:37,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 13:46:37,478 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 13:46:37,478 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 13:46:37,481 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 13:46:37,481 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 13:46:37,484 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 13:46:37,485 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 13:46:37,485 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 13:46:37,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 13:46:37,486 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 13:46:37,487 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 13:46:37,487 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 13:46:37,487 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 13:46:37,487 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 13:46:37,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 13:46:37,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 13:46:37,488 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 13:46:37,488 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 13:46:37,488 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 13:46:37,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 13:46:37,489 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 13:46:37,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 13:46:37,489 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 13:46:37,489 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 13:46:37,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 13:46:37,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 13:46:37,490 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 13:46:37,490 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 13:46:37,490 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 13:46:37,492 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 13:46:37,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 13:46:37,492 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 13:46:37,492 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 [2022-10-16 13:46:37,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 13:46:37,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 13:46:37,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 13:46:37,949 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 13:46:37,949 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 13:46:37,951 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2022-10-16 13:46:38,032 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7831e14df/d7ddea4a2fad48d6b78d314d0bee1c56/FLAGc205721d0 [2022-10-16 13:46:38,793 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 13:46:38,794 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2022-10-16 13:46:38,822 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7831e14df/d7ddea4a2fad48d6b78d314d0bee1c56/FLAGc205721d0 [2022-10-16 13:46:39,009 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7831e14df/d7ddea4a2fad48d6b78d314d0bee1c56 [2022-10-16 13:46:39,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 13:46:39,021 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 13:46:39,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 13:46:39,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 13:46:39,031 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 13:46:39,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:46:39" (1/1) ... [2022-10-16 13:46:39,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c74c79c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:39, skipping insertion in model container [2022-10-16 13:46:39,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:46:39" (1/1) ... [2022-10-16 13:46:39,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 13:46:39,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 13:46:39,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 13:46:39,677 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 13:46:39,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 13:46:39,821 INFO L208 MainTranslator]: Completed translation [2022-10-16 13:46:39,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:39 WrapperNode [2022-10-16 13:46:39,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 13:46:39,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 13:46:39,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 13:46:39,823 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 13:46:39,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:39" (1/1) ... [2022-10-16 13:46:39,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:39" (1/1) ... [2022-10-16 13:46:39,886 INFO L138 Inliner]: procedures = 164, calls = 70, calls flagged for inlining = 22, calls inlined = 14, statements flattened = 98 [2022-10-16 13:46:39,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 13:46:39,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 13:46:39,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 13:46:39,887 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 13:46:39,899 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:39" (1/1) ... [2022-10-16 13:46:39,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:39" (1/1) ... [2022-10-16 13:46:39,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:39" (1/1) ... [2022-10-16 13:46:39,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:39" (1/1) ... [2022-10-16 13:46:39,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:39" (1/1) ... [2022-10-16 13:46:39,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:39" (1/1) ... [2022-10-16 13:46:39,920 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:39" (1/1) ... [2022-10-16 13:46:39,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:39" (1/1) ... [2022-10-16 13:46:39,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 13:46:39,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 13:46:39,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 13:46:39,928 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 13:46:39,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:39" (1/1) ... [2022-10-16 13:46:39,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 13:46:39,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:46:39,988 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-10-16 13:46:39,997 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-10-16 13:46:40,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 13:46:40,054 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-10-16 13:46:40,054 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-10-16 13:46:40,054 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-16 13:46:40,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-16 13:46:40,054 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2022-10-16 13:46:40,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2022-10-16 13:46:40,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 13:46:40,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 13:46:40,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 13:46:40,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-16 13:46:40,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-16 13:46:40,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 13:46:40,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-16 13:46:40,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 13:46:40,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 13:46:40,271 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 13:46:40,276 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 13:46:40,543 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 13:46:40,552 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 13:46:40,553 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-16 13:46:40,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:46:40 BoogieIcfgContainer [2022-10-16 13:46:40,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 13:46:40,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 13:46:40,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 13:46:40,563 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 13:46:40,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:46:39" (1/3) ... [2022-10-16 13:46:40,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cc06569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:46:40, skipping insertion in model container [2022-10-16 13:46:40,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:39" (2/3) ... [2022-10-16 13:46:40,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cc06569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:46:40, skipping insertion in model container [2022-10-16 13:46:40,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:46:40" (3/3) ... [2022-10-16 13:46:40,567 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3-2.i [2022-10-16 13:46:40,594 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 13:46:40,595 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-16 13:46:40,664 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 13:46:40,674 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5cf6340c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 13:46:40,674 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-10-16 13:46:40,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 33 states have (on average 1.303030303030303) internal successors, (43), 36 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-16 13:46:40,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 13:46:40,693 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:40,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:46:40,695 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 13:46:40,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:40,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1473570137, now seen corresponding path program 1 times [2022-10-16 13:46:40,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:40,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662193506] [2022-10-16 13:46:40,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:40,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:41,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:41,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:46:41,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:41,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662193506] [2022-10-16 13:46:41,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662193506] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:41,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:41,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 13:46:41,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47983638] [2022-10-16 13:46:41,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:41,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 13:46:41,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:41,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 13:46:41,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:46:41,411 INFO L87 Difference]: Start difference. First operand has 43 states, 33 states have (on average 1.303030303030303) internal successors, (43), 36 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 13:46:41,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:41,615 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2022-10-16 13:46:41,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 13:46:41,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-10-16 13:46:41,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:41,630 INFO L225 Difference]: With dead ends: 89 [2022-10-16 13:46:41,631 INFO L226 Difference]: Without dead ends: 58 [2022-10-16 13:46:41,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:46:41,640 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 32 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:41,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 173 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:46:41,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-10-16 13:46:41,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2022-10-16 13:46:41,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.303030303030303) internal successors, (43), 36 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-10-16 13:46:41,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-10-16 13:46:41,696 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 14 [2022-10-16 13:46:41,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:41,697 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-10-16 13:46:41,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 13:46:41,698 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-10-16 13:46:41,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 13:46:41,699 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:41,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:46:41,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 13:46:41,700 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 13:46:41,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:41,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1277056632, now seen corresponding path program 1 times [2022-10-16 13:46:41,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:41,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284012275] [2022-10-16 13:46:41,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:41,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:41,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:41,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:46:41,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:41,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284012275] [2022-10-16 13:46:41,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284012275] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:41,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:41,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 13:46:41,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304104553] [2022-10-16 13:46:41,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:41,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 13:46:41,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:41,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 13:46:41,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 13:46:41,957 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 13:46:42,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:42,257 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-10-16 13:46:42,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 13:46:42,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-10-16 13:46:42,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:42,263 INFO L225 Difference]: With dead ends: 73 [2022-10-16 13:46:42,263 INFO L226 Difference]: Without dead ends: 49 [2022-10-16 13:46:42,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-10-16 13:46:42,267 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 28 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:42,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 168 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 13:46:42,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-10-16 13:46:42,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2022-10-16 13:46:42,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.3) internal successors, (39), 33 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 13:46:42,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-10-16 13:46:42,279 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 14 [2022-10-16 13:46:42,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:42,279 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-10-16 13:46:42,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 13:46:42,280 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-10-16 13:46:42,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 13:46:42,281 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:42,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:46:42,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 13:46:42,282 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 13:46:42,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:42,283 INFO L85 PathProgramCache]: Analyzing trace with hash -769265850, now seen corresponding path program 1 times [2022-10-16 13:46:42,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:42,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888358061] [2022-10-16 13:46:42,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:42,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:42,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:42,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:46:42,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:42,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888358061] [2022-10-16 13:46:42,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888358061] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:42,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:42,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 13:46:42,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183286170] [2022-10-16 13:46:42,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:42,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 13:46:42,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:42,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 13:46:42,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 13:46:42,485 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 13:46:42,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:42,666 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2022-10-16 13:46:42,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 13:46:42,667 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-10-16 13:46:42,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:42,671 INFO L225 Difference]: With dead ends: 78 [2022-10-16 13:46:42,672 INFO L226 Difference]: Without dead ends: 58 [2022-10-16 13:46:42,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-16 13:46:42,677 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 33 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:42,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 167 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:46:42,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-10-16 13:46:42,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2022-10-16 13:46:42,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 39 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-10-16 13:46:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-10-16 13:46:42,705 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 18 [2022-10-16 13:46:42,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:42,706 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-10-16 13:46:42,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 13:46:42,706 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-10-16 13:46:42,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 13:46:42,707 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:42,708 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:46:42,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 13:46:42,708 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 13:46:42,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:42,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1274824475, now seen corresponding path program 1 times [2022-10-16 13:46:42,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:42,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590000421] [2022-10-16 13:46:42,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:42,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:42,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:42,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:46:42,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:42,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590000421] [2022-10-16 13:46:42,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590000421] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:42,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:42,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 13:46:42,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267456458] [2022-10-16 13:46:42,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:42,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 13:46:42,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:42,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 13:46:42,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:46:42,958 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 13:46:43,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:43,101 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2022-10-16 13:46:43,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 13:46:43,102 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-10-16 13:46:43,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:43,103 INFO L225 Difference]: With dead ends: 77 [2022-10-16 13:46:43,103 INFO L226 Difference]: Without dead ends: 43 [2022-10-16 13:46:43,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-10-16 13:46:43,116 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 17 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:43,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 136 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:46:43,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-10-16 13:46:43,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-10-16 13:46:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 13:46:43,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-10-16 13:46:43,135 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 18 [2022-10-16 13:46:43,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:43,135 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-10-16 13:46:43,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 13:46:43,136 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-10-16 13:46:43,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-16 13:46:43,137 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:43,137 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:46:43,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 13:46:43,138 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 13:46:43,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:43,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1680485969, now seen corresponding path program 1 times [2022-10-16 13:46:43,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:43,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182544147] [2022-10-16 13:46:43,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:43,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:43,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:43,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:46:43,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:43,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182544147] [2022-10-16 13:46:43,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182544147] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:43,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:43,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 13:46:43,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132045614] [2022-10-16 13:46:43,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:43,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 13:46:43,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:43,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 13:46:43,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 13:46:43,352 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 13:46:43,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:43,494 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-10-16 13:46:43,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 13:46:43,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-10-16 13:46:43,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:43,499 INFO L225 Difference]: With dead ends: 64 [2022-10-16 13:46:43,502 INFO L226 Difference]: Without dead ends: 43 [2022-10-16 13:46:43,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-10-16 13:46:43,512 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 34 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:43,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 117 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:46:43,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-10-16 13:46:43,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-10-16 13:46:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 13:46:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-10-16 13:46:43,524 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 20 [2022-10-16 13:46:43,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:43,527 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-10-16 13:46:43,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 13:46:43,527 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-10-16 13:46:43,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 13:46:43,529 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:43,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:46:43,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 13:46:43,529 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 13:46:43,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:43,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1074530998, now seen corresponding path program 1 times [2022-10-16 13:46:43,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:43,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333395755] [2022-10-16 13:46:43,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:43,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:43,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:43,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 13:46:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:43,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:46:43,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:43,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333395755] [2022-10-16 13:46:43,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333395755] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 13:46:43,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 13:46:43,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 13:46:43,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092678366] [2022-10-16 13:46:43,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 13:46:43,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 13:46:43,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:43,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 13:46:43,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 13:46:43,747 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 13:46:43,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:43,841 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2022-10-16 13:46:43,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 13:46:43,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-10-16 13:46:43,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:43,842 INFO L225 Difference]: With dead ends: 75 [2022-10-16 13:46:43,843 INFO L226 Difference]: Without dead ends: 46 [2022-10-16 13:46:43,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 13:46:43,844 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 23 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:43,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 82 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 13:46:43,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-10-16 13:46:43,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2022-10-16 13:46:43,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 33 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 13:46:43,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-10-16 13:46:43,870 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 25 [2022-10-16 13:46:43,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:43,871 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-10-16 13:46:43,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-16 13:46:43,871 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-10-16 13:46:43,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-16 13:46:43,872 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:43,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:46:43,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 13:46:43,873 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 13:46:43,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:43,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1315900491, now seen corresponding path program 1 times [2022-10-16 13:46:43,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:43,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501913328] [2022-10-16 13:46:43,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:43,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:44,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:44,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 13:46:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:44,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:46:44,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:44,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501913328] [2022-10-16 13:46:44,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501913328] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:46:44,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217681573] [2022-10-16 13:46:44,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:44,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:46:44,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:46:44,066 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-10-16 13:46:44,084 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-10-16 13:46:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:44,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 105 conjunts are in the unsatisfiable core [2022-10-16 13:46:44,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:46:44,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 13:46:45,719 WARN L855 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_108 Int) (v_ArrVal_107 Int)) (and (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_108) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_107)) |c_#memory_int|))) is different from true [2022-10-16 13:46:45,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:46:45,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:46:45,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-10-16 13:46:45,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 13:46:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:46:45,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:46:48,181 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_115 Int) (v_LDV_INIT_LIST_HEAD_~list.offset_4 Int) (v_ArrVal_116 Int)) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) v_LDV_INIT_LIST_HEAD_~list.offset_4 v_ArrVal_115) (+ v_LDV_INIT_LIST_HEAD_~list.offset_4 4) v_ArrVal_116)) |c_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ |c_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| 12)) 2147483649) (< (+ |c_ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| 4) v_LDV_INIT_LIST_HEAD_~list.offset_4))) is different from false [2022-10-16 13:46:48,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217681573] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:46:48,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 13:46:48,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 17] total 22 [2022-10-16 13:46:48,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506051941] [2022-10-16 13:46:48,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 13:46:48,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 13:46:48,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:46:48,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 13:46:48,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=636, Unknown=2, NotChecked=102, Total=812 [2022-10-16 13:46:48,188 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-10-16 13:46:56,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:46:56,093 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2022-10-16 13:46:56,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-16 13:46:56,094 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2022-10-16 13:46:56,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:46:56,095 INFO L225 Difference]: With dead ends: 76 [2022-10-16 13:46:56,095 INFO L226 Difference]: Without dead ends: 47 [2022-10-16 13:46:56,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=186, Invalid=1536, Unknown=8, NotChecked=162, Total=1892 [2022-10-16 13:46:56,098 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 95 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 13:46:56,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 167 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 486 Invalid, 0 Unknown, 64 Unchecked, 0.4s Time] [2022-10-16 13:46:56,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-10-16 13:46:56,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2022-10-16 13:46:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 13:46:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-10-16 13:46:56,109 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 26 [2022-10-16 13:46:56,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:46:56,110 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-10-16 13:46:56,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-10-16 13:46:56,110 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-10-16 13:46:56,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-16 13:46:56,111 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:46:56,111 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:46:56,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-10-16 13:46:56,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:46:56,326 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 13:46:56,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:46:56,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2128908860, now seen corresponding path program 1 times [2022-10-16 13:46:56,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:46:56,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727766589] [2022-10-16 13:46:56,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:56,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:46:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:56,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:46:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:56,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 13:46:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:56,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:46:56,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:46:56,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727766589] [2022-10-16 13:46:56,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727766589] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:46:56,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480386201] [2022-10-16 13:46:56,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:46:56,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:46:56,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:46:56,690 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-10-16 13:46:56,714 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-10-16 13:46:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:46:56,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 98 conjunts are in the unsatisfiable core [2022-10-16 13:46:56,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:46:56,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 13:46:57,879 WARN L855 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_193 Int) (v_ArrVal_191 Int)) (and (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_193) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_191)) |c_#memory_int|) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-10-16 13:46:57,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:46:57,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:46:57,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-10-16 13:46:58,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-10-16 13:46:58,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:46:58,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:47:00,328 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_202 Int) (v_ArrVal_201 Int) (v_LDV_INIT_LIST_HEAD_~list.offset_7 Int)) (or (< (+ |c_ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| 4) v_LDV_INIT_LIST_HEAD_~list.offset_7) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) v_LDV_INIT_LIST_HEAD_~list.offset_7 v_ArrVal_201) (+ v_LDV_INIT_LIST_HEAD_~list.offset_7 4) v_ArrVal_202)) |c_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ |c_ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| 12)) 2147483648)))) is different from false [2022-10-16 13:47:00,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480386201] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:47:00,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 13:47:00,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14] total 20 [2022-10-16 13:47:00,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416947594] [2022-10-16 13:47:00,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 13:47:00,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-10-16 13:47:00,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:47:00,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-10-16 13:47:00,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=542, Unknown=2, NotChecked=94, Total=702 [2022-10-16 13:47:00,333 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 16 states have internal predecessors, (41), 4 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 13:47:06,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:47:06,256 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2022-10-16 13:47:06,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-16 13:47:06,256 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 16 states have internal predecessors, (41), 4 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2022-10-16 13:47:06,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:47:06,257 INFO L225 Difference]: With dead ends: 82 [2022-10-16 13:47:06,257 INFO L226 Difference]: Without dead ends: 49 [2022-10-16 13:47:06,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=137, Invalid=1054, Unknown=7, NotChecked=134, Total=1332 [2022-10-16 13:47:06,260 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 48 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 13:47:06,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 201 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 399 Invalid, 0 Unknown, 54 Unchecked, 0.3s Time] [2022-10-16 13:47:06,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-10-16 13:47:06,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2022-10-16 13:47:06,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 13:47:06,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-10-16 13:47:06,270 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 28 [2022-10-16 13:47:06,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:47:06,270 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-10-16 13:47:06,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 16 states have internal predecessors, (41), 4 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 13:47:06,271 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-10-16 13:47:06,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-16 13:47:06,272 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:47:06,272 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:47:06,304 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-10-16 13:47:06,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-10-16 13:47:06,487 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 13:47:06,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:47:06,488 INFO L85 PathProgramCache]: Analyzing trace with hash 758701017, now seen corresponding path program 1 times [2022-10-16 13:47:06,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:47:06,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941970234] [2022-10-16 13:47:06,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:47:06,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:47:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:06,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:47:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:06,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-16 13:47:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:06,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-10-16 13:47:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:06,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:47:06,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:47:06,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941970234] [2022-10-16 13:47:06,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941970234] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:47:06,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783561127] [2022-10-16 13:47:06,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:47:06,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:47:06,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:47:06,905 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-10-16 13:47:06,928 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-10-16 13:47:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:07,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 161 conjunts are in the unsatisfiable core [2022-10-16 13:47:07,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:47:07,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 13:47:08,411 WARN L855 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_309 Int) (v_ArrVal_307 Int)) (and (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_309) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_307)) |c_#memory_int|))) is different from true [2022-10-16 13:47:08,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:47:08,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:47:08,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-10-16 13:47:11,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 13:47:11,295 INFO L356 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2022-10-16 13:47:11,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 42 treesize of output 1 [2022-10-16 13:47:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 13:47:11,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:47:20,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783561127] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:47:20,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 13:47:20,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 20] total 27 [2022-10-16 13:47:20,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103932134] [2022-10-16 13:47:20,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 13:47:20,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-10-16 13:47:20,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:47:20,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-10-16 13:47:20,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1415, Unknown=2, NotChecked=76, Total=1640 [2022-10-16 13:47:20,354 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 22 states have internal predecessors, (60), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-10-16 13:47:28,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:47:28,221 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2022-10-16 13:47:28,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-16 13:47:28,222 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 22 states have internal predecessors, (60), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-10-16 13:47:28,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:47:28,223 INFO L225 Difference]: With dead ends: 82 [2022-10-16 13:47:28,223 INFO L226 Difference]: Without dead ends: 46 [2022-10-16 13:47:28,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=264, Invalid=2595, Unknown=7, NotChecked=104, Total=2970 [2022-10-16 13:47:28,226 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 35 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 13:47:28,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 217 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 295 Invalid, 0 Unknown, 130 Unchecked, 0.3s Time] [2022-10-16 13:47:28,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-10-16 13:47:28,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-10-16 13:47:28,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 13:47:28,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2022-10-16 13:47:28,234 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 40 [2022-10-16 13:47:28,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:47:28,234 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2022-10-16 13:47:28,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 22 states have internal predecessors, (60), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-10-16 13:47:28,235 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-10-16 13:47:28,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-10-16 13:47:28,236 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 13:47:28,236 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:47:28,261 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-10-16 13:47:28,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:47:28,444 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 13:47:28,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 13:47:28,445 INFO L85 PathProgramCache]: Analyzing trace with hash -261934837, now seen corresponding path program 1 times [2022-10-16 13:47:28,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 13:47:28,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900072313] [2022-10-16 13:47:28,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:47:28,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 13:47:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:28,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 13:47:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:28,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-16 13:47:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:28,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-10-16 13:47:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:28,885 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 13:47:28,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 13:47:28,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900072313] [2022-10-16 13:47:28,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900072313] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 13:47:28,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398513029] [2022-10-16 13:47:28,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 13:47:28,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:47:28,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 13:47:28,888 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-10-16 13:47:28,899 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-10-16 13:47:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 13:47:29,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 154 conjunts are in the unsatisfiable core [2022-10-16 13:47:29,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 13:47:29,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 13:47:30,971 WARN L855 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_448 Int) (v_ArrVal_447 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_447) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_448))) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-10-16 13:47:30,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:47:31,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 13:47:31,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-10-16 13:47:33,672 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 13:47:33,675 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 13:47:33,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 30 treesize of output 26 [2022-10-16 13:47:33,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 13:47:33,867 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 13:47:33,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 13:47:34,716 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 13:47:34,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398513029] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 13:47:34,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 13:47:34,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 23, 9] total 40 [2022-10-16 13:47:34,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183611943] [2022-10-16 13:47:34,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 13:47:34,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-10-16 13:47:34,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 13:47:34,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-10-16 13:47:34,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1370, Unknown=1, NotChecked=74, Total=1560 [2022-10-16 13:47:34,721 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 40 states, 37 states have (on average 2.72972972972973) internal successors, (101), 32 states have internal predecessors, (101), 6 states have call successors, (11), 8 states have call predecessors, (11), 5 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2022-10-16 13:47:47,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 13:47:47,570 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2022-10-16 13:47:47,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-16 13:47:47,570 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 2.72972972972973) internal successors, (101), 32 states have internal predecessors, (101), 6 states have call successors, (11), 8 states have call predecessors, (11), 5 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 45 [2022-10-16 13:47:47,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 13:47:47,571 INFO L225 Difference]: With dead ends: 79 [2022-10-16 13:47:47,571 INFO L226 Difference]: Without dead ends: 0 [2022-10-16 13:47:47,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=276, Invalid=3024, Unknown=10, NotChecked=112, Total=3422 [2022-10-16 13:47:47,574 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 80 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 13:47:47,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 336 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 601 Invalid, 0 Unknown, 127 Unchecked, 0.5s Time] [2022-10-16 13:47:47,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-16 13:47:47,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-16 13:47:47,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-10-16 13:47:47,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-16 13:47:47,575 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2022-10-16 13:47:47,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 13:47:47,575 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-16 13:47:47,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 2.72972972972973) internal successors, (101), 32 states have internal predecessors, (101), 6 states have call successors, (11), 8 states have call predecessors, (11), 5 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2022-10-16 13:47:47,576 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-16 13:47:47,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-16 13:47:47,579 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2022-10-16 13:47:47,580 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2022-10-16 13:47:47,609 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-10-16 13:47:47,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 13:47:47,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-16 13:48:00,092 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 525 531) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-10-16 13:48:00,092 INFO L899 garLoopResultBuilder]: For program point L526(lines 526 530) no Hoare annotation was computed. [2022-10-16 13:48:00,092 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 525 531) no Hoare annotation was computed. [2022-10-16 13:48:00,092 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-10-16 13:48:00,092 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-16 13:48:00,092 INFO L895 garLoopResultBuilder]: At program point L731(lines 728 737) the Hoare annotation is: (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) 1) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0))) [2022-10-16 13:48:00,093 INFO L895 garLoopResultBuilder]: At program point L760(line 760) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse1 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0))) (or (and .cse0 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0) .cse1 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0)) (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|) 12) 1) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12) 1) .cse0 (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) 1) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) .cse1 (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0))))) [2022-10-16 13:48:00,093 INFO L895 garLoopResultBuilder]: At program point L760-1(line 760) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0))) (or (let ((.cse0 (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|))) (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (<= (select .cse0 12) 1) .cse1 (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= 0 (select .cse0 (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12))))) (and (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0) .cse1 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0)))) [2022-10-16 13:48:00,093 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 724) no Hoare annotation was computed. [2022-10-16 13:48:00,093 INFO L895 garLoopResultBuilder]: At program point L746(lines 738 747) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|))) (or (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12) 1) .cse0 (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) 1) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0))) (and .cse0 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0)))) [2022-10-16 13:48:00,093 INFO L899 garLoopResultBuilder]: For program point L680(lines 680 683) no Hoare annotation was computed. [2022-10-16 13:48:00,093 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 743) no Hoare annotation was computed. [2022-10-16 13:48:00,093 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-16 13:48:00,094 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-16 13:48:00,094 INFO L895 garLoopResultBuilder]: At program point L-1-2(line -1) the Hoare annotation is: (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0))) [2022-10-16 13:48:00,094 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-16 13:48:00,094 INFO L899 garLoopResultBuilder]: For program point L-1-3(line -1) no Hoare annotation was computed. [2022-10-16 13:48:00,094 INFO L899 garLoopResultBuilder]: For program point L763(lines 763 765) no Hoare annotation was computed. [2022-10-16 13:48:00,094 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 732) no Hoare annotation was computed. [2022-10-16 13:48:00,094 INFO L899 garLoopResultBuilder]: For program point L761(lines 757 762) no Hoare annotation was computed. [2022-10-16 13:48:00,094 INFO L895 garLoopResultBuilder]: At program point L726(line 726) the Hoare annotation is: (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|)) 1) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0))) [2022-10-16 13:48:00,094 INFO L895 garLoopResultBuilder]: At program point L726-1(lines 721 727) the Hoare annotation is: (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) 1) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0))) [2022-10-16 13:48:00,094 INFO L902 garLoopResultBuilder]: At program point L741(line 741) the Hoare annotation is: true [2022-10-16 13:48:00,095 INFO L899 garLoopResultBuilder]: For program point L741-1(line 741) no Hoare annotation was computed. [2022-10-16 13:48:00,095 INFO L895 garLoopResultBuilder]: At program point LDV_INIT_LIST_HEADENTRY(lines 538 542) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2022-10-16 13:48:00,095 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADFINAL(lines 538 542) no Hoare annotation was computed. [2022-10-16 13:48:00,095 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADEXIT(lines 538 542) no Hoare annotation was computed. [2022-10-16 13:48:00,095 INFO L895 garLoopResultBuilder]: At program point L669(lines 663 670) the Hoare annotation is: (let ((.cse3 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse5 (select .cse3 12))) (let ((.cse2 (not (<= .cse5 1))) (.cse0 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0)))) (and (let ((.cse4 (+ |ldv_kobject_put_#in~kobj#1.offset| 12))) (let ((.cse1 (select .cse3 .cse4))) (or .cse0 (not (<= 1 .cse1)) .cse2 (and (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 1) (<= (select (select |#memory_int| |ldv_kobject_put_~kobj#1.base|) 12) 1) (= |ldv_kobject_put_~kobj#1.offset| 0) (exists ((v_ArrVal_312 Int)) (and (= |#memory_int| (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse3 .cse4 v_ArrVal_312))) (<= .cse1 (+ v_ArrVal_312 1)))) (<= (select (select |#memory_int| |ldv_kobject_put_#in~kobj#1.base|) 12) 1) (= (+ |ldv_kobject_put_ldv_atomic_sub_return_#res#1| 1) .cse1) (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|))))) (or .cse0 (not (<= 0 .cse5)) .cse2 (= |old(#valid)| |#valid|)) (or .cse0 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))))))) [2022-10-16 13:48:00,096 INFO L899 garLoopResultBuilder]: For program point L667(line 667) no Hoare annotation was computed. [2022-10-16 13:48:00,096 INFO L899 garLoopResultBuilder]: For program point L667-1(line 667) no Hoare annotation was computed. [2022-10-16 13:48:00,096 INFO L895 garLoopResultBuilder]: At program point L690(lines 688 691) the Hoare annotation is: (let ((.cse0 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0)))) (and (or .cse0 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))) (let ((.cse1 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|)) (.cse2 (+ |ldv_kobject_put_#in~kobj#1.offset| 12))) (or .cse0 (not (<= 1 (select .cse1 .cse2))) (not (<= (select .cse1 12) 1)) (and (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 1) (<= (select (select |#memory_int| |ldv_kobject_put_~kobj#1.base|) 12) 1) (= |ldv_kobject_put_~kobj#1.offset| 0) (<= (select (select |#memory_int| |ldv_kobject_put_#in~kobj#1.base|) 12) 1) (exists ((v_ArrVal_451 Int)) (and (= |#memory_int| (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse1 .cse2 v_ArrVal_451))) (<= 0 v_ArrVal_451))) (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|)))))) [2022-10-16 13:48:00,096 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-10-16 13:48:00,097 INFO L895 garLoopResultBuilder]: At program point ldv_kobject_putENTRY(lines 709 714) the Hoare annotation is: (let ((.cse0 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (.cse1 (= |old(#valid)| |#valid|))) (and (let ((.cse2 (select (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|) 12))) (or .cse0 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) .cse1) (not (<= 0 .cse2)) (not (<= .cse2 1)))) (or .cse0 (not (= |ldv_kobject_put_#in~kobj#1.base| 0)) .cse1))) [2022-10-16 13:48:00,097 INFO L899 garLoopResultBuilder]: For program point L711(lines 711 713) no Hoare annotation was computed. [2022-10-16 13:48:00,097 INFO L895 garLoopResultBuilder]: At program point L678(lines 671 679) the Hoare annotation is: (let ((.cse0 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0)))) (and (or .cse0 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))) (let ((.cse1 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|)) (.cse2 (+ |ldv_kobject_put_#in~kobj#1.offset| 12))) (or .cse0 (not (<= 1 (select .cse1 .cse2))) (not (<= (select .cse1 12) 1)) (and (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 1) (<= (select (select |#memory_int| |ldv_kobject_put_~kobj#1.base|) 12) 1) (= |ldv_kobject_put_~kobj#1.offset| 0) (<= (select (select |#memory_int| |ldv_kobject_put_#in~kobj#1.base|) 12) 1) (exists ((v_ArrVal_451 Int)) (and (= |#memory_int| (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse1 .cse2 v_ArrVal_451))) (<= 0 v_ArrVal_451))) (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|)))))) [2022-10-16 13:48:00,097 INFO L899 garLoopResultBuilder]: For program point L711-2(lines 709 714) no Hoare annotation was computed. [2022-10-16 13:48:00,097 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putEXIT(lines 709 714) no Hoare annotation was computed. [2022-10-16 13:48:00,100 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 677) no Hoare annotation was computed. [2022-10-16 13:48:00,100 INFO L899 garLoopResultBuilder]: For program point L705(lines 705 708) no Hoare annotation was computed. [2022-10-16 13:48:00,100 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0)))) (and (or .cse0 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))) (let ((.cse1 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|)) (.cse2 (+ |ldv_kobject_put_#in~kobj#1.offset| 12))) (or .cse0 (not (<= 1 (select .cse1 .cse2))) (not (<= (select .cse1 12) 1)) (and (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 1) (<= (select (select |#memory_int| |ldv_kobject_put_~kobj#1.base|) 12) 1) (= |ldv_kobject_put_~kobj#1.offset| 0) (<= (select (select |#memory_int| |ldv_kobject_put_#in~kobj#1.base|) 12) 1) (exists ((v_ArrVal_451 Int)) (and (= |#memory_int| (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse1 .cse2 v_ArrVal_451))) (<= 0 v_ArrVal_451))) (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|)))))) [2022-10-16 13:48:00,101 INFO L899 garLoopResultBuilder]: For program point L701(lines 701 703) no Hoare annotation was computed. [2022-10-16 13:48:00,101 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 704) no Hoare annotation was computed. [2022-10-16 13:48:00,101 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-10-16 13:48:00,105 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 13:48:00,108 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 13:48:00,120 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_312,QUANTIFIED] [2022-10-16 13:48:00,121 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_312,QUANTIFIED] [2022-10-16 13:48:00,131 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_312,QUANTIFIED] [2022-10-16 13:48:00,131 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_312,QUANTIFIED] [2022-10-16 13:48:00,146 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] [2022-10-16 13:48:00,147 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] [2022-10-16 13:48:00,148 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] [2022-10-16 13:48:00,148 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] [2022-10-16 13:48:00,150 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] [2022-10-16 13:48:00,150 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] [2022-10-16 13:48:00,151 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] [2022-10-16 13:48:00,152 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] [2022-10-16 13:48:00,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] [2022-10-16 13:48:00,154 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] [2022-10-16 13:48:00,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] [2022-10-16 13:48:00,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] [2022-10-16 13:48:00,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:48:00 BoogieIcfgContainer [2022-10-16 13:48:00,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 13:48:00,157 INFO L158 Benchmark]: Toolchain (without parser) took 81140.41ms. Allocated memory was 160.4MB in the beginning and 192.9MB in the end (delta: 32.5MB). Free memory was 132.3MB in the beginning and 84.6MB in the end (delta: 47.7MB). Peak memory consumption was 81.1MB. Max. memory is 8.0GB. [2022-10-16 13:48:00,157 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 160.4MB. Free memory is still 129.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 13:48:00,157 INFO L158 Benchmark]: CACSL2BoogieTranslator took 796.62ms. Allocated memory is still 160.4MB. Free memory was 132.2MB in the beginning and 111.6MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-10-16 13:48:00,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.79ms. Allocated memory is still 160.4MB. Free memory was 111.4MB in the beginning and 109.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 13:48:00,158 INFO L158 Benchmark]: Boogie Preprocessor took 39.20ms. Allocated memory is still 160.4MB. Free memory was 109.1MB in the beginning and 107.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 13:48:00,159 INFO L158 Benchmark]: RCFGBuilder took 628.42ms. Allocated memory is still 160.4MB. Free memory was 107.2MB in the beginning and 126.1MB in the end (delta: -19.0MB). Peak memory consumption was 4.5MB. Max. memory is 8.0GB. [2022-10-16 13:48:00,159 INFO L158 Benchmark]: TraceAbstraction took 79597.87ms. Allocated memory was 160.4MB in the beginning and 192.9MB in the end (delta: 32.5MB). Free memory was 125.6MB in the beginning and 84.6MB in the end (delta: 41.0MB). Peak memory consumption was 73.5MB. Max. memory is 8.0GB. [2022-10-16 13:48:00,161 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 160.4MB. Free memory is still 129.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 796.62ms. Allocated memory is still 160.4MB. Free memory was 132.2MB in the beginning and 111.6MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.79ms. Allocated memory is still 160.4MB. Free memory was 111.4MB in the beginning and 109.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.20ms. Allocated memory is still 160.4MB. Free memory was 109.1MB in the beginning and 107.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 628.42ms. Allocated memory is still 160.4MB. Free memory was 107.2MB in the beginning and 126.1MB in the end (delta: -19.0MB). Peak memory consumption was 4.5MB. Max. memory is 8.0GB. * TraceAbstraction took 79597.87ms. Allocated memory was 160.4MB in the beginning and 192.9MB in the end (delta: 32.5MB). Free memory was 125.6MB in the beginning and 84.6MB in the end (delta: 41.0MB). Peak memory consumption was 73.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_312,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_312,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_312,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_312,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 667]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 667]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 43 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 79.5s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 35.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 430 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 425 mSDsluCounter, 1764 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 375 IncrementalHoareTripleChecker+Unchecked, 1404 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2401 IncrementalHoareTripleChecker+Invalid, 2921 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 360 mSDtfsCounter, 2401 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 376 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 57.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=3, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 62 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 136 PreInvPairs, 280 NumberOfFragments, 646 HoareAnnotationTreeSize, 136 FomulaSimplifications, 133 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 1249 FormulaSimplificationTreeSizeReductionInter, 12.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 29.1s InterpolantComputationTime, 387 NumberOfCodeBlocks, 387 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 417 ConstructedInterpolants, 27 QuantifiedInterpolants, 2409 SizeOfPredicates, 182 NumberOfNonLiveVariables, 1307 ConjunctsInSsa, 518 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 27/70 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 663]: Loop Invariant [2022-10-16 13:48:00,183 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_312,QUANTIFIED] [2022-10-16 13:48:00,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_312,QUANTIFIED] [2022-10-16 13:48:00,185 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_312,QUANTIFIED] [2022-10-16 13:48:00,186 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_312,QUANTIFIED] Derived loop invariant: ((((!(kobj == 0) || !(1 <= \old(unknown-#memory_int-unknown)[kobj][kobj + 12])) || !(\old(unknown-#memory_int-unknown)[kobj][12] <= 1)) || ((((((temp <= 1 && unknown-#memory_int-unknown[kobj][12] <= 1) && kobj == 0) && (\exists v_ArrVal_312 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_312]] && \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_312 + 1)) && unknown-#memory_int-unknown[kobj][12] <= 1) && \result + 1 == \old(unknown-#memory_int-unknown)[kobj][kobj + 12]) && 1 <= i)) && (((!(kobj == 0) || !(0 <= \old(unknown-#memory_int-unknown)[kobj][12])) || !(\old(unknown-#memory_int-unknown)[kobj][12] <= 1)) || \old(\valid) == \valid)) && (!(kobj == 0) || !(kobj == 0)) - InvariantResult [Line: 738]: Loop Invariant Derived loop invariant: ((((((0 == kobj && !(kobj == 0)) && unknown-#memory_int-unknown[\result][12] == 1) && 0 == \result) && unknown-#memory_int-unknown[kobj][12 + kobj] == 1) && !(kobj == 0)) && !(kobj == 0)) || (0 == \result && \result == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 == kobj && !(kobj == 0) - InvariantResult [Line: 671]: Loop Invariant [2022-10-16 13:48:00,193 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] [2022-10-16 13:48:00,193 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] [2022-10-16 13:48:00,197 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] [2022-10-16 13:48:00,197 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] Derived loop invariant: (!(kobj == 0) || !(kobj == 0)) && (((!(kobj == 0) || !(1 <= \old(unknown-#memory_int-unknown)[kobj][kobj + 12])) || !(\old(unknown-#memory_int-unknown)[kobj][12] <= 1)) || (((((temp <= 1 && unknown-#memory_int-unknown[kobj][12] <= 1) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 1) && (\exists v_ArrVal_451 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_451]] && 0 <= v_ArrVal_451)) && 1 <= i)) - InvariantResult [Line: 728]: Loop Invariant Derived loop invariant: (((0 == kobj && !(kobj == 0)) && unknown-#memory_int-unknown[kobj][12 + kobj] == 1) && !(kobj == 0)) && !(kobj == 0) - InvariantResult [Line: -1]: Loop Invariant [2022-10-16 13:48:00,201 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] [2022-10-16 13:48:00,204 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] [2022-10-16 13:48:00,205 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] [2022-10-16 13:48:00,205 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] Derived loop invariant: (!(kobj == 0) || !(kobj == 0)) && (((!(kobj == 0) || !(1 <= \old(unknown-#memory_int-unknown)[kobj][kobj + 12])) || !(\old(unknown-#memory_int-unknown)[kobj][12] <= 1)) || (((((temp <= 1 && unknown-#memory_int-unknown[kobj][12] <= 1) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 1) && (\exists v_ArrVal_451 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_451]] && 0 <= v_ArrVal_451)) && 1 <= i)) - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: (((0 == kobj && !(kobj == 0)) && unknown-#memory_int-unknown[kobj][12 + kobj] == 1) && !(kobj == 0)) && !(kobj == 0) - InvariantResult [Line: 688]: Loop Invariant [2022-10-16 13:48:00,207 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] [2022-10-16 13:48:00,207 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] [2022-10-16 13:48:00,208 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] [2022-10-16 13:48:00,208 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_451,QUANTIFIED] Derived loop invariant: (!(kobj == 0) || !(kobj == 0)) && (((!(kobj == 0) || !(1 <= \old(unknown-#memory_int-unknown)[kobj][kobj + 12])) || !(\old(unknown-#memory_int-unknown)[kobj][12] <= 1)) || (((((temp <= 1 && unknown-#memory_int-unknown[kobj][12] <= 1) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 1) && (\exists v_ArrVal_451 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_451]] && 0 <= v_ArrVal_451)) && 1 <= i)) RESULT: Ultimate proved your program to be correct! [2022-10-16 13:48:00,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...