./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0739bef7461b62f52995e3feabe5faf9fb4f95fee3f2cf661c4248d2611e75f6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:18:39,731 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:18:39,785 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 10:18:39,788 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:18:39,789 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:18:39,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:18:39,827 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:18:39,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:18:39,840 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:18:39,840 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:18:39,841 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:18:39,841 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:18:39,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:18:39,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:18:39,842 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:18:39,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:18:39,842 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:18:39,843 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 10:18:39,843 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:18:39,843 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 10:18:39,843 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:18:39,847 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:18:39,847 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:18:39,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:18:39,847 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:18:39,847 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:18:39,847 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:18:39,848 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 10:18:39,848 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:18:39,848 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:18:39,848 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:18:39,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:18:39,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:18:39,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:18:39,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:18:39,849 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:18:39,849 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:18:39,849 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:18:39,849 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:18:39,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:18:39,849 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:18:39,850 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:18:39,850 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:18:39,850 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:18:39,850 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0739bef7461b62f52995e3feabe5faf9fb4f95fee3f2cf661c4248d2611e75f6 [2024-11-19 10:18:40,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:18:40,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:18:40,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:18:40,074 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:18:40,074 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:18:40,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2024-11-19 10:18:41,328 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:18:41,552 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:18:41,553 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2024-11-19 10:18:41,568 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c906ae591/f151f9df0c1e44f0939a75ace4a7312a/FLAGfedceca61 [2024-11-19 10:18:41,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c906ae591/f151f9df0c1e44f0939a75ace4a7312a [2024-11-19 10:18:41,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:18:41,586 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:18:41,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:18:41,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:18:41,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:18:41,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:18:41" (1/1) ... [2024-11-19 10:18:41,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e9d63c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:41, skipping insertion in model container [2024-11-19 10:18:41,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:18:41" (1/1) ... [2024-11-19 10:18:41,634 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:18:41,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:18:41,994 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:18:42,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:18:42,130 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:18:42,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:42 WrapperNode [2024-11-19 10:18:42,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:18:42,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:18:42,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:18:42,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:18:42,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:42" (1/1) ... [2024-11-19 10:18:42,154 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:42" (1/1) ... [2024-11-19 10:18:42,182 INFO L138 Inliner]: procedures = 166, calls = 72, calls flagged for inlining = 24, calls inlined = 18, statements flattened = 125 [2024-11-19 10:18:42,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:18:42,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:18:42,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:18:42,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:18:42,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:42" (1/1) ... [2024-11-19 10:18:42,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:42" (1/1) ... [2024-11-19 10:18:42,203 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:42" (1/1) ... [2024-11-19 10:18:42,237 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2024-11-19 10:18:42,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:42" (1/1) ... [2024-11-19 10:18:42,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:42" (1/1) ... [2024-11-19 10:18:42,247 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:42" (1/1) ... [2024-11-19 10:18:42,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:42" (1/1) ... [2024-11-19 10:18:42,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:42" (1/1) ... [2024-11-19 10:18:42,258 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:42" (1/1) ... [2024-11-19 10:18:42,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:18:42,265 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:18:42,265 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:18:42,265 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:18:42,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:42" (1/1) ... [2024-11-19 10:18:42,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:18:42,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:18:42,298 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 10:18:42,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 10:18:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 10:18:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 10:18:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-11-19 10:18:42,348 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-11-19 10:18:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-19 10:18:42,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-19 10:18:42,349 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2024-11-19 10:18:42,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2024-11-19 10:18:42,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 10:18:42,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 10:18:42,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 10:18:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 10:18:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 10:18:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 10:18:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 10:18:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 10:18:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 10:18:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 10:18:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 10:18:42,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:18:42,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:18:42,484 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:18:42,486 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:18:42,680 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2024-11-19 10:18:42,680 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:18:42,695 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:18:42,695 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 10:18:42,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:18:42 BoogieIcfgContainer [2024-11-19 10:18:42,695 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:18:42,699 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:18:42,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:18:42,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:18:42,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:18:41" (1/3) ... [2024-11-19 10:18:42,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e4d192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:18:42, skipping insertion in model container [2024-11-19 10:18:42,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:42" (2/3) ... [2024-11-19 10:18:42,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e4d192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:18:42, skipping insertion in model container [2024-11-19 10:18:42,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:18:42" (3/3) ... [2024-11-19 10:18:42,707 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_4.i [2024-11-19 10:18:42,722 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:18:42,722 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-19 10:18:42,774 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:18:42,781 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@66e5b795, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:18:42,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-19 10:18:42,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 46 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 10:18:42,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 10:18:42,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:42,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:18:42,793 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:18:42,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:42,798 INFO L85 PathProgramCache]: Analyzing trace with hash -664495485, now seen corresponding path program 1 times [2024-11-19 10:18:42,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:42,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364231143] [2024-11-19 10:18:42,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:42,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:43,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:18:43,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:18:43,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364231143] [2024-11-19 10:18:43,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364231143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:18:43,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:18:43,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:18:43,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426862401] [2024-11-19 10:18:43,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:18:43,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:18:43,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:18:43,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:18:43,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:18:43,139 INFO L87 Difference]: Start difference. First operand has 52 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 46 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:18:43,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:18:43,186 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2024-11-19 10:18:43,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:18:43,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-19 10:18:43,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:18:43,195 INFO L225 Difference]: With dead ends: 96 [2024-11-19 10:18:43,196 INFO L226 Difference]: Without dead ends: 50 [2024-11-19 10:18:43,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:18:43,200 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 10 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:18:43,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 220 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:18:43,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-19 10:18:43,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2024-11-19 10:18:43,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 10:18:43,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2024-11-19 10:18:43,232 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 12 [2024-11-19 10:18:43,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:18:43,232 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2024-11-19 10:18:43,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:18:43,233 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2024-11-19 10:18:43,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 10:18:43,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:43,233 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:18:43,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:18:43,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:18:43,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:43,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1078314850, now seen corresponding path program 1 times [2024-11-19 10:18:43,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:43,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607565313] [2024-11-19 10:18:43,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:43,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:18:43,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:18:43,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607565313] [2024-11-19 10:18:43,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607565313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:18:43,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:18:43,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:18:43,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437419373] [2024-11-19 10:18:43,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:18:43,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:18:43,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:18:43,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:18:43,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:18:43,394 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:18:43,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:18:43,410 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2024-11-19 10:18:43,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:18:43,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-19 10:18:43,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:18:43,411 INFO L225 Difference]: With dead ends: 61 [2024-11-19 10:18:43,411 INFO L226 Difference]: Without dead ends: 45 [2024-11-19 10:18:43,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:18:43,413 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:18:43,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 115 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:18:43,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-19 10:18:43,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2024-11-19 10:18:43,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 38 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 10:18:43,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2024-11-19 10:18:43,417 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 12 [2024-11-19 10:18:43,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:18:43,418 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2024-11-19 10:18:43,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:18:43,418 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-11-19 10:18:43,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 10:18:43,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:43,419 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:18:43,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:18:43,419 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:18:43,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:43,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1552698704, now seen corresponding path program 1 times [2024-11-19 10:18:43,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:43,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982258495] [2024-11-19 10:18:43,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:43,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:43,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:18:43,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:18:43,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982258495] [2024-11-19 10:18:43,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982258495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:18:43,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:18:43,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 10:18:43,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259263979] [2024-11-19 10:18:43,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:18:43,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:18:43,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:18:43,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:18:43,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:18:43,511 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:18:43,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:18:43,565 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2024-11-19 10:18:43,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:18:43,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-19 10:18:43,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:18:43,569 INFO L225 Difference]: With dead ends: 71 [2024-11-19 10:18:43,569 INFO L226 Difference]: Without dead ends: 52 [2024-11-19 10:18:43,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:18:43,570 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:18:43,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 186 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:18:43,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-19 10:18:43,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2024-11-19 10:18:43,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 41 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 10:18:43,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2024-11-19 10:18:43,582 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 16 [2024-11-19 10:18:43,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:18:43,582 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2024-11-19 10:18:43,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:18:43,583 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2024-11-19 10:18:43,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 10:18:43,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:43,584 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:18:43,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:18:43,585 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:18:43,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:43,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1423615985, now seen corresponding path program 1 times [2024-11-19 10:18:43,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:43,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689067496] [2024-11-19 10:18:43,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:43,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:18:43,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:18:43,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689067496] [2024-11-19 10:18:43,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689067496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:18:43,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:18:43,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:18:43,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181884825] [2024-11-19 10:18:43,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:18:43,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:18:43,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:18:43,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:18:43,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:18:43,688 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:18:43,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:18:43,712 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2024-11-19 10:18:43,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:18:43,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-19 10:18:43,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:18:43,714 INFO L225 Difference]: With dead ends: 73 [2024-11-19 10:18:43,715 INFO L226 Difference]: Without dead ends: 44 [2024-11-19 10:18:43,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:18:43,718 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:18:43,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:18:43,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-19 10:18:43,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-19 10:18:43,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 38 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 10:18:43,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2024-11-19 10:18:43,725 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 16 [2024-11-19 10:18:43,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:18:43,725 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2024-11-19 10:18:43,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:18:43,725 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2024-11-19 10:18:43,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 10:18:43,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:43,726 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:18:43,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 10:18:43,727 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:18:43,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:43,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1859080699, now seen corresponding path program 1 times [2024-11-19 10:18:43,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:43,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034024383] [2024-11-19 10:18:43,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:43,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:43,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:18:43,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:18:43,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034024383] [2024-11-19 10:18:43,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034024383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:18:43,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:18:43,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 10:18:43,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955038728] [2024-11-19 10:18:43,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:18:43,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:18:43,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:18:43,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:18:43,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:18:43,872 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.5) 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) [2024-11-19 10:18:43,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:18:43,905 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2024-11-19 10:18:43,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:18:43,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) 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 [2024-11-19 10:18:43,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:18:43,906 INFO L225 Difference]: With dead ends: 54 [2024-11-19 10:18:43,907 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 10:18:43,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:18:43,908 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:18:43,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 194 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:18:43,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 10:18:43,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-19 10:18:43,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.206896551724138) internal successors, (35), 33 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:18:43,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2024-11-19 10:18:43,914 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 18 [2024-11-19 10:18:43,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:18:43,914 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2024-11-19 10:18:43,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) 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) [2024-11-19 10:18:43,915 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2024-11-19 10:18:43,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 10:18:43,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:43,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:18:43,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 10:18:43,916 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:18:43,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:43,917 INFO L85 PathProgramCache]: Analyzing trace with hash -305854759, now seen corresponding path program 1 times [2024-11-19 10:18:43,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:43,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42644887] [2024-11-19 10:18:43,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:43,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:18:43,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:18:43,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42644887] [2024-11-19 10:18:44,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42644887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:18:44,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:18:44,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 10:18:44,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40567506] [2024-11-19 10:18:44,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:18:44,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 10:18:44,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:18:44,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 10:18:44,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:18:44,002 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:18:44,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:18:44,061 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2024-11-19 10:18:44,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 10:18:44,062 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-19 10:18:44,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:18:44,063 INFO L225 Difference]: With dead ends: 58 [2024-11-19 10:18:44,064 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 10:18:44,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:18:44,065 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:18:44,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 183 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:18:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 10:18:44,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-19 10:18:44,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:18:44,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2024-11-19 10:18:44,073 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 18 [2024-11-19 10:18:44,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:18:44,073 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2024-11-19 10:18:44,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:18:44,073 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2024-11-19 10:18:44,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 10:18:44,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:44,074 INFO L215 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] [2024-11-19 10:18:44,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 10:18:44,074 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:18:44,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:44,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1523123492, now seen corresponding path program 1 times [2024-11-19 10:18:44,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:44,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928967540] [2024-11-19 10:18:44,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:44,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:44,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:18:44,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:18:44,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928967540] [2024-11-19 10:18:44,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928967540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:18:44,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:18:44,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:18:44,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706495787] [2024-11-19 10:18:44,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:18:44,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:18:44,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:18:44,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:18:44,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:18:44,167 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:18:44,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:18:44,174 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2024-11-19 10:18:44,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:18:44,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-19 10:18:44,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:18:44,180 INFO L225 Difference]: With dead ends: 67 [2024-11-19 10:18:44,180 INFO L226 Difference]: Without dead ends: 39 [2024-11-19 10:18:44,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:18:44,180 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:18:44,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:18:44,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-19 10:18:44,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-19 10:18:44,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 33 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:18:44,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-11-19 10:18:44,184 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 23 [2024-11-19 10:18:44,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:18:44,184 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-11-19 10:18:44,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:18:44,184 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2024-11-19 10:18:44,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 10:18:44,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:44,184 INFO L215 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] [2024-11-19 10:18:44,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 10:18:44,185 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:18:44,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:44,185 INFO L85 PathProgramCache]: Analyzing trace with hash -446083371, now seen corresponding path program 1 times [2024-11-19 10:18:44,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:44,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740705883] [2024-11-19 10:18:44,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:44,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:44,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:18:44,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:18:44,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740705883] [2024-11-19 10:18:44,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740705883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:18:44,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475225043] [2024-11-19 10:18:44,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:44,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:18:44,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:18:44,300 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) [2024-11-19 10:18:44,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 10:18:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:44,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-19 10:18:44,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:18:44,554 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 1 [2024-11-19 10:18:44,619 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_6 Int)) (and (<= v_LDV_INIT_LIST_HEAD_~list.offset_6 |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (select |c_#memory_int#1| |c_LDV_INIT_LIST_HEAD_#in~list.base|)) (.cse1 (+ v_LDV_INIT_LIST_HEAD_~list.offset_6 4))) (store (store (select |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) v_LDV_INIT_LIST_HEAD_~list.offset_6 (select .cse0 v_LDV_INIT_LIST_HEAD_~list.offset_6)) .cse1 (select .cse0 .cse1))))))) is different from true [2024-11-19 10:18:44,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 10:18:44,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 10:18:44,655 INFO L378 Elim1Store]: Elim1 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 34 treesize of output 11 [2024-11-19 10:18:44,718 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 10:18:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:18:44,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:18:44,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475225043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:18:44,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:18:44,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 16 [2024-11-19 10:18:44,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378751484] [2024-11-19 10:18:44,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:18:44,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 10:18:44,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:18:44,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 10:18:44,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=177, Unknown=1, NotChecked=26, Total=240 [2024-11-19 10:18:44,737 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:18:44,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:18:44,876 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2024-11-19 10:18:44,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 10:18:44,877 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-11-19 10:18:44,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:18:44,878 INFO L225 Difference]: With dead ends: 39 [2024-11-19 10:18:44,878 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 10:18:44,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=231, Unknown=1, NotChecked=30, Total=306 [2024-11-19 10:18:44,879 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:18:44,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 122 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 57 Unchecked, 0.1s Time] [2024-11-19 10:18:44,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 10:18:44,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-19 10:18:44,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:18:44,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2024-11-19 10:18:44,883 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 24 [2024-11-19 10:18:44,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:18:44,884 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2024-11-19 10:18:44,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:18:44,884 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2024-11-19 10:18:44,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 10:18:44,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:44,885 INFO L215 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] [2024-11-19 10:18:44,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 10:18:45,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:18:45,087 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:18:45,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:45,088 INFO L85 PathProgramCache]: Analyzing trace with hash -943682497, now seen corresponding path program 1 times [2024-11-19 10:18:45,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:45,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062587470] [2024-11-19 10:18:45,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:45,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:45,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:18:45,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:18:45,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062587470] [2024-11-19 10:18:45,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062587470] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:18:45,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380364044] [2024-11-19 10:18:45,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:45,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:18:45,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:18:45,245 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) [2024-11-19 10:18:45,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 10:18:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:45,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-19 10:18:45,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:18:45,390 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 1 [2024-11-19 10:18:45,429 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_9 Int)) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (select |c_#memory_int#1| |c_LDV_INIT_LIST_HEAD_#in~list.base|)) (.cse1 (+ v_LDV_INIT_LIST_HEAD_~list.offset_9 4))) (store (store (select |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) v_LDV_INIT_LIST_HEAD_~list.offset_9 (select .cse0 v_LDV_INIT_LIST_HEAD_~list.offset_9)) .cse1 (select .cse0 .cse1))))) (<= v_LDV_INIT_LIST_HEAD_~list.offset_9 |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2024-11-19 10:18:45,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 10:18:45,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 10:18:45,449 INFO L378 Elim1Store]: Elim1 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 36 treesize of output 13 [2024-11-19 10:18:45,488 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 10:18:45,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:18:45,503 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:18:45,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380364044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:18:45,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:18:45,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 13 [2024-11-19 10:18:45,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903724744] [2024-11-19 10:18:45,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:18:45,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 10:18:45,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:18:45,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 10:18:45,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=109, Unknown=1, NotChecked=20, Total=156 [2024-11-19 10:18:45,504 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:18:45,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:18:45,591 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2024-11-19 10:18:45,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 10:18:45,591 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-11-19 10:18:45,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:18:45,593 INFO L225 Difference]: With dead ends: 39 [2024-11-19 10:18:45,593 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 10:18:45,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=129, Unknown=1, NotChecked=22, Total=182 [2024-11-19 10:18:45,593 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:18:45,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 129 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 52 Unchecked, 0.1s Time] [2024-11-19 10:18:45,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 10:18:45,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2024-11-19 10:18:45,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:18:45,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2024-11-19 10:18:45,597 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 25 [2024-11-19 10:18:45,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:18:45,598 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2024-11-19 10:18:45,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:18:45,598 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2024-11-19 10:18:45,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 10:18:45,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:45,598 INFO L215 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, 1, 1, 1, 1] [2024-11-19 10:18:45,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 10:18:45,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-19 10:18:45,801 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:18:45,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:45,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1705101522, now seen corresponding path program 1 times [2024-11-19 10:18:45,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:45,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124918865] [2024-11-19 10:18:45,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:45,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:18:45,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:18:45,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124918865] [2024-11-19 10:18:45,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124918865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:18:45,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:18:45,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 10:18:45,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351764517] [2024-11-19 10:18:45,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:18:45,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 10:18:45,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:18:45,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 10:18:45,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:18:45,899 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:18:45,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:18:45,924 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2024-11-19 10:18:45,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 10:18:45,925 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2024-11-19 10:18:45,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:18:45,925 INFO L225 Difference]: With dead ends: 47 [2024-11-19 10:18:45,925 INFO L226 Difference]: Without dead ends: 37 [2024-11-19 10:18:45,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:18:45,926 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:18:45,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 156 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:18:45,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-19 10:18:45,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-19 10:18:45,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:18:45,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2024-11-19 10:18:45,929 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 30 [2024-11-19 10:18:45,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:18:45,930 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2024-11-19 10:18:45,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:18:45,930 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2024-11-19 10:18:45,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 10:18:45,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:45,931 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:18:45,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 10:18:45,931 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:18:45,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:45,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1088766988, now seen corresponding path program 1 times [2024-11-19 10:18:45,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:45,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801876466] [2024-11-19 10:18:45,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:45,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:46,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:18:46,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:18:46,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801876466] [2024-11-19 10:18:46,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801876466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:18:46,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487158818] [2024-11-19 10:18:46,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:46,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:18:46,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:18:46,079 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) [2024-11-19 10:18:46,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 10:18:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:46,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 138 conjuncts are in the unsatisfiable core [2024-11-19 10:18:46,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:18:46,278 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 1 [2024-11-19 10:18:46,325 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_13 Int)) (and (<= v_LDV_INIT_LIST_HEAD_~list.offset_13 |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (select |c_#memory_int#1| |c_LDV_INIT_LIST_HEAD_#in~list.base|)) (.cse1 (+ v_LDV_INIT_LIST_HEAD_~list.offset_13 4))) (store (store (select |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) v_LDV_INIT_LIST_HEAD_~list.offset_13 (select .cse0 v_LDV_INIT_LIST_HEAD_~list.offset_13)) .cse1 (select .cse0 .cse1))))))) is different from true [2024-11-19 10:18:46,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 10:18:46,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 10:18:46,344 INFO L378 Elim1Store]: Elim1 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 34 treesize of output 11 [2024-11-19 10:18:46,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 10:18:46,536 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 10:18:46,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:18:46,550 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:18:51,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487158818] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:18:51,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 10:18:51,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 18] total 21 [2024-11-19 10:18:51,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276625833] [2024-11-19 10:18:51,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 10:18:51,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 10:18:51,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:18:51,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 10:18:51,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=734, Unknown=2, NotChecked=54, Total=870 [2024-11-19 10:18:51,184 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 18 states have internal predecessors, (55), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 10:18:51,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:18:51,550 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2024-11-19 10:18:51,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 10:18:51,550 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 18 states have internal predecessors, (55), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2024-11-19 10:18:51,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:18:51,551 INFO L225 Difference]: With dead ends: 63 [2024-11-19 10:18:51,551 INFO L226 Difference]: Without dead ends: 37 [2024-11-19 10:18:51,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=129, Invalid=1205, Unknown=2, NotChecked=70, Total=1406 [2024-11-19 10:18:51,552 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:18:51,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 162 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 348 Invalid, 0 Unknown, 70 Unchecked, 0.2s Time] [2024-11-19 10:18:51,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-19 10:18:51,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-19 10:18:51,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 10:18:51,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2024-11-19 10:18:51,556 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2024-11-19 10:18:51,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:18:51,556 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2024-11-19 10:18:51,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 18 states have internal predecessors, (55), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 10:18:51,556 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2024-11-19 10:18:51,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 10:18:51,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:51,557 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:18:51,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 10:18:51,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:18:51,762 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:18:51,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:51,762 INFO L85 PathProgramCache]: Analyzing trace with hash 570157356, now seen corresponding path program 1 times [2024-11-19 10:18:51,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:51,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585132157] [2024-11-19 10:18:51,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:51,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:51,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:18:51,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:18:51,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585132157] [2024-11-19 10:18:51,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585132157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:18:51,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508134921] [2024-11-19 10:18:51,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:51,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:18:51,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:18:51,900 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) [2024-11-19 10:18:51,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 10:18:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:52,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 145 conjuncts are in the unsatisfiable core [2024-11-19 10:18:52,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:18:52,131 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 1 [2024-11-19 10:18:52,188 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_19 Int)) (and (<= v_LDV_INIT_LIST_HEAD_~list.offset_19 |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= (store |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (select |c_#memory_int#1| |c_LDV_INIT_LIST_HEAD_#in~list.base|)) (.cse1 (+ v_LDV_INIT_LIST_HEAD_~list.offset_19 4))) (store (store (select |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) v_LDV_INIT_LIST_HEAD_~list.offset_19 (select .cse0 v_LDV_INIT_LIST_HEAD_~list.offset_19)) .cse1 (select .cse0 .cse1)))) |c_#memory_int#1|))) is different from true [2024-11-19 10:18:52,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 10:18:52,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 10:18:52,210 INFO L378 Elim1Store]: Elim1 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 34 treesize of output 11 [2024-11-19 10:18:52,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 10:18:52,433 INFO L378 Elim1Store]: Elim1 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 [2024-11-19 10:18:52,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:18:52,460 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:18:56,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508134921] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:18:56,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 10:18:56,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 19] total 23 [2024-11-19 10:18:56,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243115883] [2024-11-19 10:18:56,832 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 10:18:56,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 10:18:56,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:18:56,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 10:18:56,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=840, Unknown=2, NotChecked=58, Total=992 [2024-11-19 10:18:56,833 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 10:18:57,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:18:57,162 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2024-11-19 10:18:57,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 10:18:57,163 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2024-11-19 10:18:57,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:18:57,163 INFO L225 Difference]: With dead ends: 62 [2024-11-19 10:18:57,163 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 10:18:57,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=131, Invalid=1203, Unknown=2, NotChecked=70, Total=1406 [2024-11-19 10:18:57,164 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:18:57,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 170 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 318 Invalid, 0 Unknown, 74 Unchecked, 0.2s Time] [2024-11-19 10:18:57,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 10:18:57,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 10:18:57,165 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) [2024-11-19 10:18:57,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 10:18:57,165 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2024-11-19 10:18:57,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:18:57,165 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 10:18:57,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 10:18:57,165 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 10:18:57,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 10:18:57,169 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-19 10:18:57,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-19 10:18:57,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-19 10:18:57,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-19 10:18:57,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 10:18:57,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:18:57,377 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:18:57,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 10:18:57,479 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:18:57,492 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-19 10:18:57,498 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-19 10:18:57,498 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-19 10:18:57,498 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-19 10:18:57,501 WARN L156 FloydHoareUtils]: Requires clause for LDV_INIT_LIST_HEAD contained old-variable. Original clause: (= |#memory_int#1| |old(#memory_int#1)|) Eliminated clause: true [2024-11-19 10:18:57,504 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 10:18:57,504 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-19 10:18:57,504 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-19 10:18:57,504 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-19 10:18:57,505 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable ldv_global_msg_list by function LDV_INIT_LIST_HEAD [2024-11-19 10:18:57,508 WARN L156 FloydHoareUtils]: Requires clause for ldv_kobject_put contained old-variable. Original clause: (let ((.cse1 (select (select |old(#memory_int#1)| |ldv_kobject_put_#in~kobj#1.base|) 12))) (and (let ((.cse0 (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (or (and .cse0 (= |ldv_kobject_put_#in~kobj#1.base| 0)) (and .cse0 (<= 2 .cse1) (<= .cse1 2)))) (or (< .cse1 2) (< 2 .cse1) (= |#memory_int#1| |old(#memory_int#1)|)))) Eliminated clause: (exists ((|old(#memory_int#1)| (Array Int (Array Int Int)))) (let ((.cse0 (= (select (select |old(#memory_int#1)| |ldv_kobject_put_#in~kobj#1.base|) 12) 2))) (and (or (not .cse0) (= |#memory_int#1| |old(#memory_int#1)|)) (let ((.cse1 (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (or (and .cse1 (= |ldv_kobject_put_#in~kobj#1.base| 0)) (and .cse1 .cse0)))))) [2024-11-19 10:18:57,510 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 10:18:57,510 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~kobj!offset [2024-11-19 10:18:57,510 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~kobj!base [2024-11-19 10:18:57,510 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~kobj!offset [2024-11-19 10:18:57,510 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-19 10:18:57,511 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-11-19 10:18:57,511 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~kobj!base,]]] [2024-11-19 10:18:57,511 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-19 10:18:57,511 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-19 10:18:57,511 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-19 10:18:57,511 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable ldv_global_msg_list by function ldv_kobject_put [2024-11-19 10:18:57,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:18:57 BoogieIcfgContainer [2024-11-19 10:18:57,512 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:18:57,513 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:18:57,513 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:18:57,513 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:18:57,514 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:18:42" (3/4) ... [2024-11-19 10:18:57,515 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 10:18:57,518 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2024-11-19 10:18:57,519 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2024-11-19 10:18:57,519 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2024-11-19 10:18:57,524 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2024-11-19 10:18:57,525 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-19 10:18:57,525 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-19 10:18:57,526 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 10:18:57,609 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:18:57,609 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 10:18:57,610 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:18:57,610 INFO L158 Benchmark]: Toolchain (without parser) took 16024.34ms. Allocated memory was 146.8MB in the beginning and 268.4MB in the end (delta: 121.6MB). Free memory was 74.1MB in the beginning and 124.7MB in the end (delta: -50.6MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. [2024-11-19 10:18:57,610 INFO L158 Benchmark]: CDTParser took 0.70ms. Allocated memory is still 146.8MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:18:57,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.22ms. Allocated memory was 146.8MB in the beginning and 213.9MB in the end (delta: 67.1MB). Free memory was 73.8MB in the beginning and 181.3MB in the end (delta: -107.6MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. [2024-11-19 10:18:57,611 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.15ms. Allocated memory is still 213.9MB. Free memory was 181.3MB in the beginning and 181.3MB in the end (delta: -54.3kB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2024-11-19 10:18:57,611 INFO L158 Benchmark]: Boogie Preprocessor took 81.33ms. Allocated memory is still 213.9MB. Free memory was 181.3MB in the beginning and 177.0MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 10:18:57,611 INFO L158 Benchmark]: RCFGBuilder took 431.14ms. Allocated memory is still 213.9MB. Free memory was 177.0MB in the beginning and 155.2MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-19 10:18:57,612 INFO L158 Benchmark]: TraceAbstraction took 14813.49ms. Allocated memory was 213.9MB in the beginning and 268.4MB in the end (delta: 54.5MB). Free memory was 154.1MB in the beginning and 131.0MB in the end (delta: 23.1MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2024-11-19 10:18:57,612 INFO L158 Benchmark]: Witness Printer took 97.10ms. Allocated memory is still 268.4MB. Free memory was 131.0MB in the beginning and 124.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 10:18:57,614 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.70ms. Allocated memory is still 146.8MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 544.22ms. Allocated memory was 146.8MB in the beginning and 213.9MB in the end (delta: 67.1MB). Free memory was 73.8MB in the beginning and 181.3MB in the end (delta: -107.6MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.15ms. Allocated memory is still 213.9MB. Free memory was 181.3MB in the beginning and 181.3MB in the end (delta: -54.3kB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.33ms. Allocated memory is still 213.9MB. Free memory was 181.3MB in the beginning and 177.0MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 431.14ms. Allocated memory is still 213.9MB. Free memory was 177.0MB in the beginning and 155.2MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 14813.49ms. Allocated memory was 213.9MB in the beginning and 268.4MB in the end (delta: 54.5MB). Free memory was 154.1MB in the beginning and 131.0MB in the end (delta: 23.1MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. * Witness Printer took 97.10ms. Allocated memory is still 268.4MB. Free memory was 131.0MB in the beginning and 124.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable ldv_global_msg_list by function LDV_INIT_LIST_HEAD - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~kobj!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~kobj!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~kobj!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~kobj!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable ldv_global_msg_list by function ldv_kobject_put * 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 - PositiveResult [Line: 659]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 659]: 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, 52 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 91 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 89 mSDsluCounter, 1869 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 253 IncrementalHoareTripleChecker+Unchecked, 1480 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1124 IncrementalHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 389 mSDtfsCounter, 1124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, InterpolantAutomatonStates: 110, 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, 12 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 383 NumberOfCodeBlocks, 383 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 367 ConstructedInterpolants, 8 QuantifiedInterpolants, 1625 SizeOfPredicates, 47 NumberOfNonLiveVariables, 1041 ConjunctsInSsa, 459 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 3/13 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 4 specifications checked. All of them hold - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 525]: Procedure Contract for ldv_malloc Derived contract for procedure ldv_malloc. Ensures: (ldv_global_msg_list == \old(ldv_global_msg_list)) RESULT: Ultimate proved your program to be correct! [2024-11-19 10:18:57,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE