./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-wip.fs.cvc5-61a6796-m [2024-10-14 20:20:15,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:20:15,060 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 20:20:15,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:20:15,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:20:15,097 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:20:15,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:20:15,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:20:15,098 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:20:15,098 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:20:15,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:20:15,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:20:15,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:20:15,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:20:15,104 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:20:15,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:20:15,104 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:20:15,104 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 20:20:15,105 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:20:15,105 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 20:20:15,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:20:15,105 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:20:15,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:20:15,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:20:15,106 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:20:15,106 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:20:15,106 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:20:15,107 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 20:20:15,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:20:15,107 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:20:15,107 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:20:15,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:20:15,107 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:20:15,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:20:15,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:20:15,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:20:15,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:20:15,108 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:20:15,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:20:15,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:20:15,109 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:20:15,110 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:20:15,110 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:20:15,110 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:20:15,111 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-10-14 20:20:15,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:20:15,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:20:15,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:20:15,351 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:20:15,355 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:20:15,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2024-10-14 20:20:16,780 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:20:16,989 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:20:16,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2024-10-14 20:20:17,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d95adc69/b5c2922349cd46ccaf2ae9c3dc86d079/FLAG455a73269 [2024-10-14 20:20:17,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d95adc69/b5c2922349cd46ccaf2ae9c3dc86d079 [2024-10-14 20:20:17,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:20:17,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:20:17,036 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:20:17,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:20:17,042 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:20:17,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:20:17" (1/1) ... [2024-10-14 20:20:17,043 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eab8b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:17, skipping insertion in model container [2024-10-14 20:20:17,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:20:17" (1/1) ... [2024-10-14 20:20:17,073 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:20:17,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:20:17,405 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:20:17,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:20:17,501 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:20:17,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:17 WrapperNode [2024-10-14 20:20:17,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:20:17,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:20:17,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:20:17,503 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:20:17,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:17" (1/1) ... [2024-10-14 20:20:17,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:17" (1/1) ... [2024-10-14 20:20:17,542 INFO L138 Inliner]: procedures = 166, calls = 72, calls flagged for inlining = 24, calls inlined = 18, statements flattened = 125 [2024-10-14 20:20:17,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:20:17,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:20:17,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:20:17,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:20:17,553 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:17" (1/1) ... [2024-10-14 20:20:17,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:17" (1/1) ... [2024-10-14 20:20:17,558 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:17" (1/1) ... [2024-10-14 20:20:17,580 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-10-14 20:20:17,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:17" (1/1) ... [2024-10-14 20:20:17,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:17" (1/1) ... [2024-10-14 20:20:17,588 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:17" (1/1) ... [2024-10-14 20:20:17,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:17" (1/1) ... [2024-10-14 20:20:17,593 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:17" (1/1) ... [2024-10-14 20:20:17,594 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:17" (1/1) ... [2024-10-14 20:20:17,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:20:17,597 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:20:17,597 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:20:17,597 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:20:17,598 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:17" (1/1) ... [2024-10-14 20:20:17,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:20:17,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:20:17,628 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-10-14 20:20:17,629 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-10-14 20:20:17,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 20:20:17,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 20:20:17,661 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-10-14 20:20:17,661 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-10-14 20:20:17,661 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-14 20:20:17,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-14 20:20:17,661 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2024-10-14 20:20:17,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2024-10-14 20:20:17,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 20:20:17,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 20:20:17,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 20:20:17,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 20:20:17,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 20:20:17,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 20:20:17,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 20:20:17,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 20:20:17,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 20:20:17,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 20:20:17,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 20:20:17,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:20:17,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:20:17,765 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:20:17,767 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:20:17,933 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2024-10-14 20:20:17,934 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:20:17,965 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:20:17,965 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 20:20:17,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:20:17 BoogieIcfgContainer [2024-10-14 20:20:17,966 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:20:17,967 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:20:17,967 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:20:17,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:20:17,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:20:17" (1/3) ... [2024-10-14 20:20:17,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d47357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:20:17, skipping insertion in model container [2024-10-14 20:20:17,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:17" (2/3) ... [2024-10-14 20:20:17,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d47357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:20:17, skipping insertion in model container [2024-10-14 20:20:17,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:20:17" (3/3) ... [2024-10-14 20:20:17,972 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_4.i [2024-10-14 20:20:17,984 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:20:17,984 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-14 20:20:18,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:20:18,051 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;@4fc7146b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:20:18,051 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-14 20:20:18,054 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 32 states have internal predecessors, (40), 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-10-14 20:20:18,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 20:20:18,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:18,062 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:20:18,063 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-10-14 20:20:18,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:18,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1198931051, now seen corresponding path program 1 times [2024-10-14 20:20:18,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:18,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563922128] [2024-10-14 20:20:18,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:18,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:18,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:20:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:18,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:20:18,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:18,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563922128] [2024-10-14 20:20:18,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563922128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:18,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:20:18,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 20:20:18,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110063652] [2024-10-14 20:20:18,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:18,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 20:20:18,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:18,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 20:20:18,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:20:18,490 INFO L87 Difference]: Start difference. First operand has 38 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 32 states have internal predecessors, (40), 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 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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-10-14 20:20:18,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:18,784 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2024-10-14 20:20:18,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:20:18,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2024-10-14 20:20:18,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:18,799 INFO L225 Difference]: With dead ends: 73 [2024-10-14 20:20:18,799 INFO L226 Difference]: Without dead ends: 40 [2024-10-14 20:20:18,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:20:18,808 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 22 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:18,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 103 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:20:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-14 20:20:18,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2024-10-14 20:20:18,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.375) internal successors, (33), 28 states have internal predecessors, (33), 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-10-14 20:20:18,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-10-14 20:20:18,862 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 11 [2024-10-14 20:20:18,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:18,862 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-10-14 20:20:18,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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-10-14 20:20:18,862 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-10-14 20:20:18,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 20:20:18,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:18,863 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:20:18,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:20:18,863 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-10-14 20:20:18,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:18,864 INFO L85 PathProgramCache]: Analyzing trace with hash 543879284, now seen corresponding path program 1 times [2024-10-14 20:20:18,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:18,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022608117] [2024-10-14 20:20:18,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:18,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:18,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:20:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:18,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:20:18,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:18,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022608117] [2024-10-14 20:20:18,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022608117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:18,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:20:18,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 20:20:18,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420449703] [2024-10-14 20:20:18,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:18,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:20:18,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:18,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:20:18,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:20:18,990 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-10-14 20:20:19,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:19,047 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2024-10-14 20:20:19,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:20:19,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2024-10-14 20:20:19,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:19,048 INFO L225 Difference]: With dead ends: 49 [2024-10-14 20:20:19,049 INFO L226 Difference]: Without dead ends: 37 [2024-10-14 20:20:19,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-14 20:20:19,050 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:19,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 79 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:20:19,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-14 20:20:19,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2024-10-14 20:20:19,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 30 states have internal predecessors, (35), 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-10-14 20:20:19,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-10-14 20:20:19,057 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 11 [2024-10-14 20:20:19,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:19,057 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-10-14 20:20:19,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-10-14 20:20:19,057 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-10-14 20:20:19,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 20:20:19,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:19,058 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:20:19,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 20:20:19,059 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-10-14 20:20:19,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:19,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1771642170, now seen corresponding path program 1 times [2024-10-14 20:20:19,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:19,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799304417] [2024-10-14 20:20:19,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:19,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:19,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:20:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:19,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:20:19,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:19,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799304417] [2024-10-14 20:20:19,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799304417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:19,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:20:19,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 20:20:19,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116743395] [2024-10-14 20:20:19,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:19,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 20:20:19,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:19,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 20:20:19,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:20:19,157 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 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-10-14 20:20:19,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:19,226 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2024-10-14 20:20:19,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 20:20:19,227 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 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 14 [2024-10-14 20:20:19,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:19,227 INFO L225 Difference]: With dead ends: 57 [2024-10-14 20:20:19,228 INFO L226 Difference]: Without dead ends: 42 [2024-10-14 20:20:19,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 20:20:19,229 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:19,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 112 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:20:19,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-14 20:20:19,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-10-14 20:20:19,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 32 states have internal predecessors, (38), 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-10-14 20:20:19,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-10-14 20:20:19,233 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 14 [2024-10-14 20:20:19,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:19,233 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-10-14 20:20:19,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 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-10-14 20:20:19,234 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-10-14 20:20:19,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 20:20:19,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:19,234 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:20:19,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 20:20:19,235 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:20:19,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:19,235 INFO L85 PathProgramCache]: Analyzing trace with hash 727278825, now seen corresponding path program 1 times [2024-10-14 20:20:19,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:19,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619334151] [2024-10-14 20:20:19,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:19,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:19,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:20:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:20:19,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:19,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619334151] [2024-10-14 20:20:19,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619334151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:19,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:20:19,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 20:20:19,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52416976] [2024-10-14 20:20:19,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:19,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 20:20:19,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:19,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 20:20:19,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:20:19,322 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 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-10-14 20:20:19,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:19,393 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2024-10-14 20:20:19,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 20:20:19,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 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 15 [2024-10-14 20:20:19,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:19,394 INFO L225 Difference]: With dead ends: 46 [2024-10-14 20:20:19,394 INFO L226 Difference]: Without dead ends: 36 [2024-10-14 20:20:19,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:20:19,395 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:19,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 129 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:20:19,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-14 20:20:19,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-14 20:20:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 30 states have internal predecessors, (35), 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-10-14 20:20:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-10-14 20:20:19,399 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 15 [2024-10-14 20:20:19,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:19,399 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-10-14 20:20:19,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 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-10-14 20:20:19,399 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-10-14 20:20:19,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 20:20:19,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:19,400 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:20:19,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 20:20:19,400 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:20:19,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:19,401 INFO L85 PathProgramCache]: Analyzing trace with hash 726373767, now seen corresponding path program 1 times [2024-10-14 20:20:19,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:19,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493102589] [2024-10-14 20:20:19,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:19,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:19,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:20:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:20:19,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:19,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493102589] [2024-10-14 20:20:19,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493102589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:19,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:20:19,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 20:20:19,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525026651] [2024-10-14 20:20:19,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:19,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 20:20:19,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:19,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 20:20:19,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:20:19,470 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-14 20:20:19,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:19,521 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2024-10-14 20:20:19,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:20:19,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2024-10-14 20:20:19,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:19,522 INFO L225 Difference]: With dead ends: 56 [2024-10-14 20:20:19,522 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 20:20:19,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:20:19,523 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:19,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 95 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:20:19,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 20:20:19,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-14 20:20:19,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 25 states have internal predecessors, (27), 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-10-14 20:20:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-10-14 20:20:19,526 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 14 [2024-10-14 20:20:19,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:19,526 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-10-14 20:20:19,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-14 20:20:19,527 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-10-14 20:20:19,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 20:20:19,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:19,527 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:20:19,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 20:20:19,528 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-10-14 20:20:19,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:19,528 INFO L85 PathProgramCache]: Analyzing trace with hash -257128081, now seen corresponding path program 1 times [2024-10-14 20:20:19,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:19,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710718232] [2024-10-14 20:20:19,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:19,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:19,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:20:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:20:19,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:19,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710718232] [2024-10-14 20:20:19,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710718232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:19,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:20:19,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 20:20:19,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454365497] [2024-10-14 20:20:19,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:19,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 20:20:19,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:19,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 20:20:19,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 20:20:19,611 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 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-10-14 20:20:19,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:19,676 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2024-10-14 20:20:19,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 20:20:19,677 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 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-10-14 20:20:19,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:19,677 INFO L225 Difference]: With dead ends: 46 [2024-10-14 20:20:19,677 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 20:20:19,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 20:20:19,678 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:19,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 88 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:20:19,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 20:20:19,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-14 20:20:19,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 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-10-14 20:20:19,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-10-14 20:20:19,681 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 16 [2024-10-14 20:20:19,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:19,681 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-10-14 20:20:19,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 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-10-14 20:20:19,681 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-10-14 20:20:19,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 20:20:19,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:19,682 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:20:19,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 20:20:19,682 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-10-14 20:20:19,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:19,682 INFO L85 PathProgramCache]: Analyzing trace with hash 256895061, now seen corresponding path program 1 times [2024-10-14 20:20:19,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:19,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060361437] [2024-10-14 20:20:19,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:19,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:19,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:20:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:19,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 20:20:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:19,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:20:19,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:19,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060361437] [2024-10-14 20:20:19,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060361437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:19,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:20:19,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 20:20:19,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303592111] [2024-10-14 20:20:19,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:19,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:20:19,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:19,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:20:19,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:20:19,771 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 20:20:19,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:19,820 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2024-10-14 20:20:19,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:20:19,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 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 19 [2024-10-14 20:20:19,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:19,820 INFO L225 Difference]: With dead ends: 52 [2024-10-14 20:20:19,821 INFO L226 Difference]: Without dead ends: 31 [2024-10-14 20:20:19,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:20:19,821 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 15 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:19,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 50 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:20:19,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-14 20:20:19,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-14 20:20:19,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 25 states have internal predecessors, (27), 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-10-14 20:20:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2024-10-14 20:20:19,824 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 19 [2024-10-14 20:20:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:19,825 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-10-14 20:20:19,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 20:20:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2024-10-14 20:20:19,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 20:20:19,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:19,825 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] [2024-10-14 20:20:19,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 20:20:19,826 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-10-14 20:20:19,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:19,826 INFO L85 PathProgramCache]: Analyzing trace with hash -384257256, now seen corresponding path program 1 times [2024-10-14 20:20:19,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:19,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063675610] [2024-10-14 20:20:19,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:19,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:19,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:20:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:19,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 20:20:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:20:19,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:19,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063675610] [2024-10-14 20:20:19,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063675610] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:20:19,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143048582] [2024-10-14 20:20:19,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:19,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:20:19,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:20:19,938 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-10-14 20:20:19,940 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-10-14 20:20:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:20,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-10-14 20:20:20,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:20:20,121 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-10-14 20:20:20,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 20:20:20,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 20:20:20,182 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-10-14 20:20:20,255 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-10-14 20:20:20,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:20:20,271 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:20:20,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143048582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:20,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:20:20,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 15 [2024-10-14 20:20:20,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710152303] [2024-10-14 20:20:20,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:20,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 20:20:20,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:20,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 20:20:20,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-14 20:20:20,273 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 11 states, 8 states have (on average 2.0) internal successors, (16), 10 states have internal predecessors, (16), 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-10-14 20:20:20,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:20,388 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-10-14 20:20:20,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 20:20:20,389 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.0) internal successors, (16), 10 states have internal predecessors, (16), 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 20 [2024-10-14 20:20:20,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:20,390 INFO L225 Difference]: With dead ends: 31 [2024-10-14 20:20:20,390 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 20:20:20,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-10-14 20:20:20,391 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:20,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 70 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:20:20,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 20:20:20,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-14 20:20:20,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 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-10-14 20:20:20,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-10-14 20:20:20,397 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2024-10-14 20:20:20,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:20,397 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-10-14 20:20:20,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.0) internal successors, (16), 10 states have internal predecessors, (16), 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-10-14 20:20:20,398 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-10-14 20:20:20,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 20:20:20,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:20,398 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] [2024-10-14 20:20:20,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 20:20:20,598 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-10-14 20:20:20,599 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-10-14 20:20:20,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:20,599 INFO L85 PathProgramCache]: Analyzing trace with hash 972927068, now seen corresponding path program 1 times [2024-10-14 20:20:20,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:20,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122160282] [2024-10-14 20:20:20,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:20,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:20,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:20:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:20,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 20:20:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:20,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:20:20,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:20,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122160282] [2024-10-14 20:20:20,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122160282] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:20:20,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334772134] [2024-10-14 20:20:20,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:20,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:20:20,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:20:20,712 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-10-14 20:20:20,713 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-10-14 20:20:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:20,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-10-14 20:20:20,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:20:20,837 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-10-14 20:20:20,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 20:20:20,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 20:20:20,886 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-10-14 20:20:20,935 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-10-14 20:20:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:20:20,952 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:20:20,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334772134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:20,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:20:20,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 15 [2024-10-14 20:20:20,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308572898] [2024-10-14 20:20:20,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:20,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 20:20:20,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:20,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 20:20:20,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-14 20:20:20,954 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 11 states, 8 states have (on average 2.125) internal successors, (17), 10 states have internal predecessors, (17), 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-10-14 20:20:21,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:21,056 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-10-14 20:20:21,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 20:20:21,057 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.125) internal successors, (17), 10 states have internal predecessors, (17), 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 21 [2024-10-14 20:20:21,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:21,057 INFO L225 Difference]: With dead ends: 31 [2024-10-14 20:20:21,057 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 20:20:21,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-10-14 20:20:21,058 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:21,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 76 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:20:21,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 20:20:21,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-10-14 20:20:21,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 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-10-14 20:20:21,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2024-10-14 20:20:21,061 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 21 [2024-10-14 20:20:21,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:21,061 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2024-10-14 20:20:21,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.125) internal successors, (17), 10 states have internal predecessors, (17), 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-10-14 20:20:21,061 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2024-10-14 20:20:21,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 20:20:21,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:21,061 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-10-14 20:20:21,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 20:20:21,265 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-10-14 20:20:21,266 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-10-14 20:20:21,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:21,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1940048499, now seen corresponding path program 1 times [2024-10-14 20:20:21,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:21,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697677739] [2024-10-14 20:20:21,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:21,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:21,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:20:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:21,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 20:20:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:21,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:20:21,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:21,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697677739] [2024-10-14 20:20:21,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697677739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:21,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:20:21,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 20:20:21,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992150177] [2024-10-14 20:20:21,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:21,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 20:20:21,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:21,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 20:20:21,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:20:21,420 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 6 states have internal predecessors, (19), 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-10-14 20:20:21,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:21,522 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2024-10-14 20:20:21,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 20:20:21,523 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 6 states have internal predecessors, (19), 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) Word has length 24 [2024-10-14 20:20:21,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:21,523 INFO L225 Difference]: With dead ends: 37 [2024-10-14 20:20:21,523 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 20:20:21,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-14 20:20:21,524 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:21,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 47 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:20:21,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 20:20:21,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-14 20:20:21,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 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-10-14 20:20:21,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2024-10-14 20:20:21,528 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2024-10-14 20:20:21,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:21,528 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2024-10-14 20:20:21,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 6 states have internal predecessors, (19), 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-10-14 20:20:21,528 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2024-10-14 20:20:21,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 20:20:21,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:21,528 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] [2024-10-14 20:20:21,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 20:20:21,529 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-10-14 20:20:21,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:21,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1271501007, now seen corresponding path program 1 times [2024-10-14 20:20:21,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:21,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119525241] [2024-10-14 20:20:21,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:21,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:21,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:20:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:21,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 20:20:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:20:21,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:21,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119525241] [2024-10-14 20:20:21,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119525241] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:20:21,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187091694] [2024-10-14 20:20:21,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:21,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:20:21,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:20:21,679 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-10-14 20:20:21,686 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-10-14 20:20:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:21,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-10-14 20:20:21,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:20:21,829 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-10-14 20:20:21,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 20:20:21,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 20:20:21,872 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-10-14 20:20:21,965 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 46 treesize of output 15 [2024-10-14 20:20:22,031 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-10-14 20:20:22,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:20:22,047 INFO L311 TraceCheckSpWp]: Computing backward predicates...