./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/b.15-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 9da06905288f50cb44b9fcf3eb01ce9d3ae2a7ce975483c1902e3cc7a41605c5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:49:03,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:49:03,821 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-10 18:49:03,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:49:03,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:49:03,866 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:49:03,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:49:03,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:49:03,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:49:03,871 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:49:03,872 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:49:03,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:49:03,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:49:03,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:49:03,874 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:49:03,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:49:03,877 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 18:49:03,877 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:49:03,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:49:03,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 18:49:03,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:49:03,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 18:49:03,882 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:49:03,883 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 18:49:03,883 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:49:03,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 18:49:03,883 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:49:03,883 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:49:03,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:49:03,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:49:03,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:49:03,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:49:03,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:49:03,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:49:03,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 18:49:03,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:49:03,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:49:03,887 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:49:03,887 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:49:03,888 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:49:03,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:49:03,889 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9da06905288f50cb44b9fcf3eb01ce9d3ae2a7ce975483c1902e3cc7a41605c5 [2024-11-10 18:49:04,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:49:04,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:49:04,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:49:04,179 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:49:04,180 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:49:04,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i [2024-11-10 18:49:05,652 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:49:05,900 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:49:05,900 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i [2024-11-10 18:49:05,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e5d0896a/70004b6a8b16467aba5f7084717e7102/FLAG98368d536 [2024-11-10 18:49:05,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e5d0896a/70004b6a8b16467aba5f7084717e7102 [2024-11-10 18:49:05,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:49:05,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:49:05,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:49:05,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:49:05,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:49:05,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:49:05" (1/1) ... [2024-11-10 18:49:05,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d838090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:05, skipping insertion in model container [2024-11-10 18:49:05,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:49:05" (1/1) ... [2024-11-10 18:49:05,970 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:49:06,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:49:06,317 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:49:06,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:49:06,464 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:49:06,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:06 WrapperNode [2024-11-10 18:49:06,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:49:06,467 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:49:06,467 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:49:06,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:49:06,479 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:49:06" (1/1) ... [2024-11-10 18:49:06,496 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:49:06" (1/1) ... [2024-11-10 18:49:06,517 INFO L138 Inliner]: procedures = 111, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97 [2024-11-10 18:49:06,517 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:49:06,518 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:49:06,518 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:49:06,518 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:49:06,527 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:06" (1/1) ... [2024-11-10 18:49:06,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:06" (1/1) ... [2024-11-10 18:49:06,530 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:06" (1/1) ... [2024-11-10 18:49:06,550 INFO L175 MemorySlicer]: Split 15 memory accesses to 4 slices as follows [5, 5, 3, 2]. 33 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0]. The 6 writes are split as follows [2, 2, 1, 1]. [2024-11-10 18:49:06,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:06" (1/1) ... [2024-11-10 18:49:06,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:06" (1/1) ... [2024-11-10 18:49:06,556 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:06" (1/1) ... [2024-11-10 18:49:06,556 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:06" (1/1) ... [2024-11-10 18:49:06,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:06" (1/1) ... [2024-11-10 18:49:06,559 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:06" (1/1) ... [2024-11-10 18:49:06,561 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:49:06,562 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:49:06,562 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:49:06,562 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:49:06,563 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:06" (1/1) ... [2024-11-10 18:49:06,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:49:06,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:49:06,602 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:49:06,604 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:49:06,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 18:49:06,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 18:49:06,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 18:49:06,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 18:49:06,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 18:49:06,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 18:49:06,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 18:49:06,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 18:49:06,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 18:49:06,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 18:49:06,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:49:06,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:49:06,747 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:49:06,750 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:49:06,888 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L566: havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;havoc main_#t~ret19#1; [2024-11-10 18:49:06,889 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L563: havoc test_fun_#t~mem15#1;call ULTIMATE.dealloc(test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset);havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset);havoc test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset);havoc test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset);havoc test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset; [2024-11-10 18:49:06,904 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-10 18:49:06,904 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:49:06,923 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:49:06,924 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:49:06,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:49:06 BoogieIcfgContainer [2024-11-10 18:49:06,924 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:49:06,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:49:06,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:49:06,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:49:06,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:49:05" (1/3) ... [2024-11-10 18:49:06,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53469eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:49:06, skipping insertion in model container [2024-11-10 18:49:06,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:06" (2/3) ... [2024-11-10 18:49:06,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53469eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:49:06, skipping insertion in model container [2024-11-10 18:49:06,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:49:06" (3/3) ... [2024-11-10 18:49:06,934 INFO L112 eAbstractionObserver]: Analyzing ICFG b.15-alloca.i [2024-11-10 18:49:06,956 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:49:06,956 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-10 18:49:07,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:49:07,022 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;@34160636, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:49:07,022 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 18:49:07,028 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 21 states have internal predecessors, (26), 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:49:07,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 18:49:07,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:49:07,036 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:49:07,037 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-10 18:49:07,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:49:07,046 INFO L85 PathProgramCache]: Analyzing trace with hash -298138089, now seen corresponding path program 1 times [2024-11-10 18:49:07,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:49:07,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638328127] [2024-11-10 18:49:07,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:49:07,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:49:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:49:07,673 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:49:07,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:49:07,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638328127] [2024-11-10 18:49:07,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638328127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:49:07,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:49:07,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:49:07,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030365502] [2024-11-10 18:49:07,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:49:07,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:49:07,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:49:07,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:49:07,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:49:07,713 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 21 states have internal predecessors, (26), 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 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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:49:07,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:49:07,865 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2024-11-10 18:49:07,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:49:07,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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 8 [2024-11-10 18:49:07,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:49:07,881 INFO L225 Difference]: With dead ends: 53 [2024-11-10 18:49:07,881 INFO L226 Difference]: Without dead ends: 26 [2024-11-10 18:49:07,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:49:07,888 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 46 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:49:07,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 52 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:49:07,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-10 18:49:07,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2024-11-10 18:49:07,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.4375) internal successors, (23), 19 states have internal predecessors, (23), 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:49:07,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-10 18:49:07,926 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 8 [2024-11-10 18:49:07,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:49:07,927 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-10 18:49:07,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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:49:07,927 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-11-10 18:49:07,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 18:49:07,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:49:07,931 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:49:07,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:49:07,931 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:49:07,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:49:07,932 INFO L85 PathProgramCache]: Analyzing trace with hash -652346184, now seen corresponding path program 1 times [2024-11-10 18:49:07,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:49:07,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871306201] [2024-11-10 18:49:07,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:49:07,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:49:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:49:08,162 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:49:08,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:49:08,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871306201] [2024-11-10 18:49:08,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871306201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:49:08,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:49:08,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:49:08,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380433785] [2024-11-10 18:49:08,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:49:08,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:49:08,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:49:08,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:49:08,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:49:08,166 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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:49:08,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:49:08,246 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-11-10 18:49:08,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:49:08,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2024-11-10 18:49:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:49:08,248 INFO L225 Difference]: With dead ends: 33 [2024-11-10 18:49:08,248 INFO L226 Difference]: Without dead ends: 32 [2024-11-10 18:49:08,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:49:08,250 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 39 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:49:08,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 27 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:49:08,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-10 18:49:08,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2024-11-10 18:49:08,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.375) internal successors, (22), 18 states have internal predecessors, (22), 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:49:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-10 18:49:08,258 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 9 [2024-11-10 18:49:08,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:49:08,258 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-10 18:49:08,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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:49:08,258 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-11-10 18:49:08,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 18:49:08,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:49:08,259 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:49:08,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:49:08,259 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-10 18:49:08,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:49:08,261 INFO L85 PathProgramCache]: Analyzing trace with hash 160541814, now seen corresponding path program 1 times [2024-11-10 18:49:08,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:49:08,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48138040] [2024-11-10 18:49:08,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:49:08,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:49:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:49:08,544 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:49:08,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:49:08,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48138040] [2024-11-10 18:49:08,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48138040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:49:08,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:49:08,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 18:49:08,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074356017] [2024-11-10 18:49:08,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:49:08,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 18:49:08,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:49:08,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 18:49:08,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:49:08,548 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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:49:08,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:49:08,698 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-11-10 18:49:08,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:49:08,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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 11 [2024-11-10 18:49:08,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:49:08,699 INFO L225 Difference]: With dead ends: 29 [2024-11-10 18:49:08,699 INFO L226 Difference]: Without dead ends: 28 [2024-11-10 18:49:08,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:49:08,701 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 34 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:49:08,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 37 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:49:08,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-10 18:49:08,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2024-11-10 18:49:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 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:49:08,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-10 18:49:08,707 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 11 [2024-11-10 18:49:08,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:49:08,707 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-10 18:49:08,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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:49:08,707 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-10 18:49:08,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 18:49:08,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:49:08,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:49:08,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 18:49:08,708 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:49:08,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:49:08,708 INFO L85 PathProgramCache]: Analyzing trace with hash 681828916, now seen corresponding path program 1 times [2024-11-10 18:49:08,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:49:08,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733338247] [2024-11-10 18:49:08,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:49:08,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:49:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:49:08,885 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:49:08,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:49:08,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733338247] [2024-11-10 18:49:08,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733338247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:49:08,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:49:08,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:49:08,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141233280] [2024-11-10 18:49:08,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:49:08,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:49:08,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:49:08,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:49:08,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:49:08,889 INFO L87 Difference]: Start difference. First operand 22 states and 25 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:49:08,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:49:08,961 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-11-10 18:49:08,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:49:08,962 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:49:08,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:49:08,962 INFO L225 Difference]: With dead ends: 31 [2024-11-10 18:49:08,962 INFO L226 Difference]: Without dead ends: 30 [2024-11-10 18:49:08,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:49:08,964 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 28 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:49:08,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 19 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:49:08,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-10 18:49:08,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 21. [2024-11-10 18:49:08,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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:49:08,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-11-10 18:49:08,970 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 12 [2024-11-10 18:49:08,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:49:08,971 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-10 18:49:08,971 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:49:08,971 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-11-10 18:49:08,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 18:49:08,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:49:08,972 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:49:08,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:49:08,972 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-10 18:49:08,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:49:08,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1833627491, now seen corresponding path program 1 times [2024-11-10 18:49:08,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:49:08,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600703693] [2024-11-10 18:49:08,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:49:08,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:49:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:49:09,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 18:49:09,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:49:09,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600703693] [2024-11-10 18:49:09,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600703693] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:49:09,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910607141] [2024-11-10 18:49:09,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:49:09,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:49:09,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:49:09,355 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:49:09,357 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:49:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:49:09,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 18:49:09,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:49:09,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 18:49:09,760 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 40 treesize of output 17 [2024-11-10 18:49:09,834 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 42 treesize of output 19 [2024-11-10 18:49:09,855 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 17 treesize of output 9 [2024-11-10 18:49:09,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-10 18:49:09,899 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 17 treesize of output 9 [2024-11-10 18:49:09,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 18:49:09,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:49:10,134 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 25 treesize of output 17 [2024-11-10 18:49:10,138 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 23 treesize of output 15 [2024-11-10 18:49:10,150 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:49:10,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910607141] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:49:10,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:49:10,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 19 [2024-11-10 18:49:10,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599772191] [2024-11-10 18:49:10,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:49:10,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 18:49:10,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:49:10,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 18:49:10,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2024-11-10 18:49:10,157 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 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:49:10,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:49:10,411 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2024-11-10 18:49:10,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 18:49:10,412 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 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 16 [2024-11-10 18:49:10,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:49:10,412 INFO L225 Difference]: With dead ends: 25 [2024-11-10 18:49:10,413 INFO L226 Difference]: Without dead ends: 24 [2024-11-10 18:49:10,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2024-11-10 18:49:10,415 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 32 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:49:10,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 15 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:49:10,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-10 18:49:10,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2024-11-10 18:49:10,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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:49:10,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-10 18:49:10,424 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 16 [2024-11-10 18:49:10,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:49:10,424 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-10 18:49:10,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 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:49:10,424 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-11-10 18:49:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 18:49:10,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:49:10,425 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:49:10,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 18:49:10,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:49:10,626 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:49:10,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:49:10,627 INFO L85 PathProgramCache]: Analyzing trace with hash 2092436528, now seen corresponding path program 1 times [2024-11-10 18:49:10,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:49:10,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953777956] [2024-11-10 18:49:10,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:49:10,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:49:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:49:10,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 18:49:10,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:49:10,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953777956] [2024-11-10 18:49:10,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953777956] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:49:10,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40904395] [2024-11-10 18:49:10,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:49:10,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:49:10,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:49:10,835 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:49:10,836 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:49:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:49:10,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 18:49:10,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:49:10,934 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-10 18:49:10,976 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 17 treesize of output 9 [2024-11-10 18:49:11,006 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 17 treesize of output 9 [2024-11-10 18:49:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 18:49:11,012 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:49:11,047 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 23 treesize of output 15 [2024-11-10 18:49:11,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 18:49:11,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40904395] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:49:11,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:49:11,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 18:49:11,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474969173] [2024-11-10 18:49:11,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:49:11,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 18:49:11,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:49:11,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 18:49:11,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:49:11,081 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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:49:11,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:49:11,137 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2024-11-10 18:49:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:49:11,137 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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 19 [2024-11-10 18:49:11,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:49:11,138 INFO L225 Difference]: With dead ends: 20 [2024-11-10 18:49:11,138 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 18:49:11,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:49:11,139 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 10 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:49:11,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 22 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:49:11,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 18:49:11,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 18:49:11,140 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-10 18:49:11,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 18:49:11,140 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2024-11-10 18:49:11,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:49:11,140 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 18:49:11,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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:49:11,142 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 18:49:11,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 18:49:11,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-10 18:49:11,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-10 18:49:11,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-10 18:49:11,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-10 18:49:11,163 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:49:11,346 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,SelfDestructingSolverStorable5 [2024-11-10 18:49:11,349 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 18:49:11,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 18:49:11,451 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:49:11,462 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-10 18:49:11,463 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-10 18:49:11,463 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~z_ref~0!base,]]] [2024-11-10 18:49:11,464 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-10 18:49:11,464 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-10 18:49:11,464 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-10 18:49:11,464 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-10 18:49:11,464 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-10 18:49:11,464 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-11-10 18:49:11,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:49:11 BoogieIcfgContainer [2024-11-10 18:49:11,466 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:49:11,466 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:49:11,466 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:49:11,467 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:49:11,467 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:49:06" (3/4) ... [2024-11-10 18:49:11,469 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 18:49:11,479 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-10 18:49:11,479 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-10 18:49:11,479 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-10 18:49:11,479 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 18:49:11,565 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 18:49:11,568 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 18:49:11,568 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:49:11,569 INFO L158 Benchmark]: Toolchain (without parser) took 5642.00ms. Allocated memory was 167.8MB in the beginning and 241.2MB in the end (delta: 73.4MB). Free memory was 97.8MB in the beginning and 169.0MB in the end (delta: -71.2MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. [2024-11-10 18:49:11,569 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 167.8MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:49:11,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 537.43ms. Allocated memory is still 167.8MB. Free memory was 97.7MB in the beginning and 134.3MB in the end (delta: -36.6MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2024-11-10 18:49:11,569 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.68ms. Allocated memory is still 167.8MB. Free memory was 134.3MB in the beginning and 132.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:49:11,570 INFO L158 Benchmark]: Boogie Preprocessor took 43.74ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 130.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:49:11,570 INFO L158 Benchmark]: IcfgBuilder took 362.54ms. Allocated memory is still 167.8MB. Free memory was 130.2MB in the beginning and 115.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 18:49:11,570 INFO L158 Benchmark]: TraceAbstraction took 4539.09ms. Allocated memory was 167.8MB in the beginning and 241.2MB in the end (delta: 73.4MB). Free memory was 114.8MB in the beginning and 174.2MB in the end (delta: -59.4MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2024-11-10 18:49:11,570 INFO L158 Benchmark]: Witness Printer took 101.89ms. Allocated memory is still 241.2MB. Free memory was 174.2MB in the beginning and 169.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:49:11,572 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.28ms. Allocated memory is still 167.8MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 537.43ms. Allocated memory is still 167.8MB. Free memory was 97.7MB in the beginning and 134.3MB in the end (delta: -36.6MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.68ms. Allocated memory is still 167.8MB. Free memory was 134.3MB in the beginning and 132.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.74ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 130.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 362.54ms. Allocated memory is still 167.8MB. Free memory was 130.2MB in the beginning and 115.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4539.09ms. Allocated memory was 167.8MB in the beginning and 241.2MB in the end (delta: 73.4MB). Free memory was 114.8MB in the beginning and 174.2MB in the end (delta: -59.4MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Witness Printer took 101.89ms. Allocated memory is still 241.2MB. Free memory was 174.2MB in the beginning and 169.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~z_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] * 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: 560]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 560]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 559]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 559]: 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 1 procedures, 22 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 189 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 189 mSDsluCounter, 172 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 309 IncrementalHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 53 mSDtfsCounter, 309 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 38 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 1512 SizeOfPredicates, 24 NumberOfNonLiveVariables, 284 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 5/27 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: 558]: Location Invariant Derived location invariant: null - InvariantResult [Line: 557]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-10 18:49:11,609 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 Result: TRUE