./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_3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version fca748b1 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_3-1.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 cac2372de612a50e6cea0e2672ab51101a6ffa3bb2603a06b5c5aa59090db116 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 18:14:24,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 18:14:24,373 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-20 18:14:24,377 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 18:14:24,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 18:14:24,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 18:14:24,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 18:14:24,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 18:14:24,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 18:14:24,409 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 18:14:24,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 18:14:24,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 18:14:24,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 18:14:24,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 18:14:24,414 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 18:14:24,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 18:14:24,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 18:14:24,414 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 18:14:24,415 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 18:14:24,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 18:14:24,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 18:14:24,419 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 18:14:24,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 18:14:24,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 18:14:24,420 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 18:14:24,420 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 18:14:24,420 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 18:14:24,420 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 18:14:24,421 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 18:14:24,421 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 18:14:24,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 18:14:24,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 18:14:24,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 18:14:24,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 18:14:24,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 18:14:24,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 18:14:24,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 18:14:24,424 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 18:14:24,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 18:14:24,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 18:14:24,425 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 18:14:24,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 18:14:24,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 18:14:24,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 18:14:24,426 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 -> cac2372de612a50e6cea0e2672ab51101a6ffa3bb2603a06b5c5aa59090db116 [2024-11-20 18:14:24,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 18:14:24,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 18:14:24,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 18:14:24,680 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 18:14:24,681 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 18:14:24,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2024-11-20 18:14:26,070 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 18:14:26,301 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 18:14:26,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2024-11-20 18:14:26,317 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84a509f5e/c367d07ee642406699b2b42a04f37c44/FLAG2e91b5d96 [2024-11-20 18:14:26,331 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84a509f5e/c367d07ee642406699b2b42a04f37c44 [2024-11-20 18:14:26,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 18:14:26,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 18:14:26,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 18:14:26,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 18:14:26,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 18:14:26,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:14:26" (1/1) ... [2024-11-20 18:14:26,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@718ff63f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:26, skipping insertion in model container [2024-11-20 18:14:26,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:14:26" (1/1) ... [2024-11-20 18:14:26,389 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 18:14:26,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 18:14:26,786 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 18:14:26,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 18:14:26,888 INFO L204 MainTranslator]: Completed translation [2024-11-20 18:14:26,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:26 WrapperNode [2024-11-20 18:14:26,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 18:14:26,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 18:14:26,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 18:14:26,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 18:14:26,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:26" (1/1) ... [2024-11-20 18:14:26,919 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:26" (1/1) ... [2024-11-20 18:14:26,952 INFO L138 Inliner]: procedures = 166, calls = 73, calls flagged for inlining = 25, calls inlined = 19, statements flattened = 128 [2024-11-20 18:14:26,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 18:14:26,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 18:14:26,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 18:14:26,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 18:14:26,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:26" (1/1) ... [2024-11-20 18:14:26,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:26" (1/1) ... [2024-11-20 18:14:26,969 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:26" (1/1) ... [2024-11-20 18:14:26,988 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2024-11-20 18:14:26,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:26" (1/1) ... [2024-11-20 18:14:26,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:26" (1/1) ... [2024-11-20 18:14:26,997 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:26" (1/1) ... [2024-11-20 18:14:27,000 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:26" (1/1) ... [2024-11-20 18:14:27,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:26" (1/1) ... [2024-11-20 18:14:27,004 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:26" (1/1) ... [2024-11-20 18:14:27,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 18:14:27,008 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 18:14:27,008 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 18:14:27,009 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 18:14:27,009 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:26" (1/1) ... [2024-11-20 18:14:27,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 18:14:27,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 18:14:27,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 18:14:27,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 18:14:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 18:14:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 18:14:27,121 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-11-20 18:14:27,121 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-11-20 18:14:27,121 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-20 18:14:27,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-20 18:14:27,121 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2024-11-20 18:14:27,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2024-11-20 18:14:27,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 18:14:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 18:14:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 18:14:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 18:14:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 18:14:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 18:14:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 18:14:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 18:14:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 18:14:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-20 18:14:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-20 18:14:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 18:14:27,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 18:14:27,299 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 18:14:27,301 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 18:14:27,574 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-11-20 18:14:27,575 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 18:14:27,597 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 18:14:27,597 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 18:14:27,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:14:27 BoogieIcfgContainer [2024-11-20 18:14:27,598 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 18:14:27,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 18:14:27,602 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 18:14:27,605 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 18:14:27,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:14:26" (1/3) ... [2024-11-20 18:14:27,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3809ae28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:14:27, skipping insertion in model container [2024-11-20 18:14:27,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:14:26" (2/3) ... [2024-11-20 18:14:27,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3809ae28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:14:27, skipping insertion in model container [2024-11-20 18:14:27,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:14:27" (3/3) ... [2024-11-20 18:14:27,607 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3-1.i [2024-11-20 18:14:27,621 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 18:14:27,621 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-20 18:14:27,670 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 18:14:27,676 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;@50ba56e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 18:14:27,676 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-20 18:14:27,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 47 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-20 18:14:27,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 18:14:27,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:14:27,687 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:14:27,687 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:14:27,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:14:27,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1168148547, now seen corresponding path program 1 times [2024-11-20 18:14:27,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:14:27,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108313718] [2024-11-20 18:14:27,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:14:27,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:14:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:28,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 18:14:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:28,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 18:14:28,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:14:28,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108313718] [2024-11-20 18:14:28,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108313718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 18:14:28,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 18:14:28,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 18:14:28,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097395885] [2024-11-20 18:14:28,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 18:14:28,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 18:14:28,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:14:28,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 18:14:28,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 18:14:28,157 INFO L87 Difference]: Start difference. First operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 47 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 18:14:28,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:14:28,338 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2024-11-20 18:14:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 18:14:28,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-20 18:14:28,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:14:28,353 INFO L225 Difference]: With dead ends: 104 [2024-11-20 18:14:28,353 INFO L226 Difference]: Without dead ends: 66 [2024-11-20 18:14:28,356 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-11-20 18:14:28,359 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 27 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 18:14:28,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 192 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 18:14:28,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-20 18:14:28,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2024-11-20 18:14:28,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 47 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 18:14:28,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2024-11-20 18:14:28,395 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 12 [2024-11-20 18:14:28,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:14:28,396 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2024-11-20 18:14:28,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 18:14:28,396 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2024-11-20 18:14:28,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 18:14:28,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:14:28,397 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:14:28,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 18:14:28,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:14:28,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:14:28,398 INFO L85 PathProgramCache]: Analyzing trace with hash 574661788, now seen corresponding path program 1 times [2024-11-20 18:14:28,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:14:28,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61826451] [2024-11-20 18:14:28,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:14:28,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:14:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:28,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 18:14:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:28,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 18:14:28,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:14:28,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61826451] [2024-11-20 18:14:28,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61826451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 18:14:28,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 18:14:28,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 18:14:28,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031683897] [2024-11-20 18:14:28,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 18:14:28,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 18:14:28,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:14:28,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 18:14:28,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 18:14:28,553 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 18:14:28,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:14:28,659 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2024-11-20 18:14:28,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 18:14:28,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-20 18:14:28,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:14:28,660 INFO L225 Difference]: With dead ends: 89 [2024-11-20 18:14:28,661 INFO L226 Difference]: Without dead ends: 61 [2024-11-20 18:14:28,661 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-11-20 18:14:28,662 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 18 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 18:14:28,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 143 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 18:14:28,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-20 18:14:28,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2024-11-20 18:14:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 49 states have internal predecessors, (57), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 18:14:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2024-11-20 18:14:28,671 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 12 [2024-11-20 18:14:28,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:14:28,671 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2024-11-20 18:14:28,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 18:14:28,671 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2024-11-20 18:14:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-20 18:14:28,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:14:28,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:14:28,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 18:14:28,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:14:28,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:14:28,673 INFO L85 PathProgramCache]: Analyzing trace with hash 636052202, now seen corresponding path program 1 times [2024-11-20 18:14:28,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:14:28,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454882914] [2024-11-20 18:14:28,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:14:28,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:14:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:28,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 18:14:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 18:14:28,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:14:28,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454882914] [2024-11-20 18:14:28,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454882914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 18:14:28,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 18:14:28,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 18:14:28,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761955073] [2024-11-20 18:14:28,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 18:14:28,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 18:14:28,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:14:28,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 18:14:28,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 18:14:28,894 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 18:14:29,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:14:29,058 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2024-11-20 18:14:29,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 18:14:29,058 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-20 18:14:29,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:14:29,061 INFO L225 Difference]: With dead ends: 99 [2024-11-20 18:14:29,061 INFO L226 Difference]: Without dead ends: 68 [2024-11-20 18:14:29,062 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-11-20 18:14:29,065 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 24 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 18:14:29,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 213 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 18:14:29,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-20 18:14:29,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2024-11-20 18:14:29,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.297872340425532) internal successors, (61), 52 states have internal predecessors, (61), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 18:14:29,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2024-11-20 18:14:29,081 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 16 [2024-11-20 18:14:29,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:14:29,082 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2024-11-20 18:14:29,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 18:14:29,082 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2024-11-20 18:14:29,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-20 18:14:29,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:14:29,083 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:14:29,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 18:14:29,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:14:29,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:14:29,085 INFO L85 PathProgramCache]: Analyzing trace with hash 765134921, now seen corresponding path program 1 times [2024-11-20 18:14:29,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:14:29,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666131413] [2024-11-20 18:14:29,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:14:29,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:14:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:29,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 18:14:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:29,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 18:14:29,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:14:29,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666131413] [2024-11-20 18:14:29,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666131413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 18:14:29,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 18:14:29,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 18:14:29,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127661984] [2024-11-20 18:14:29,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 18:14:29,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 18:14:29,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:14:29,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 18:14:29,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 18:14:29,248 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 18:14:29,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:14:29,354 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2024-11-20 18:14:29,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 18:14:29,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-20 18:14:29,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:14:29,355 INFO L225 Difference]: With dead ends: 101 [2024-11-20 18:14:29,355 INFO L226 Difference]: Without dead ends: 60 [2024-11-20 18:14:29,356 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-11-20 18:14:29,357 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 17 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 18:14:29,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 181 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 18:14:29,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-20 18:14:29,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2024-11-20 18:14:29,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.25) internal successors, (55), 49 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 18:14:29,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2024-11-20 18:14:29,369 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 16 [2024-11-20 18:14:29,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:14:29,369 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2024-11-20 18:14:29,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 18:14:29,370 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2024-11-20 18:14:29,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 18:14:29,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:14:29,373 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:14:29,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 18:14:29,373 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:14:29,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:14:29,374 INFO L85 PathProgramCache]: Analyzing trace with hash 714815698, now seen corresponding path program 1 times [2024-11-20 18:14:29,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:14:29,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929801850] [2024-11-20 18:14:29,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:14:29,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:14:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:29,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 18:14:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 18:14:29,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:14:29,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929801850] [2024-11-20 18:14:29,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929801850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 18:14:29,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 18:14:29,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 18:14:29,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714066936] [2024-11-20 18:14:29,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 18:14:29,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 18:14:29,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:14:29,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 18:14:29,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 18:14:29,537 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 18:14:29,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:14:29,697 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2024-11-20 18:14:29,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 18:14:29,697 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-20 18:14:29,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:14:29,698 INFO L225 Difference]: With dead ends: 88 [2024-11-20 18:14:29,699 INFO L226 Difference]: Without dead ends: 54 [2024-11-20 18:14:29,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-20 18:14:29,700 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 25 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 18:14:29,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 260 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 18:14:29,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-20 18:14:29,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2024-11-20 18:14:29,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 18:14:29,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2024-11-20 18:14:29,706 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 18 [2024-11-20 18:14:29,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:14:29,706 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-11-20 18:14:29,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 18:14:29,706 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2024-11-20 18:14:29,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 18:14:29,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:14:29,707 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:14:29,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 18:14:29,708 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:14:29,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:14:29,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1450209133, now seen corresponding path program 1 times [2024-11-20 18:14:29,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:14:29,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801539641] [2024-11-20 18:14:29,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:14:29,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:14:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:29,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 18:14:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:29,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 18:14:29,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:14:29,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801539641] [2024-11-20 18:14:29,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801539641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 18:14:29,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 18:14:29,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 18:14:29,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532889325] [2024-11-20 18:14:29,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 18:14:29,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 18:14:29,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:14:29,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 18:14:29,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 18:14:29,820 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 18:14:29,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:14:29,949 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2024-11-20 18:14:29,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 18:14:29,949 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-20 18:14:29,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:14:29,950 INFO L225 Difference]: With dead ends: 86 [2024-11-20 18:14:29,950 INFO L226 Difference]: Without dead ends: 54 [2024-11-20 18:14:29,950 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-11-20 18:14:29,951 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 23 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 18:14:29,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 196 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 18:14:29,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-20 18:14:29,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2024-11-20 18:14:29,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 18:14:29,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2024-11-20 18:14:29,960 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 18 [2024-11-20 18:14:29,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:14:29,960 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2024-11-20 18:14:29,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 18:14:29,961 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2024-11-20 18:14:29,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-20 18:14:29,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:14:29,961 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:14:29,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 18:14:29,961 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:14:29,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:14:29,962 INFO L85 PathProgramCache]: Analyzing trace with hash 2129349698, now seen corresponding path program 1 times [2024-11-20 18:14:29,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:14:29,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349284607] [2024-11-20 18:14:29,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:14:29,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:14:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:30,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 18:14:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:30,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-20 18:14:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:30,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 18:14:30,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:14:30,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349284607] [2024-11-20 18:14:30,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349284607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 18:14:30,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 18:14:30,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 18:14:30,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167414060] [2024-11-20 18:14:30,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 18:14:30,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 18:14:30,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:14:30,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 18:14:30,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 18:14:30,120 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 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-11-20 18:14:30,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:14:30,215 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2024-11-20 18:14:30,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 18:14:30,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 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 23 [2024-11-20 18:14:30,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:14:30,216 INFO L225 Difference]: With dead ends: 97 [2024-11-20 18:14:30,216 INFO L226 Difference]: Without dead ends: 57 [2024-11-20 18:14:30,216 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-11-20 18:14:30,217 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 26 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 18:14:30,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 115 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 18:14:30,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-20 18:14:30,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2024-11-20 18:14:30,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.225) internal successors, (49), 44 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 18:14:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2024-11-20 18:14:30,227 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 23 [2024-11-20 18:14:30,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:14:30,227 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-11-20 18:14:30,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 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-11-20 18:14:30,228 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-11-20 18:14:30,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-20 18:14:30,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:14:30,229 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:14:30,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 18:14:30,229 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:14:30,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:14:30,230 INFO L85 PathProgramCache]: Analyzing trace with hash -2003043345, now seen corresponding path program 1 times [2024-11-20 18:14:30,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:14:30,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080099044] [2024-11-20 18:14:30,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:14:30,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:14:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:30,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 18:14:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:30,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 18:14:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:30,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 18:14:30,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:14:30,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080099044] [2024-11-20 18:14:30,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080099044] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 18:14:30,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800806965] [2024-11-20 18:14:30,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:14:30,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 18:14:30,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 18:14:30,437 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 18:14:30,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 18:14:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:30,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-20 18:14:30,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 18:14:30,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 18:14:30,726 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_8 Int)) (and (<= v_LDV_INIT_LIST_HEAD_~list.offset_8 |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (select |c_#memory_int#1| |c_LDV_INIT_LIST_HEAD_#in~list.base|)) (.cse1 (+ v_LDV_INIT_LIST_HEAD_~list.offset_8 4))) (store (store (select |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) v_LDV_INIT_LIST_HEAD_~list.offset_8 (select .cse0 v_LDV_INIT_LIST_HEAD_~list.offset_8)) .cse1 (select .cse0 .cse1))))))) is different from true [2024-11-20 18:14:30,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 18:14:30,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 18:14:30,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-20 18:14:30,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-20 18:14:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 18:14:30,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 18:14:30,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800806965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 18:14:30,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 18:14:30,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 15 [2024-11-20 18:14:30,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681652335] [2024-11-20 18:14:30,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 18:14:30,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 18:14:30,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:14:30,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 18:14:30,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=154, Unknown=1, NotChecked=24, Total=210 [2024-11-20 18:14:30,857 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 18:14:31,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:14:31,006 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2024-11-20 18:14:31,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 18:14:31,006 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-11-20 18:14:31,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:14:31,007 INFO L225 Difference]: With dead ends: 53 [2024-11-20 18:14:31,007 INFO L226 Difference]: Without dead ends: 52 [2024-11-20 18:14:31,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=178, Unknown=1, NotChecked=26, Total=240 [2024-11-20 18:14:31,008 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 17 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 18:14:31,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 267 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 169 Invalid, 0 Unknown, 70 Unchecked, 0.1s Time] [2024-11-20 18:14:31,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-20 18:14:31,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2024-11-20 18:14:31,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 18:14:31,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2024-11-20 18:14:31,015 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 24 [2024-11-20 18:14:31,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:14:31,015 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2024-11-20 18:14:31,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 18:14:31,015 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2024-11-20 18:14:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-20 18:14:31,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:14:31,016 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:14:31,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 18:14:31,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 18:14:31,217 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:14:31,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:14:31,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1964801435, now seen corresponding path program 1 times [2024-11-20 18:14:31,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:14:31,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600908274] [2024-11-20 18:14:31,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:14:31,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:14:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:31,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 18:14:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:31,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 18:14:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:31,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 18:14:31,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:14:31,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600908274] [2024-11-20 18:14:31,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600908274] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 18:14:31,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872451514] [2024-11-20 18:14:31,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:14:31,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 18:14:31,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 18:14:31,398 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 18:14:31,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 18:14:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:31,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-20 18:14:31,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 18:14:31,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 18:14:31,678 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_12 Int)) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (select |c_#memory_int#1| |c_LDV_INIT_LIST_HEAD_#in~list.base|)) (.cse1 (+ v_LDV_INIT_LIST_HEAD_~list.offset_12 4))) (store (store (select |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) v_LDV_INIT_LIST_HEAD_~list.offset_12 (select .cse0 v_LDV_INIT_LIST_HEAD_~list.offset_12)) .cse1 (select .cse0 .cse1))))) (<= v_LDV_INIT_LIST_HEAD_~list.offset_12 |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2024-11-20 18:14:31,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 18:14:31,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 18:14:31,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2024-11-20 18:14:31,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-20 18:14:31,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 18:14:31,805 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 18:14:31,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872451514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 18:14:31,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 18:14:31,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 18 [2024-11-20 18:14:31,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97335670] [2024-11-20 18:14:31,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 18:14:31,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 18:14:31,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:14:31,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 18:14:31,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2024-11-20 18:14:31,807 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 18:14:31,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:14:31,939 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2024-11-20 18:14:31,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 18:14:31,939 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-11-20 18:14:31,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:14:31,940 INFO L225 Difference]: With dead ends: 53 [2024-11-20 18:14:31,940 INFO L226 Difference]: Without dead ends: 52 [2024-11-20 18:14:31,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=296, Unknown=1, NotChecked=34, Total=380 [2024-11-20 18:14:31,941 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 18:14:31,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 239 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 159 Invalid, 0 Unknown, 75 Unchecked, 0.1s Time] [2024-11-20 18:14:31,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-20 18:14:31,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2024-11-20 18:14:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 18:14:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2024-11-20 18:14:31,949 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 25 [2024-11-20 18:14:31,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:14:31,949 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2024-11-20 18:14:31,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 18:14:31,949 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2024-11-20 18:14:31,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-20 18:14:31,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:14:31,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:14:31,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 18:14:32,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-20 18:14:32,151 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:14:32,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:14:32,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2055305755, now seen corresponding path program 1 times [2024-11-20 18:14:32,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:14:32,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465147133] [2024-11-20 18:14:32,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:14:32,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:14:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:32,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 18:14:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:32,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 18:14:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:32,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 18:14:32,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:14:32,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465147133] [2024-11-20 18:14:32,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465147133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 18:14:32,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 18:14:32,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 18:14:32,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669657600] [2024-11-20 18:14:32,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 18:14:32,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 18:14:32,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:14:32,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 18:14:32,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 18:14:32,331 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 6 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-11-20 18:14:32,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:14:32,498 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2024-11-20 18:14:32,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 18:14:32,499 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 6 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) Word has length 30 [2024-11-20 18:14:32,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:14:32,500 INFO L225 Difference]: With dead ends: 77 [2024-11-20 18:14:32,500 INFO L226 Difference]: Without dead ends: 55 [2024-11-20 18:14:32,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-20 18:14:32,501 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 31 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 18:14:32,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 164 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 18:14:32,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-20 18:14:32,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2024-11-20 18:14:32,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 18:14:32,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2024-11-20 18:14:32,511 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 30 [2024-11-20 18:14:32,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:14:32,511 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2024-11-20 18:14:32,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 6 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-11-20 18:14:32,512 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2024-11-20 18:14:32,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-20 18:14:32,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:14:32,512 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:14:32,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 18:14:32,513 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:14:32,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:14:32,513 INFO L85 PathProgramCache]: Analyzing trace with hash 936684971, now seen corresponding path program 1 times [2024-11-20 18:14:32,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:14:32,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8043106] [2024-11-20 18:14:32,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:14:32,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:14:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:32,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 18:14:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:32,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 18:14:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:32,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 18:14:32,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:14:32,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8043106] [2024-11-20 18:14:32,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8043106] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 18:14:32,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134530433] [2024-11-20 18:14:32,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:14:32,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 18:14:32,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 18:14:32,689 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 18:14:32,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 18:14:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:32,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 146 conjuncts are in the unsatisfiable core [2024-11-20 18:14:32,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 18:14:32,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 18:14:33,017 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_18 Int)) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (select |c_#memory_int#1| |c_LDV_INIT_LIST_HEAD_#in~list.base|)) (.cse1 (+ v_LDV_INIT_LIST_HEAD_~list.offset_18 4))) (store (store (select |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) v_LDV_INIT_LIST_HEAD_~list.offset_18 (select .cse0 v_LDV_INIT_LIST_HEAD_~list.offset_18)) .cse1 (select .cse0 .cse1))))) (<= v_LDV_INIT_LIST_HEAD_~list.offset_18 |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2024-11-20 18:14:33,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 18:14:33,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 18:14:33,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2024-11-20 18:14:33,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-20 18:14:33,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-20 18:14:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 18:14:33,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 18:14:37,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134530433] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 18:14:37,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 18:14:37,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19] total 24 [2024-11-20 18:14:37,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971813870] [2024-11-20 18:14:37,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 18:14:37,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-20 18:14:37,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:14:37,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-20 18:14:37,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=968, Unknown=2, NotChecked=62, Total=1122 [2024-11-20 18:14:37,907 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 18:14:38,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:14:38,782 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2024-11-20 18:14:38,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-20 18:14:38,782 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2024-11-20 18:14:38,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:14:38,784 INFO L225 Difference]: With dead ends: 103 [2024-11-20 18:14:38,784 INFO L226 Difference]: Without dead ends: 63 [2024-11-20 18:14:38,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=168, Invalid=1725, Unknown=3, NotChecked=84, Total=1980 [2024-11-20 18:14:38,786 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 53 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 18:14:38,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 309 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 701 Invalid, 0 Unknown, 67 Unchecked, 0.5s Time] [2024-11-20 18:14:38,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-20 18:14:38,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2024-11-20 18:14:38,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 48 states have internal predecessors, (52), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 18:14:38,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2024-11-20 18:14:38,798 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 34 [2024-11-20 18:14:38,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:14:38,798 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2024-11-20 18:14:38,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 18:14:38,798 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2024-11-20 18:14:38,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-20 18:14:38,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:14:38,799 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:14:38,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 18:14:38,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 18:14:39,000 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:14:39,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:14:39,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2073125879, now seen corresponding path program 1 times [2024-11-20 18:14:39,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:14:39,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767883740] [2024-11-20 18:14:39,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:14:39,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:14:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:39,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 18:14:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:39,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 18:14:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:39,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 18:14:39,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:14:39,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767883740] [2024-11-20 18:14:39,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767883740] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 18:14:39,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339114811] [2024-11-20 18:14:39,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:14:39,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 18:14:39,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 18:14:39,220 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 18:14:39,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 18:14:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:39,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 153 conjuncts are in the unsatisfiable core [2024-11-20 18:14:39,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 18:14:39,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 18:14:39,577 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_25 Int)) (and (<= v_LDV_INIT_LIST_HEAD_~list.offset_25 |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= (store |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (select |c_#memory_int#1| |c_LDV_INIT_LIST_HEAD_#in~list.base|)) (.cse1 (+ v_LDV_INIT_LIST_HEAD_~list.offset_25 4))) (store (store (select |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) v_LDV_INIT_LIST_HEAD_~list.offset_25 (select .cse0 v_LDV_INIT_LIST_HEAD_~list.offset_25)) .cse1 (select .cse0 .cse1)))) |c_#memory_int#1|))) is different from true [2024-11-20 18:14:39,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 18:14:39,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 18:14:39,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2024-11-20 18:14:39,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-20 18:14:39,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-20 18:14:39,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 18:14:39,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 18:14:44,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339114811] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 18:14:44,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 18:14:44,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 20] total 26 [2024-11-20 18:14:44,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580716830] [2024-11-20 18:14:44,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 18:14:44,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-20 18:14:44,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:14:44,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-20 18:14:44,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1090, Unknown=2, NotChecked=66, Total=1260 [2024-11-20 18:14:44,389 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 26 states, 25 states have (on average 2.4) internal successors, (60), 21 states have internal predecessors, (60), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 18:14:45,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:14:45,152 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2024-11-20 18:14:45,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-20 18:14:45,153 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 21 states have internal predecessors, (60), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2024-11-20 18:14:45,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:14:45,154 INFO L225 Difference]: With dead ends: 122 [2024-11-20 18:14:45,154 INFO L226 Difference]: Without dead ends: 59 [2024-11-20 18:14:45,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=178, Invalid=1802, Unknown=4, NotChecked=86, Total=2070 [2024-11-20 18:14:45,156 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 63 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 18:14:45,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 310 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 675 Invalid, 0 Unknown, 79 Unchecked, 0.5s Time] [2024-11-20 18:14:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-20 18:14:45,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2024-11-20 18:14:45,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 18:14:45,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2024-11-20 18:14:45,161 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 36 [2024-11-20 18:14:45,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:14:45,161 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2024-11-20 18:14:45,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 21 states have internal predecessors, (60), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 18:14:45,161 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2024-11-20 18:14:45,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-20 18:14:45,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:14:45,162 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:14:45,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-20 18:14:45,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 18:14:45,367 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:14:45,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:14:45,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1999145337, now seen corresponding path program 1 times [2024-11-20 18:14:45,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:14:45,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831454883] [2024-11-20 18:14:45,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:14:45,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:14:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:45,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 18:14:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:45,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 18:14:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:45,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 18:14:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:45,624 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 18:14:45,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:14:45,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831454883] [2024-11-20 18:14:45,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831454883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 18:14:45,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648552416] [2024-11-20 18:14:45,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:14:45,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 18:14:45,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 18:14:45,628 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 18:14:45,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 18:14:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:45,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 197 conjuncts are in the unsatisfiable core [2024-11-20 18:14:45,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 18:14:45,987 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 11 treesize of output 7 [2024-11-20 18:14:46,043 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_32 Int)) (and (<= v_LDV_INIT_LIST_HEAD_~list.offset_32 |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (select |c_#memory_int#1| |c_LDV_INIT_LIST_HEAD_#in~list.base|)) (.cse1 (+ v_LDV_INIT_LIST_HEAD_~list.offset_32 4))) (store (store (select |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) v_LDV_INIT_LIST_HEAD_~list.offset_32 (select .cse0 v_LDV_INIT_LIST_HEAD_~list.offset_32)) .cse1 (select .cse0 .cse1))))))) is different from true [2024-11-20 18:14:46,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 18:14:46,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 18:14:46,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2024-11-20 18:14:46,204 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 23 treesize of output 3 [2024-11-20 18:14:46,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-20 18:14:46,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-20 18:14:46,565 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 18:14:46,565 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 18:14:46,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648552416] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 18:14:46,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 18:14:46,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 24] total 32 [2024-11-20 18:14:46,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677785787] [2024-11-20 18:14:46,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 18:14:46,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-20 18:14:46,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:14:46,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-20 18:14:46,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1148, Unknown=1, NotChecked=68, Total=1332 [2024-11-20 18:14:46,886 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 32 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 26 states have internal predecessors, (80), 5 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-20 18:14:47,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:14:47,598 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2024-11-20 18:14:47,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-20 18:14:47,599 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 26 states have internal predecessors, (80), 5 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2024-11-20 18:14:47,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:14:47,599 INFO L225 Difference]: With dead ends: 101 [2024-11-20 18:14:47,599 INFO L226 Difference]: Without dead ends: 59 [2024-11-20 18:14:47,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=200, Invalid=1872, Unknown=2, NotChecked=88, Total=2162 [2024-11-20 18:14:47,600 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 38 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 18:14:47,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 307 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 644 Invalid, 0 Unknown, 56 Unchecked, 0.4s Time] [2024-11-20 18:14:47,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-20 18:14:47,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2024-11-20 18:14:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 18:14:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2024-11-20 18:14:47,610 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 48 [2024-11-20 18:14:47,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:14:47,610 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2024-11-20 18:14:47,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 26 states have internal predecessors, (80), 5 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-20 18:14:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2024-11-20 18:14:47,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-20 18:14:47,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:14:47,612 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:14:47,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-20 18:14:47,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-20 18:14:47,813 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-20 18:14:47,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:14:47,813 INFO L85 PathProgramCache]: Analyzing trace with hash -506140869, now seen corresponding path program 1 times [2024-11-20 18:14:47,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:14:47,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337259063] [2024-11-20 18:14:47,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:14:47,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:14:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:48,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 18:14:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:48,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-20 18:14:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:48,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 18:14:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:48,128 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 18:14:48,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:14:48,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337259063] [2024-11-20 18:14:48,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337259063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 18:14:48,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425098325] [2024-11-20 18:14:48,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:14:48,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 18:14:48,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 18:14:48,131 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 18:14:48,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-20 18:14:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:14:48,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 205 conjuncts are in the unsatisfiable core [2024-11-20 18:14:48,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 18:14:48,540 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 11 treesize of output 7 [2024-11-20 18:14:48,592 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_36 Int)) (and (<= v_LDV_INIT_LIST_HEAD_~list.offset_36 |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (select |c_#memory_int#1| |c_LDV_INIT_LIST_HEAD_#in~list.base|)) (.cse1 (+ v_LDV_INIT_LIST_HEAD_~list.offset_36 4))) (store (store (select |c_old(#memory_int#1)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) v_LDV_INIT_LIST_HEAD_~list.offset_36 (select .cse0 v_LDV_INIT_LIST_HEAD_~list.offset_36)) .cse1 (select .cse0 .cse1))))))) is different from true [2024-11-20 18:14:48,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 18:14:48,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 18:14:48,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2024-11-20 18:14:48,733 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 19 treesize of output 11 [2024-11-20 18:14:48,993 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 23 treesize of output 3 [2024-11-20 18:14:49,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-20 18:14:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 18:14:49,116 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 18:14:49,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425098325] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 18:14:49,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 18:14:49,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 24] total 33 [2024-11-20 18:14:49,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27690951] [2024-11-20 18:14:49,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 18:14:49,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-20 18:14:49,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:14:49,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-20 18:14:49,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1223, Unknown=1, NotChecked=70, Total=1406 [2024-11-20 18:14:49,406 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 33 states, 32 states have (on average 2.59375) internal successors, (83), 27 states have internal predecessors, (83), 5 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-20 18:14:50,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:14:50,272 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2024-11-20 18:14:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-20 18:14:50,273 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.59375) internal successors, (83), 27 states have internal predecessors, (83), 5 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2024-11-20 18:14:50,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:14:50,273 INFO L225 Difference]: With dead ends: 100 [2024-11-20 18:14:50,273 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 18:14:50,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=215, Invalid=2237, Unknown=2, NotChecked=96, Total=2550 [2024-11-20 18:14:50,275 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 33 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 18:14:50,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 397 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 893 Invalid, 0 Unknown, 59 Unchecked, 0.5s Time] [2024-11-20 18:14:50,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 18:14:50,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 18:14:50,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 18:14:50,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 18:14:50,276 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2024-11-20 18:14:50,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:14:50,276 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 18:14:50,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.59375) internal successors, (83), 27 states have internal predecessors, (83), 5 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-20 18:14:50,276 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 18:14:50,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 18:14:50,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-20 18:14:50,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-20 18:14:50,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-20 18:14:50,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-20 18:14:50,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-20 18:14:50,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 18:14:50,483 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:14:50,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 18:14:51,001 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 18:14:51,013 WARN L156 FloydHoareUtils]: Requires clause for ldv_malloc contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-11-20 18:14:51,015 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-20 18:14:51,016 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-20 18:14:51,017 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-20 18:14:51,018 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-20 18:14:51,018 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-20 18:14:51,018 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!base [2024-11-20 18:14:51,018 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-20 18:14:51,020 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-20 18:14:51,020 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-20 18:14:51,020 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-20 18:14:51,025 WARN L156 FloydHoareUtils]: Requires clause for LDV_INIT_LIST_HEAD contained old-variable. Original clause: (and (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|)) Eliminated clause: true [2024-11-20 18:14:51,028 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-20 18:14:51,028 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-20 18:14:51,028 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-20 18:14:51,028 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-20 18:14:51,029 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable ldv_global_msg_list by function LDV_INIT_LIST_HEAD [2024-11-20 18:14:51,037 WARN L156 FloydHoareUtils]: Requires clause for ldv_kobject_put contained old-variable. Original clause: (let ((.cse1 (and (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|))) (.cse0 (select (select |old(#memory_int#1)| |ldv_kobject_put_#in~kobj#1.base|) 12))) (and (or (< 1 .cse0) .cse1 (< .cse0 1)) (let ((.cse2 (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (or (and .cse2 (= |ldv_kobject_put_#in~kobj#1.base| 0)) (and .cse2 (<= 2 .cse0) (<= .cse0 2)) (and (<= 1 .cse0) .cse2 (<= .cse0 1)))) (or (< .cse0 2) .cse1 (< 2 .cse0)) (= |old(#valid)| |#valid|))) Eliminated clause: (exists ((|old(#memory_$Pointer$#1.offset)| (Array Int (Array Int Int))) (|old(#memory_int#1)| (Array Int (Array Int Int))) (|old(#memory_$Pointer$#1.base)| (Array Int (Array Int Int)))) (let ((.cse4 (select (select |old(#memory_int#1)| |ldv_kobject_put_#in~kobj#1.base|) 12))) (let ((.cse0 (and (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|))) (.cse2 (= .cse4 2)) (.cse1 (= .cse4 1))) (and (or .cse0 (not .cse1)) (or .cse0 (not .cse2)) (let ((.cse3 (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (or (and .cse3 (= |ldv_kobject_put_#in~kobj#1.base| 0)) (and .cse3 .cse2) (and .cse3 .cse1))))))) [2024-11-20 18:14:51,044 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-20 18:14:51,045 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~kobj!base [2024-11-20 18:14:51,045 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-20 18:14:51,045 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-20 18:14:51,045 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~kobj!offset [2024-11-20 18:14:51,046 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~kobj!base [2024-11-20 18:14:51,046 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~kobj!offset [2024-11-20 18:14:51,046 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-20 18:14:51,046 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-11-20 18:14:51,047 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~kobj!base,]]] [2024-11-20 18:14:51,047 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~kobj!offset [2024-11-20 18:14:51,048 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-20 18:14:51,048 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-11-20 18:14:51,048 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~kobj!base,]]] [2024-11-20 18:14:51,048 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-20 18:14:51,048 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-20 18:14:51,048 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-20 18:14:51,048 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-20 18:14:51,049 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-20 18:14:51,049 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-20 18:14:51,049 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-20 18:14:51,049 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-20 18:14:51,049 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-20 18:14:51,049 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-11-20 18:14:51,049 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~kobj!base,]]] [2024-11-20 18:14:51,049 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-20 18:14:51,049 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-20 18:14:51,049 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-20 18:14:51,050 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-11-20 18:14:51,050 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~kobj!base,]]] [2024-11-20 18:14:51,050 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-20 18:14:51,050 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-20 18:14:51,050 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~kobj!base,]]] [2024-11-20 18:14:51,050 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-20 18:14:51,050 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-20 18:14:51,050 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-20 18:14:51,051 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable ldv_global_msg_list by function ldv_kobject_put [2024-11-20 18:14:51,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:14:51 BoogieIcfgContainer [2024-11-20 18:14:51,052 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 18:14:51,052 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 18:14:51,053 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 18:14:51,053 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 18:14:51,053 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:14:27" (3/4) ... [2024-11-20 18:14:51,056 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 18:14:51,060 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2024-11-20 18:14:51,061 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2024-11-20 18:14:51,061 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2024-11-20 18:14:51,067 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2024-11-20 18:14:51,067 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-20 18:14:51,067 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-20 18:14:51,068 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 18:14:51,173 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 18:14:51,174 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 18:14:51,174 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 18:14:51,174 INFO L158 Benchmark]: Toolchain (without parser) took 24839.84ms. Allocated memory was 167.8MB in the beginning and 325.1MB in the end (delta: 157.3MB). Free memory was 112.5MB in the beginning and 160.7MB in the end (delta: -48.2MB). Peak memory consumption was 111.3MB. Max. memory is 16.1GB. [2024-11-20 18:14:51,175 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 167.8MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 18:14:51,175 INFO L158 Benchmark]: CACSL2BoogieTranslator took 552.31ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 88.0MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-20 18:14:51,175 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.47ms. Allocated memory is still 167.8MB. Free memory was 88.0MB in the beginning and 85.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 18:14:51,175 INFO L158 Benchmark]: Boogie Preprocessor took 54.03ms. Allocated memory is still 167.8MB. Free memory was 85.3MB in the beginning and 81.4MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 18:14:51,175 INFO L158 Benchmark]: RCFGBuilder took 589.62ms. Allocated memory is still 167.8MB. Free memory was 81.4MB in the beginning and 115.9MB in the end (delta: -34.5MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2024-11-20 18:14:51,176 INFO L158 Benchmark]: TraceAbstraction took 23450.44ms. Allocated memory was 167.8MB in the beginning and 325.1MB in the end (delta: 157.3MB). Free memory was 115.0MB in the beginning and 167.0MB in the end (delta: -52.0MB). Peak memory consumption was 106.1MB. Max. memory is 16.1GB. [2024-11-20 18:14:51,176 INFO L158 Benchmark]: Witness Printer took 121.45ms. Allocated memory is still 325.1MB. Free memory was 167.0MB in the beginning and 160.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 18:14:51,180 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.96ms. Allocated memory is still 167.8MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 552.31ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 88.0MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.47ms. Allocated memory is still 167.8MB. Free memory was 88.0MB in the beginning and 85.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.03ms. Allocated memory is still 167.8MB. Free memory was 85.3MB in the beginning and 81.4MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 589.62ms. Allocated memory is still 167.8MB. Free memory was 81.4MB in the beginning and 115.9MB in the end (delta: -34.5MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * TraceAbstraction took 23450.44ms. Allocated memory was 167.8MB in the beginning and 325.1MB in the end (delta: 157.3MB). Free memory was 115.0MB in the beginning and 167.0MB in the end (delta: -52.0MB). Peak memory consumption was 106.1MB. Max. memory is 16.1GB. * Witness Printer took 121.45ms. Allocated memory is still 325.1MB. Free memory was 167.0MB in the beginning and 160.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable ldv_global_msg_list by function LDV_INIT_LIST_HEAD - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~kobj!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~kobj!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~kobj!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~kobj!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~kobj!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~kobj!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~kobj!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~kobj!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~kobj!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~kobj!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot encode non-modifiability of on-heap variable ldv_global_msg_list by function ldv_kobject_put * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 667]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 667]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 659]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 659]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 54 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 22.8s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 410 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 408 mSDsluCounter, 3293 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 406 IncrementalHoareTripleChecker+Unchecked, 2833 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4257 IncrementalHoareTripleChecker+Invalid, 4769 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 460 mSDtfsCounter, 4257 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 442 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1557 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=3, InterpolantAutomatonStates: 184, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 69 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 579 NumberOfCodeBlocks, 579 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 559 ConstructedInterpolants, 12 QuantifiedInterpolants, 3406 SizeOfPredicates, 87 NumberOfNonLiveVariables, 1953 ConjunctsInSsa, 877 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 14/59 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 525]: Procedure Contract for ldv_malloc Derived contract for procedure ldv_malloc. Ensures: (ldv_global_msg_list == \old(ldv_global_msg_list)) RESULT: Ultimate proved your program to be correct! [2024-11-20 18:14:51,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE