./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-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 aa61daf361995635005a262e43d385a4b2c55dcce46079a14f1db13e5b0af9cd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 04:06:35,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 04:06:35,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-17 04:06:35,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 04:06:35,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 04:06:35,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 04:06:35,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 04:06:35,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 04:06:35,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 04:06:35,863 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 04:06:35,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 04:06:35,864 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 04:06:35,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 04:06:35,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 04:06:35,868 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 04:06:35,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 04:06:35,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 04:06:35,869 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 04:06:35,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 04:06:35,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 04:06:35,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 04:06:35,874 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 04:06:35,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 04:06:35,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 04:06:35,875 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 04:06:35,875 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 04:06:35,875 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 04:06:35,876 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 04:06:35,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 04:06:35,876 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 04:06:35,876 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 04:06:35,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 04:06:35,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 04:06:35,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 04:06:35,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 04:06:35,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 04:06:35,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 04:06:35,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 04:06:35,881 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 04:06:35,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 04:06:35,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 04:06:35,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 04:06:35,883 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 04:06:35,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 04:06:35,884 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 -> aa61daf361995635005a262e43d385a4b2c55dcce46079a14f1db13e5b0af9cd [2024-11-17 04:06:36,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 04:06:36,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 04:06:36,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 04:06:36,171 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 04:06:36,171 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 04:06:36,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2024-11-17 04:06:37,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 04:06:38,021 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 04:06:38,022 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2024-11-17 04:06:38,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f9e7177e/d21ef35b704b46689e6cae71122e2e77/FLAG0ef8900e4 [2024-11-17 04:06:38,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f9e7177e/d21ef35b704b46689e6cae71122e2e77 [2024-11-17 04:06:38,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 04:06:38,068 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 04:06:38,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 04:06:38,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 04:06:38,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 04:06:38,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:06:38" (1/1) ... [2024-11-17 04:06:38,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66d6124e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:38, skipping insertion in model container [2024-11-17 04:06:38,077 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:06:38" (1/1) ... [2024-11-17 04:06:38,124 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 04:06:38,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 04:06:38,594 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 04:06:38,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 04:06:38,719 INFO L204 MainTranslator]: Completed translation [2024-11-17 04:06:38,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:38 WrapperNode [2024-11-17 04:06:38,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 04:06:38,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 04:06:38,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 04:06:38,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 04:06:38,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:38" (1/1) ... [2024-11-17 04:06:38,752 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:38" (1/1) ... [2024-11-17 04:06:38,786 INFO L138 Inliner]: procedures = 164, calls = 70, calls flagged for inlining = 24, calls inlined = 18, statements flattened = 123 [2024-11-17 04:06:38,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 04:06:38,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 04:06:38,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 04:06:38,788 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 04:06:38,797 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:38" (1/1) ... [2024-11-17 04:06:38,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:38" (1/1) ... [2024-11-17 04:06:38,801 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:38" (1/1) ... [2024-11-17 04:06:38,846 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [10, 2]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2]. The 7 writes are split as follows [7, 0]. [2024-11-17 04:06:38,846 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:38" (1/1) ... [2024-11-17 04:06:38,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:38" (1/1) ... [2024-11-17 04:06:38,858 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:38" (1/1) ... [2024-11-17 04:06:38,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:38" (1/1) ... [2024-11-17 04:06:38,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:38" (1/1) ... [2024-11-17 04:06:38,869 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:38" (1/1) ... [2024-11-17 04:06:38,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 04:06:38,876 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 04:06:38,876 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 04:06:38,877 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 04:06:38,878 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:38" (1/1) ... [2024-11-17 04:06:38,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 04:06:38,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:06:38,914 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-17 04:06:38,918 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-17 04:06:38,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 04:06:38,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 04:06:38,973 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-11-17 04:06:38,974 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-11-17 04:06:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-17 04:06:38,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-17 04:06:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 04:06:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 04:06:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 04:06:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 04:06:38,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 04:06:38,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 04:06:38,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 04:06:38,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 04:06:38,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 04:06:38,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-17 04:06:38,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-17 04:06:38,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 04:06:38,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 04:06:39,155 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 04:06:39,158 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 04:06:39,219 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc #t~malloc12.base, #t~malloc12.offset; [2024-11-17 04:06:39,401 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L690: havoc ldv_kref_put_#t~ret34#1; [2024-11-17 04:06:39,436 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2024-11-17 04:06:39,437 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 04:06:39,459 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 04:06:39,461 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 04:06:39,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:06:39 BoogieIcfgContainer [2024-11-17 04:06:39,462 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 04:06:39,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 04:06:39,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 04:06:39,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 04:06:39,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:06:38" (1/3) ... [2024-11-17 04:06:39,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c691967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:06:39, skipping insertion in model container [2024-11-17 04:06:39,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:38" (2/3) ... [2024-11-17 04:06:39,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c691967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:06:39, skipping insertion in model container [2024-11-17 04:06:39,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:06:39" (3/3) ... [2024-11-17 04:06:39,476 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1-1.i [2024-11-17 04:06:39,494 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 04:06:39,495 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-17 04:06:39,557 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 04:06:39,564 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;@63f374c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 04:06:39,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-17 04:06:39,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 47 states have internal predecessors, (55), 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-17 04:06:39,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 04:06:39,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:39,576 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:39,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:06:39,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:39,582 INFO L85 PathProgramCache]: Analyzing trace with hash 993464725, now seen corresponding path program 1 times [2024-11-17 04:06:39,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:39,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797143530] [2024-11-17 04:06:39,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:39,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:39,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:06:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:40,080 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-17 04:06:40,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:40,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797143530] [2024-11-17 04:06:40,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797143530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:40,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:06:40,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 04:06:40,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959453048] [2024-11-17 04:06:40,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:40,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 04:06:40,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:40,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 04:06:40,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 04:06:40,126 INFO L87 Difference]: Start difference. First operand has 51 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 47 states have internal predecessors, (55), 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) 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-17 04:06:40,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:40,240 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2024-11-17 04:06:40,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 04:06:40,247 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-17 04:06:40,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:40,255 INFO L225 Difference]: With dead ends: 94 [2024-11-17 04:06:40,256 INFO L226 Difference]: Without dead ends: 50 [2024-11-17 04:06:40,259 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-17 04:06:40,264 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 16 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:40,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 250 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:06:40,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-17 04:06:40,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2024-11-17 04:06:40,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 04:06:40,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-11-17 04:06:40,303 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 12 [2024-11-17 04:06:40,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:40,303 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-11-17 04:06:40,304 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-17 04:06:40,304 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-11-17 04:06:40,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 04:06:40,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:40,305 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:40,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 04:06:40,305 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:06:40,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:40,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1558692236, now seen corresponding path program 1 times [2024-11-17 04:06:40,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:40,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314829971] [2024-11-17 04:06:40,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:40,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:40,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:06:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:40,464 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-17 04:06:40,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:40,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314829971] [2024-11-17 04:06:40,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314829971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:40,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:06:40,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 04:06:40,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699766653] [2024-11-17 04:06:40,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:40,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 04:06:40,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:40,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 04:06:40,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 04:06:40,471 INFO L87 Difference]: Start difference. First operand 41 states and 46 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-17 04:06:40,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:40,542 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-11-17 04:06:40,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 04:06:40,543 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-17 04:06:40,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:40,544 INFO L225 Difference]: With dead ends: 58 [2024-11-17 04:06:40,544 INFO L226 Difference]: Without dead ends: 44 [2024-11-17 04:06:40,545 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-17 04:06:40,546 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:40,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 137 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:06:40,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-17 04:06:40,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2024-11-17 04:06:40,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 38 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 04:06:40,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2024-11-17 04:06:40,558 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 12 [2024-11-17 04:06:40,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:40,558 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-11-17 04:06:40,558 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-17 04:06:40,558 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-11-17 04:06:40,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 04:06:40,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:40,559 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:40,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 04:06:40,560 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:06:40,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:40,560 INFO L85 PathProgramCache]: Analyzing trace with hash -2108245737, now seen corresponding path program 1 times [2024-11-17 04:06:40,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:40,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969203925] [2024-11-17 04:06:40,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:40,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:40,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:06:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:40,765 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-17 04:06:40,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:40,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969203925] [2024-11-17 04:06:40,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969203925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:40,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:06:40,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 04:06:40,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342054060] [2024-11-17 04:06:40,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:40,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 04:06:40,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:40,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 04:06:40,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 04:06:40,768 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-17 04:06:40,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:40,822 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2024-11-17 04:06:40,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 04:06:40,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 15 [2024-11-17 04:06:40,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:40,823 INFO L225 Difference]: With dead ends: 50 [2024-11-17 04:06:40,824 INFO L226 Difference]: Without dead ends: 41 [2024-11-17 04:06:40,824 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-17 04:06:40,825 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:40,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 179 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:06:40,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-17 04:06:40,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2024-11-17 04:06:40,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 33 states have internal predecessors, (37), 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-17 04:06:40,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-11-17 04:06:40,834 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 15 [2024-11-17 04:06:40,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:40,835 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-11-17 04:06:40,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-17 04:06:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-11-17 04:06:40,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 04:06:40,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:40,836 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:40,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 04:06:40,836 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:06:40,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:40,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1477597867, now seen corresponding path program 1 times [2024-11-17 04:06:40,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:40,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758919093] [2024-11-17 04:06:40,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:40,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:40,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:06:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:40,974 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-17 04:06:40,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:40,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758919093] [2024-11-17 04:06:40,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758919093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:40,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:06:40,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 04:06:40,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146100414] [2024-11-17 04:06:40,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:40,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 04:06:40,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:40,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 04:06:40,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 04:06:40,978 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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-17 04:06:41,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:41,062 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2024-11-17 04:06:41,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 04:06:41,063 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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 17 [2024-11-17 04:06:41,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:41,064 INFO L225 Difference]: With dead ends: 67 [2024-11-17 04:06:41,064 INFO L226 Difference]: Without dead ends: 49 [2024-11-17 04:06:41,064 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-17 04:06:41,067 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 12 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:41,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 195 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:06:41,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-17 04:06:41,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2024-11-17 04:06:41,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 04:06:41,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2024-11-17 04:06:41,078 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 17 [2024-11-17 04:06:41,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:41,079 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2024-11-17 04:06:41,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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-17 04:06:41,079 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-11-17 04:06:41,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 04:06:41,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:41,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:41,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 04:06:41,080 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:06:41,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:41,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1184194860, now seen corresponding path program 1 times [2024-11-17 04:06:41,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:41,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602458129] [2024-11-17 04:06:41,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:41,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:41,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:06:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:41,202 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-17 04:06:41,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:41,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602458129] [2024-11-17 04:06:41,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602458129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:41,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:06:41,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 04:06:41,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689465585] [2024-11-17 04:06:41,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:41,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 04:06:41,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:41,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 04:06:41,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 04:06:41,211 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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-17 04:06:41,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:41,270 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2024-11-17 04:06:41,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 04:06:41,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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 17 [2024-11-17 04:06:41,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:41,271 INFO L225 Difference]: With dead ends: 68 [2024-11-17 04:06:41,272 INFO L226 Difference]: Without dead ends: 36 [2024-11-17 04:06:41,272 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-17 04:06:41,273 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 5 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:41,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 167 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:06:41,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-17 04:06:41,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-17 04:06:41,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 32 states have internal predecessors, (34), 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-17 04:06:41,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2024-11-17 04:06:41,281 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 17 [2024-11-17 04:06:41,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:41,282 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-11-17 04:06:41,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 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-17 04:06:41,282 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2024-11-17 04:06:41,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 04:06:41,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:41,283 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-17 04:06:41,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 04:06:41,284 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:06:41,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:41,285 INFO L85 PathProgramCache]: Analyzing trace with hash 540060704, now seen corresponding path program 1 times [2024-11-17 04:06:41,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:41,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139435026] [2024-11-17 04:06:41,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:41,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:41,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:06:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:41,408 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-17 04:06:41,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:41,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139435026] [2024-11-17 04:06:41,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139435026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:41,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:06:41,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 04:06:41,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291106913] [2024-11-17 04:06:41,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:41,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 04:06:41,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:41,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 04:06:41,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-17 04:06:41,410 INFO L87 Difference]: Start difference. First operand 36 states and 38 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-17 04:06:41,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:41,487 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2024-11-17 04:06:41,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 04:06:41,487 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-17 04:06:41,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:41,488 INFO L225 Difference]: With dead ends: 54 [2024-11-17 04:06:41,488 INFO L226 Difference]: Without dead ends: 36 [2024-11-17 04:06:41,489 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-17 04:06:41,489 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:41,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 174 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:06:41,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-17 04:06:41,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-17 04:06:41,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 31 states have internal predecessors, (33), 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-17 04:06:41,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-11-17 04:06:41,494 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 18 [2024-11-17 04:06:41,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:41,494 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-11-17 04:06:41,495 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-17 04:06:41,495 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-11-17 04:06:41,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 04:06:41,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:41,496 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-17 04:06:41,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 04:06:41,496 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:06:41,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:41,497 INFO L85 PathProgramCache]: Analyzing trace with hash 572865936, now seen corresponding path program 1 times [2024-11-17 04:06:41,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:41,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759533594] [2024-11-17 04:06:41,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:41,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:41,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:06:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:41,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 04:06:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:41,620 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-17 04:06:41,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:41,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759533594] [2024-11-17 04:06:41,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759533594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:41,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:06:41,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 04:06:41,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239756757] [2024-11-17 04:06:41,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:41,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 04:06:41,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:41,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 04:06:41,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 04:06:41,623 INFO L87 Difference]: Start difference. First operand 36 states and 37 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-17 04:06:41,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:41,684 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2024-11-17 04:06:41,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 04:06:41,685 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-17 04:06:41,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:41,685 INFO L225 Difference]: With dead ends: 63 [2024-11-17 04:06:41,686 INFO L226 Difference]: Without dead ends: 37 [2024-11-17 04:06:41,686 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-17 04:06:41,687 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:41,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 106 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:06:41,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-17 04:06:41,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-17 04:06:41,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 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-17 04:06:41,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2024-11-17 04:06:41,692 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 23 [2024-11-17 04:06:41,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:41,692 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2024-11-17 04:06:41,692 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-17 04:06:41,692 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2024-11-17 04:06:41,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-17 04:06:41,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:41,693 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-17 04:06:41,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 04:06:41,693 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:06:41,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:41,694 INFO L85 PathProgramCache]: Analyzing trace with hash 919463964, now seen corresponding path program 1 times [2024-11-17 04:06:41,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:41,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38890397] [2024-11-17 04:06:41,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:41,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:41,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:06:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:41,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-17 04:06:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:41,900 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-17 04:06:41,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:41,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38890397] [2024-11-17 04:06:41,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38890397] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:06:41,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802435754] [2024-11-17 04:06:41,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:41,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:06:41,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:06:41,903 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-17 04:06:41,905 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-17 04:06:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:42,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-17 04:06:42,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:06:42,179 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-17 04:06:42,243 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_8 Int)) (and (= (store |c_old(#memory_int#0)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (select |c_#memory_int#0| |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#0)| |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)))) |c_#memory_int#0|) (<= v_LDV_INIT_LIST_HEAD_~list.offset_8 |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2024-11-17 04:06:42,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 04:06:42,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 04:06:42,273 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-17 04:06:42,375 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-17 04:06:42,395 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-17 04:06:42,395 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 04:06:42,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802435754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:42,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 04:06:42,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 18 [2024-11-17 04:06:42,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630215497] [2024-11-17 04:06:42,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:42,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 04:06:42,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:42,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 04:06:42,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2024-11-17 04:06:42,398 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:06:42,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:42,558 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2024-11-17 04:06:42,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 04:06:42,559 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-11-17 04:06:42,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:42,559 INFO L225 Difference]: With dead ends: 37 [2024-11-17 04:06:42,560 INFO L226 Difference]: Without dead ends: 36 [2024-11-17 04:06:42,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 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-17 04:06:42,561 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:42,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 108 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2024-11-17 04:06:42,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-17 04:06:42,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-17 04:06:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 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-17 04:06:42,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-11-17 04:06:42,568 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 24 [2024-11-17 04:06:42,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:42,568 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-11-17 04:06:42,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:06:42,569 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-11-17 04:06:42,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 04:06:42,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:42,570 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-17 04:06:42,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-17 04:06:42,773 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-17 04:06:42,774 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:06:42,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:42,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1561388176, now seen corresponding path program 1 times [2024-11-17 04:06:42,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:42,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387903727] [2024-11-17 04:06:42,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:42,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:42,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:06:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:42,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-17 04:06:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:42,937 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-17 04:06:42,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:42,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387903727] [2024-11-17 04:06:42,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387903727] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:06:42,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268090272] [2024-11-17 04:06:42,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:42,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:06:42,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:06:42,946 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-17 04:06:42,951 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-17 04:06:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:43,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-17 04:06:43,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:06:43,164 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-17 04:06:43,234 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_12 Int)) (and (<= v_LDV_INIT_LIST_HEAD_~list.offset_12 |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= (store |c_old(#memory_int#0)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (select |c_#memory_int#0| |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#0)| |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)))) |c_#memory_int#0|))) is different from true [2024-11-17 04:06:43,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 04:06:43,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 04:06:43,265 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-17 04:06:43,363 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-17 04:06:43,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 04:06:43,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268090272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:43,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 04:06:43,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 18 [2024-11-17 04:06:43,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111999380] [2024-11-17 04:06:43,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:43,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 04:06:43,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:43,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 04:06:43,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2024-11-17 04:06:43,366 INFO L87 Difference]: Start difference. First operand 36 states and 37 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-17 04:06:43,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:43,511 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2024-11-17 04:06:43,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 04:06:43,512 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-17 04:06:43,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:43,512 INFO L225 Difference]: With dead ends: 37 [2024-11-17 04:06:43,513 INFO L226 Difference]: Without dead ends: 36 [2024-11-17 04:06:43,513 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-17 04:06:43,514 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:43,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 129 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2024-11-17 04:06:43,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-17 04:06:43,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-11-17 04:06:43,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 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-17 04:06:43,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2024-11-17 04:06:43,523 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 25 [2024-11-17 04:06:43,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:43,523 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-11-17 04:06:43,523 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-17 04:06:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2024-11-17 04:06:43,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 04:06:43,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:43,524 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] [2024-11-17 04:06:43,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 04:06:43,725 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-17 04:06:43,725 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:06:43,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:43,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1549742481, now seen corresponding path program 1 times [2024-11-17 04:06:43,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:43,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506349071] [2024-11-17 04:06:43,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:43,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:43,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:06:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:43,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-17 04:06:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:43,901 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-17 04:06:43,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:43,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506349071] [2024-11-17 04:06:43,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506349071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:43,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:06:43,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 04:06:43,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775554119] [2024-11-17 04:06:43,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:43,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 04:06:43,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:43,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 04:06:43,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-17 04:06:43,906 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 6 states have internal predecessors, (23), 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-17 04:06:44,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:44,006 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2024-11-17 04:06:44,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 04:06:44,006 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 6 states have internal predecessors, (23), 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 27 [2024-11-17 04:06:44,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:44,007 INFO L225 Difference]: With dead ends: 42 [2024-11-17 04:06:44,007 INFO L226 Difference]: Without dead ends: 35 [2024-11-17 04:06:44,007 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-17 04:06:44,008 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:44,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 138 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:06:44,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-17 04:06:44,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-17 04:06:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 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-17 04:06:44,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2024-11-17 04:06:44,018 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 27 [2024-11-17 04:06:44,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:44,018 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2024-11-17 04:06:44,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 6 states have internal predecessors, (23), 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-17 04:06:44,019 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2024-11-17 04:06:44,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-17 04:06:44,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:44,019 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] [2024-11-17 04:06:44,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 04:06:44,020 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:06:44,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:44,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1977332298, now seen corresponding path program 1 times [2024-11-17 04:06:44,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:44,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731320500] [2024-11-17 04:06:44,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:44,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:44,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:06:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:44,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-17 04:06:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:44,220 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-17 04:06:44,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:44,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731320500] [2024-11-17 04:06:44,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731320500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:06:44,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771140725] [2024-11-17 04:06:44,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:44,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:06:44,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:06:44,223 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-17 04:06:44,225 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-17 04:06:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:44,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 128 conjuncts are in the unsatisfiable core [2024-11-17 04:06:44,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:06:44,489 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-17 04:06:44,550 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_18 Int)) (and (= (store |c_old(#memory_int#0)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (select |c_#memory_int#0| |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#0)| |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)))) |c_#memory_int#0|) (<= v_LDV_INIT_LIST_HEAD_~list.offset_18 |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2024-11-17 04:06:44,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 04:06:44,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 04:06:44,575 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-17 04:06:44,762 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-17 04:06:44,854 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-17 04:06:44,875 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-17 04:06:44,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:06:49,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771140725] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:06:49,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 04:06:49,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 17] total 22 [2024-11-17 04:06:49,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101117664] [2024-11-17 04:06:49,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 04:06:49,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-17 04:06:49,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:49,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-17 04:06:49,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=734, Unknown=2, NotChecked=54, Total=870 [2024-11-17 04:06:49,315 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 18 states have internal predecessors, (54), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 04:06:49,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:49,822 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2024-11-17 04:06:49,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-17 04:06:49,823 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 18 states have internal predecessors, (54), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2024-11-17 04:06:49,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:49,824 INFO L225 Difference]: With dead ends: 59 [2024-11-17 04:06:49,824 INFO L226 Difference]: Without dead ends: 35 [2024-11-17 04:06:49,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=118, Invalid=1143, Unknown=3, NotChecked=68, Total=1332 [2024-11-17 04:06:49,826 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:49,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 108 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 341 Invalid, 0 Unknown, 33 Unchecked, 0.3s Time] [2024-11-17 04:06:49,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-17 04:06:49,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-17 04:06:49,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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-17 04:06:49,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2024-11-17 04:06:49,833 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2024-11-17 04:06:49,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:49,833 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2024-11-17 04:06:49,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 18 states have internal predecessors, (54), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 04:06:49,833 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2024-11-17 04:06:49,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-17 04:06:49,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:49,834 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] [2024-11-17 04:06:49,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 04:06:50,034 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-17 04:06:50,035 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 04:06:50,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:50,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1758680213, now seen corresponding path program 1 times [2024-11-17 04:06:50,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:50,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844203279] [2024-11-17 04:06:50,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:50,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:50,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:06:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:50,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-17 04:06:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:50,273 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-17 04:06:50,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:50,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844203279] [2024-11-17 04:06:50,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844203279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:06:50,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581354780] [2024-11-17 04:06:50,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:50,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:06:50,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:06:50,276 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-17 04:06:50,278 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-17 04:06:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:50,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 138 conjuncts are in the unsatisfiable core [2024-11-17 04:06:50,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:06:50,640 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-17 04:06:50,726 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_LDV_INIT_LIST_HEAD_~list.offset_25 Int)) (and (= |c_#memory_int#0| (store |c_old(#memory_int#0)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (let ((.cse0 (select |c_#memory_int#0| |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#0)| |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))))) (<= v_LDV_INIT_LIST_HEAD_~list.offset_25 |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2024-11-17 04:06:50,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 04:06:50,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 04:06:50,753 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-17 04:06:50,958 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-17 04:06:51,038 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-17 04:06:51,066 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-17 04:06:51,066 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:06:55,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581354780] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:06:55,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 04:06:55,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 18] total 24 [2024-11-17 04:06:55,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89599624] [2024-11-17 04:06:55,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 04:06:55,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-17 04:06:55,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:55,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-17 04:06:55,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=840, Unknown=2, NotChecked=58, Total=992 [2024-11-17 04:06:55,519 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 20 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 04:06:55,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:55,933 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2024-11-17 04:06:55,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-17 04:06:55,933 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 20 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2024-11-17 04:06:55,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:55,935 INFO L225 Difference]: With dead ends: 58 [2024-11-17 04:06:55,936 INFO L226 Difference]: Without dead ends: 0 [2024-11-17 04:06:55,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=120, Invalid=1141, Unknown=3, NotChecked=68, Total=1332 [2024-11-17 04:06:55,938 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:55,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 131 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 346 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2024-11-17 04:06:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-17 04:06:55,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-17 04:06:55,939 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-17 04:06:55,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-17 04:06:55,939 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2024-11-17 04:06:55,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:55,940 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 04:06:55,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 20 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 04:06:55,941 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-17 04:06:55,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-17 04:06:55,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-17 04:06:55,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-17 04:06:55,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-17 04:06:55,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-17 04:06:55,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-17 04:06:56,146 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-17 04:06:56,149 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:56,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-17 04:06:56,258 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 04:06:56,271 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-17 04:06:56,275 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 04:06:56,276 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 04:06:56,277 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-17 04:06:56,278 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-17 04:06:56,278 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-17 04:06:56,278 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!base [2024-11-17 04:06:56,278 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-17 04:06:56,280 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-17 04:06:56,280 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-17 04:06:56,281 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-17 04:06:56,284 WARN L156 FloydHoareUtils]: Requires clause for LDV_INIT_LIST_HEAD contained old-variable. Original clause: (and (= |#memory_$Pointer$#0.base| |old(#memory_$Pointer$#0.base)|) (= |#memory_int#0| |old(#memory_int#0)|) (= |old(#memory_$Pointer$#0.offset)| |#memory_$Pointer$#0.offset|)) Eliminated clause: true [2024-11-17 04:06:56,285 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-17 04:06:56,286 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-17 04:06:56,286 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-17 04:06:56,286 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-17 04:06:56,287 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-17 04:06:56,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 04:06:56 BoogieIcfgContainer [2024-11-17 04:06:56,287 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 04:06:56,288 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 04:06:56,289 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 04:06:56,289 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 04:06:56,289 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:06:39" (3/4) ... [2024-11-17 04:06:56,291 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-17 04:06:56,295 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2024-11-17 04:06:56,295 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2024-11-17 04:06:56,303 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 46 nodes and edges [2024-11-17 04:06:56,303 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-17 04:06:56,303 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-17 04:06:56,304 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-17 04:06:56,405 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 04:06:56,405 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-17 04:06:56,405 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 04:06:56,406 INFO L158 Benchmark]: Toolchain (without parser) took 18337.35ms. Allocated memory was 148.9MB in the beginning and 182.5MB in the end (delta: 33.6MB). Free memory was 118.8MB in the beginning and 127.7MB in the end (delta: -8.9MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2024-11-17 04:06:56,406 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 04:06:56,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 650.87ms. Allocated memory is still 148.9MB. Free memory was 118.8MB in the beginning and 93.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-17 04:06:56,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.71ms. Allocated memory is still 148.9MB. Free memory was 93.6MB in the beginning and 91.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 04:06:56,407 INFO L158 Benchmark]: Boogie Preprocessor took 88.02ms. Allocated memory is still 148.9MB. Free memory was 91.5MB in the beginning and 87.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 04:06:56,407 INFO L158 Benchmark]: IcfgBuilder took 587.24ms. Allocated memory is still 148.9MB. Free memory was 87.3MB in the beginning and 65.5MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-17 04:06:56,407 INFO L158 Benchmark]: TraceAbstraction took 16822.24ms. Allocated memory was 148.9MB in the beginning and 182.5MB in the end (delta: 33.6MB). Free memory was 65.1MB in the beginning and 134.0MB in the end (delta: -68.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 04:06:56,407 INFO L158 Benchmark]: Witness Printer took 117.46ms. Allocated memory is still 182.5MB. Free memory was 134.0MB in the beginning and 127.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-17 04:06:56,409 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.21ms. Allocated memory is still 117.4MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 650.87ms. Allocated memory is still 148.9MB. Free memory was 118.8MB in the beginning and 93.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.71ms. Allocated memory is still 148.9MB. Free memory was 93.6MB in the beginning and 91.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.02ms. Allocated memory is still 148.9MB. Free memory was 91.5MB in the beginning and 87.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 587.24ms. Allocated memory is still 148.9MB. Free memory was 87.3MB in the beginning and 65.5MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 16822.24ms. Allocated memory was 148.9MB in the beginning and 182.5MB in the end (delta: 33.6MB). Free memory was 65.1MB in the beginning and 134.0MB in the end (delta: -68.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 117.46ms. Allocated memory is still 182.5MB. Free memory was 134.0MB in the beginning and 127.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 * 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 3 procedures, 51 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 16.6s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 1822 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 176 IncrementalHoareTripleChecker+Unchecked, 1480 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1427 IncrementalHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 342 mSDtfsCounter, 1427 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 20 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 371 NumberOfCodeBlocks, 371 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 355 ConstructedInterpolants, 8 QuantifiedInterpolants, 1743 SizeOfPredicates, 39 NumberOfNonLiveVariables, 989 ConjunctsInSsa, 427 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 3/13 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: -1]: Location Invariant Derived location 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-17 04:06:56,439 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