./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-memsafety/stroeder2-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f 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/array-memsafety/stroeder2-alloca-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 eb1b14e8511764ce20ab6a88d1bf2bef8398fca052e797a3c06b53051dc2f2a5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:33:06,204 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:33:06,282 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 18:33:06,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:33:06,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:33:06,325 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:33:06,326 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:33:06,326 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:33:06,327 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:33:06,327 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:33:06,328 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:33:06,328 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:33:06,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:33:06,329 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:33:06,329 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:33:06,330 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:33:06,330 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 18:33:06,330 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:33:06,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:33:06,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:33:06,335 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:33:06,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 18:33:06,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:33:06,337 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 18:33:06,337 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:33:06,337 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 18:33:06,338 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:33:06,338 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:33:06,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 18:33:06,339 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:33:06,339 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:33:06,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:33:06,340 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:33:06,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:33:06,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:33:06,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:33:06,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:33:06,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 18:33:06,341 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:33:06,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:33:06,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:33:06,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:33:06,342 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:33:06,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:33:06,343 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 -> eb1b14e8511764ce20ab6a88d1bf2bef8398fca052e797a3c06b53051dc2f2a5 [2024-11-10 18:33:06,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:33:06,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:33:06,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:33:06,631 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:33:06,631 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:33:06,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/stroeder2-alloca-1.i [2024-11-10 18:33:08,143 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:33:08,397 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:33:08,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/stroeder2-alloca-1.i [2024-11-10 18:33:08,409 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a034a4f06/f0d2f3b1b6844b1491dc2301e764543d/FLAG87a8b4b9a [2024-11-10 18:33:08,720 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a034a4f06/f0d2f3b1b6844b1491dc2301e764543d [2024-11-10 18:33:08,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:33:08,724 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:33:08,725 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:33:08,725 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:33:08,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:33:08,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:33:08" (1/1) ... [2024-11-10 18:33:08,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d44e2b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:08, skipping insertion in model container [2024-11-10 18:33:08,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:33:08" (1/1) ... [2024-11-10 18:33:08,776 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:33:09,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:33:09,097 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:33:09,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:33:09,176 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:33:09,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:09 WrapperNode [2024-11-10 18:33:09,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:33:09,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:33:09,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:33:09,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:33:09,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:09" (1/1) ... [2024-11-10 18:33:09,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:09" (1/1) ... [2024-11-10 18:33:09,224 INFO L138 Inliner]: procedures = 116, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2024-11-10 18:33:09,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:33:09,227 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:33:09,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:33:09,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:33:09,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:09" (1/1) ... [2024-11-10 18:33:09,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:09" (1/1) ... [2024-11-10 18:33:09,242 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:09" (1/1) ... [2024-11-10 18:33:09,258 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-11-10 18:33:09,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:09" (1/1) ... [2024-11-10 18:33:09,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:09" (1/1) ... [2024-11-10 18:33:09,264 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:09" (1/1) ... [2024-11-10 18:33:09,269 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:09" (1/1) ... [2024-11-10 18:33:09,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:09" (1/1) ... [2024-11-10 18:33:09,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:09" (1/1) ... [2024-11-10 18:33:09,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:33:09,278 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:33:09,278 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:33:09,278 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:33:09,279 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:09" (1/1) ... [2024-11-10 18:33:09,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:33:09,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:33:09,327 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-10 18:33:09,333 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-10 18:33:09,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 18:33:09,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 18:33:09,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 18:33:09,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 18:33:09,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:33:09,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:33:09,497 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:33:09,500 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:33:09,665 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L539: havoc main_#t~ret11#1;call ULTIMATE.dealloc(main_#t~malloc8#1.base, main_#t~malloc8#1.offset);havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; [2024-11-10 18:33:09,681 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-10 18:33:09,681 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:33:09,699 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:33:09,699 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:33:09,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:33:09 BoogieIcfgContainer [2024-11-10 18:33:09,700 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:33:09,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:33:09,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:33:09,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:33:09,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:33:08" (1/3) ... [2024-11-10 18:33:09,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250ba1a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:33:09, skipping insertion in model container [2024-11-10 18:33:09,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:33:09" (2/3) ... [2024-11-10 18:33:09,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250ba1a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:33:09, skipping insertion in model container [2024-11-10 18:33:09,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:33:09" (3/3) ... [2024-11-10 18:33:09,711 INFO L112 eAbstractionObserver]: Analyzing ICFG stroeder2-alloca-1.i [2024-11-10 18:33:09,728 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:33:09,729 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-10 18:33:09,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:33:09,803 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;@3a70ecc1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:33:09,804 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-10 18:33:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 36 states have internal predecessors, (43), 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-10 18:33:09,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 18:33:09,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:09,816 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:33:09,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-10 18:33:09,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:09,823 INFO L85 PathProgramCache]: Analyzing trace with hash 321925578, now seen corresponding path program 1 times [2024-11-10 18:33:09,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:09,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359751966] [2024-11-10 18:33:09,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:09,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:10,148 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-10 18:33:10,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:10,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359751966] [2024-11-10 18:33:10,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359751966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:10,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:33:10,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:33:10,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049927623] [2024-11-10 18:33:10,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:10,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:33:10,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:10,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:33:10,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:33:10,186 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 36 states have internal predecessors, (43), 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) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-10 18:33:10,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:10,237 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2024-11-10 18:33:10,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:33:10,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) Word has length 7 [2024-11-10 18:33:10,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:10,251 INFO L225 Difference]: With dead ends: 70 [2024-11-10 18:33:10,251 INFO L226 Difference]: Without dead ends: 37 [2024-11-10 18:33:10,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:33:10,257 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:10,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 97 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:33:10,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-10 18:33:10,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2024-11-10 18:33:10,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 35 states have internal predecessors, (40), 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-10 18:33:10,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-11-10 18:33:10,290 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 7 [2024-11-10 18:33:10,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:10,290 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-11-10 18:33:10,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-10 18:33:10,291 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2024-11-10 18:33:10,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 18:33:10,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:10,293 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:33:10,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:33:10,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-10 18:33:10,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:10,294 INFO L85 PathProgramCache]: Analyzing trace with hash -260696272, now seen corresponding path program 1 times [2024-11-10 18:33:10,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:10,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194101416] [2024-11-10 18:33:10,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:10,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:10,420 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-10 18:33:10,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:10,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194101416] [2024-11-10 18:33:10,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194101416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:10,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:33:10,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:33:10,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668696685] [2024-11-10 18:33:10,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:10,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:33:10,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:10,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:33:10,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:33:10,426 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10 18:33:10,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:10,459 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2024-11-10 18:33:10,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:33:10,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) Word has length 12 [2024-11-10 18:33:10,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:10,464 INFO L225 Difference]: With dead ends: 57 [2024-11-10 18:33:10,464 INFO L226 Difference]: Without dead ends: 36 [2024-11-10 18:33:10,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:33:10,466 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 9 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:10,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 58 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:33:10,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-10 18:33:10,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-10 18:33:10,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 35 states have internal predecessors, (39), 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-10 18:33:10,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-10 18:33:10,477 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 12 [2024-11-10 18:33:10,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:10,477 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-10 18:33:10,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10 18:33:10,478 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-10 18:33:10,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 18:33:10,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:10,478 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:33:10,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:33:10,479 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-10 18:33:10,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:10,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1632658816, now seen corresponding path program 1 times [2024-11-10 18:33:10,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:10,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277424421] [2024-11-10 18:33:10,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:10,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:10,660 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-10 18:33:10,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:10,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277424421] [2024-11-10 18:33:10,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277424421] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:33:10,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833777572] [2024-11-10 18:33:10,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:10,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:33:10,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:33:10,665 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-10 18:33:10,668 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-10 18:33:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:10,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:33:10,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:33:10,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:33:10,817 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:33:10,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833777572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:10,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:33:10,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-10 18:33:10,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988533961] [2024-11-10 18:33:10,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:10,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:33:10,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:10,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:33:10,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:33:10,821 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-10 18:33:10,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:10,879 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2024-11-10 18:33:10,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:33:10,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) Word has length 12 [2024-11-10 18:33:10,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:10,883 INFO L225 Difference]: With dead ends: 37 [2024-11-10 18:33:10,883 INFO L226 Difference]: Without dead ends: 36 [2024-11-10 18:33:10,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:33:10,884 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:10,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 106 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:33:10,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-10 18:33:10,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-11-10 18:33:10,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 34 states have internal predecessors, (38), 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-10 18:33:10,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-10 18:33:10,896 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 12 [2024-11-10 18:33:10,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:10,896 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-10 18:33:10,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-10 18:33:10,897 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-10 18:33:10,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 18:33:10,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:10,897 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:33:10,918 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-10 18:33:11,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:33:11,104 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-10 18:33:11,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:11,105 INFO L85 PathProgramCache]: Analyzing trace with hash -927184250, now seen corresponding path program 1 times [2024-11-10 18:33:11,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:11,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805674830] [2024-11-10 18:33:11,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:11,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:11,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:33:11,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:11,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805674830] [2024-11-10 18:33:11,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805674830] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:33:11,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598393524] [2024-11-10 18:33:11,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:11,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:33:11,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:33:11,199 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-10 18:33:11,201 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-10 18:33:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:11,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:33:11,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:33:11,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:33:11,314 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:33:11,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:33:11,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598393524] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:33:11,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:33:11,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-10 18:33:11,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604447030] [2024-11-10 18:33:11,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:33:11,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 18:33:11,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:11,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 18:33:11,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:33:11,388 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 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-10 18:33:11,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:11,456 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2024-11-10 18:33:11,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 18:33:11,457 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 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) Word has length 13 [2024-11-10 18:33:11,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:11,459 INFO L225 Difference]: With dead ends: 51 [2024-11-10 18:33:11,459 INFO L226 Difference]: Without dead ends: 50 [2024-11-10 18:33:11,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:33:11,462 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:11,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:33:11,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-10 18:33:11,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-10 18:33:11,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.302325581395349) internal successors, (56), 49 states have internal predecessors, (56), 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-10 18:33:11,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2024-11-10 18:33:11,478 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 13 [2024-11-10 18:33:11,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:11,478 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-11-10 18:33:11,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 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-10 18:33:11,479 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2024-11-10 18:33:11,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 18:33:11,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:11,479 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:33:11,498 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-10 18:33:11,680 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,SelfDestructingSolverStorable3 [2024-11-10 18:33:11,681 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-10 18:33:11,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:11,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1274034886, now seen corresponding path program 1 times [2024-11-10 18:33:11,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:11,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389750505] [2024-11-10 18:33:11,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:11,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:11,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:33:11,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:11,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389750505] [2024-11-10 18:33:11,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389750505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:11,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:33:11,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:33:11,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671394123] [2024-11-10 18:33:11,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:11,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:33:11,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:11,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:33:11,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:33:11,771 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-10 18:33:11,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:11,798 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2024-11-10 18:33:11,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:33:11,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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) Word has length 17 [2024-11-10 18:33:11,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:11,800 INFO L225 Difference]: With dead ends: 65 [2024-11-10 18:33:11,802 INFO L226 Difference]: Without dead ends: 63 [2024-11-10 18:33:11,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:33:11,803 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:11,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 86 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:33:11,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-10 18:33:11,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2024-11-10 18:33:11,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 59 states have internal predecessors, (69), 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-10 18:33:11,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2024-11-10 18:33:11,816 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 17 [2024-11-10 18:33:11,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:11,816 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2024-11-10 18:33:11,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-10 18:33:11,817 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2024-11-10 18:33:11,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 18:33:11,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:11,818 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:33:11,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:33:11,818 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-10 18:33:11,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:11,819 INFO L85 PathProgramCache]: Analyzing trace with hash -840378024, now seen corresponding path program 1 times [2024-11-10 18:33:11,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:11,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008041174] [2024-11-10 18:33:11,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:11,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:11,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:33:11,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:11,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008041174] [2024-11-10 18:33:11,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008041174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:11,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:33:11,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:33:11,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24682695] [2024-11-10 18:33:11,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:11,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:33:11,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:11,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:33:11,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:33:11,908 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-10 18:33:11,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:11,942 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2024-11-10 18:33:11,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:33:11,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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) Word has length 18 [2024-11-10 18:33:11,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:11,943 INFO L225 Difference]: With dead ends: 88 [2024-11-10 18:33:11,943 INFO L226 Difference]: Without dead ends: 86 [2024-11-10 18:33:11,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:33:11,944 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:11,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 83 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:33:11,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-10 18:33:11,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2024-11-10 18:33:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 79 states have internal predecessors, (95), 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-10 18:33:11,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2024-11-10 18:33:11,962 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 18 [2024-11-10 18:33:11,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:11,962 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2024-11-10 18:33:11,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-10 18:33:11,963 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2024-11-10 18:33:11,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 18:33:11,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:11,963 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:33:11,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 18:33:11,964 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-10 18:33:11,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:11,964 INFO L85 PathProgramCache]: Analyzing trace with hash -147306024, now seen corresponding path program 1 times [2024-11-10 18:33:11,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:11,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756892851] [2024-11-10 18:33:11,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:11,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:33:12,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:33:12,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:33:12,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756892851] [2024-11-10 18:33:12,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756892851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:33:12,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:33:12,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:33:12,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153749814] [2024-11-10 18:33:12,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:33:12,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:33:12,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:33:12,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:33:12,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:33:12,066 INFO L87 Difference]: Start difference. First operand 80 states and 95 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-10 18:33:12,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:33:12,106 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2024-11-10 18:33:12,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:33:12,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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) Word has length 20 [2024-11-10 18:33:12,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:33:12,107 INFO L225 Difference]: With dead ends: 80 [2024-11-10 18:33:12,107 INFO L226 Difference]: Without dead ends: 79 [2024-11-10 18:33:12,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-10 18:33:12,108 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:33:12,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 91 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:33:12,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-10 18:33:12,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-10 18:33:12,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 73 states have (on average 1.273972602739726) internal successors, (93), 78 states have internal predecessors, (93), 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-10 18:33:12,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2024-11-10 18:33:12,115 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 20 [2024-11-10 18:33:12,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:33:12,116 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2024-11-10 18:33:12,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-10 18:33:12,116 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2024-11-10 18:33:12,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 18:33:12,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:33:12,117 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] [2024-11-10 18:33:12,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 18:33:12,117 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-10 18:33:12,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:33:12,118 INFO L85 PathProgramCache]: Analyzing trace with hash -271519465, now seen corresponding path program 1 times [2024-11-10 18:33:12,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:33:12,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30314671] [2024-11-10 18:33:12,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:33:12,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:33:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:33:12,156 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:33:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:33:12,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 18:33:12,200 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:33:12,202 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-10 18:33:12,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-10 18:33:12,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-10 18:33:12,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-10 18:33:12,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-10 18:33:12,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-10 18:33:12,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-10 18:33:12,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-10 18:33:12,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 18:33:12,208 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:33:12,236 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:33:12,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:33:12 BoogieIcfgContainer [2024-11-10 18:33:12,239 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:33:12,240 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:33:12,240 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:33:12,240 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:33:12,240 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:33:09" (3/4) ... [2024-11-10 18:33:12,241 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 18:33:12,287 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 18:33:12,287 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:33:12,290 INFO L158 Benchmark]: Toolchain (without parser) took 3566.58ms. Allocated memory was 146.8MB in the beginning and 205.5MB in the end (delta: 58.7MB). Free memory was 90.1MB in the beginning and 158.3MB in the end (delta: -68.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:33:12,290 INFO L158 Benchmark]: CDTParser took 1.00ms. Allocated memory is still 146.8MB. Free memory was 111.7MB in the beginning and 111.6MB in the end (delta: 116.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:33:12,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.97ms. Allocated memory is still 146.8MB. Free memory was 90.1MB in the beginning and 71.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 18:33:12,291 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.48ms. Allocated memory is still 146.8MB. Free memory was 71.2MB in the beginning and 69.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:33:12,291 INFO L158 Benchmark]: Boogie Preprocessor took 50.44ms. Allocated memory is still 146.8MB. Free memory was 69.1MB in the beginning and 67.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:33:12,291 INFO L158 Benchmark]: IcfgBuilder took 421.99ms. Allocated memory is still 146.8MB. Free memory was 67.6MB in the beginning and 53.9MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 18:33:12,292 INFO L158 Benchmark]: TraceAbstraction took 2537.47ms. Allocated memory was 146.8MB in the beginning and 205.5MB in the end (delta: 58.7MB). Free memory was 53.5MB in the beginning and 160.4MB in the end (delta: -107.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:33:12,292 INFO L158 Benchmark]: Witness Printer took 50.03ms. Allocated memory is still 205.5MB. Free memory was 160.4MB in the beginning and 158.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:33:12,297 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.00ms. Allocated memory is still 146.8MB. Free memory was 111.7MB in the beginning and 111.6MB in the end (delta: 116.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 451.97ms. Allocated memory is still 146.8MB. Free memory was 90.1MB in the beginning and 71.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.48ms. Allocated memory is still 146.8MB. Free memory was 71.2MB in the beginning and 69.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.44ms. Allocated memory is still 146.8MB. Free memory was 69.1MB in the beginning and 67.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 421.99ms. Allocated memory is still 146.8MB. Free memory was 67.6MB in the beginning and 53.9MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2537.47ms. Allocated memory was 146.8MB in the beginning and 205.5MB in the end (delta: 58.7MB). Free memory was 53.5MB in the beginning and 160.4MB in the end (delta: -107.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 50.03ms. Allocated memory is still 205.5MB. Free memory was 160.4MB in the beginning and 158.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * 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 - CounterExampleResult [Line: 522]: integer overflow possible integer overflow possible We found a FailurePath: [L528] int array_size = __VERIFIER_nondet_int(); [L529] COND FALSE !(array_size < 1 || array_size >= 2147483647 / sizeof(int)) VAL [array_size=1] [L532] int* numbers = (int*) __builtin_alloca (array_size * sizeof(int)); [L534] int i = 0; VAL [array_size=1, i=0, numbers={3:0}] [L534] COND TRUE i < array_size [L536] numbers[i] = __VERIFIER_nondet_int() [L534] i++ VAL [array_size=1, i=1, numbers={3:0}] [L534] COND FALSE !(i < array_size) VAL [array_size=1, numbers={3:0}] [L539] CALL sumOfThirdBytes(numbers, array_size) [L514] int i, sum; [L515] char* p; [L516] sum = 0 [L517] i = 0 VAL [array_size=1, i=0, numbers={3:0}, sum=0] [L517] COND TRUE i < array_size [L518] p = &(numbers[i]) [L519] p = p + 2 VAL [array_size=1, i=0, numbers={3:0}, p={3:2}, sum=0] [L520] EXPR \read(*p) [L520] COND TRUE *p > 0 [L521] sum++ [L522] EXPR \read(*p) [L522] (*p)-- VAL [array_size=1, i=0, numbers={3:0}, p={3:2}, sum=1] - UnprovableResult [Line: 517]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 517]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 522]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 521]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 521]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 656 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 447 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 175 IncrementalHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 209 mSDtfsCounter, 175 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=6, InterpolantAutomatonStates: 37, 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, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 281 SizeOfPredicates, 0 NumberOfNonLiveVariables, 105 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 9/24 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-10 18:33:12,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)