./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/length_test03-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/length_test03-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 8d477dcc38abb71f88978d460e8393ef9ba09f24c134f3de362c4df2a3599c9a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:22:35,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:22:35,647 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:22:35,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:22:35,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:22:35,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:22:35,674 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:22:35,674 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:22:35,675 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:22:35,675 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:22:35,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:22:35,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:22:35,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:22:35,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:22:35,676 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:22:35,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:22:35,677 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:22:35,677 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:22:35,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:22:35,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:22:35,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:22:35,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:22:35,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:22:35,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:22:35,680 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:22:35,680 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:22:35,680 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:22:35,680 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:22:35,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:22:35,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:22:35,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:22:35,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:22:35,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:22:35,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:22:35,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:22:35,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:22:35,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:22:35,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:22:35,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:22:35,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:22:35,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:22:35,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:22:35,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:22:35,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:22:35,685 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-clean/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-clean/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 -> 8d477dcc38abb71f88978d460e8393ef9ba09f24c134f3de362c4df2a3599c9a [2024-10-11 20:22:35,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:22:35,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:22:35,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:22:35,953 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:22:35,956 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:22:35,957 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2024-10-11 20:22:37,387 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:22:37,593 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:22:37,593 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2024-10-11 20:22:37,603 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7f79493c9/d4295e6c206c4f5e91c19ad45fb4459c/FLAG50c59b480 [2024-10-11 20:22:37,617 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7f79493c9/d4295e6c206c4f5e91c19ad45fb4459c [2024-10-11 20:22:37,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:22:37,620 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:22:37,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:22:37,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:22:37,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:22:37,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:22:37" (1/1) ... [2024-10-11 20:22:37,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6edff263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:37, skipping insertion in model container [2024-10-11 20:22:37,639 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:22:37" (1/1) ... [2024-10-11 20:22:37,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:22:37,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:22:37,922 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:22:37,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:22:37,980 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:22:37,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:37 WrapperNode [2024-10-11 20:22:37,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:22:37,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:22:37,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:22:37,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:22:37,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:37" (1/1) ... [2024-10-11 20:22:38,006 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:37" (1/1) ... [2024-10-11 20:22:38,026 INFO L138 Inliner]: procedures = 123, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 93 [2024-10-11 20:22:38,027 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:22:38,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:22:38,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:22:38,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:22:38,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:37" (1/1) ... [2024-10-11 20:22:38,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:37" (1/1) ... [2024-10-11 20:22:38,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:37" (1/1) ... [2024-10-11 20:22:38,070 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 13, 10]. 52 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 13 writes are split as follows [0, 7, 6]. [2024-10-11 20:22:38,071 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:37" (1/1) ... [2024-10-11 20:22:38,071 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:37" (1/1) ... [2024-10-11 20:22:38,079 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:37" (1/1) ... [2024-10-11 20:22:38,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:37" (1/1) ... [2024-10-11 20:22:38,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:37" (1/1) ... [2024-10-11 20:22:38,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:37" (1/1) ... [2024-10-11 20:22:38,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:22:38,093 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:22:38,093 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:22:38,093 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:22:38,094 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:37" (1/1) ... [2024-10-11 20:22:38,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:22:38,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:38,125 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:22:38,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:22:38,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 20:22:38,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 20:22:38,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 20:22:38,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 20:22:38,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:22:38,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 20:22:38,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 20:22:38,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 20:22:38,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 20:22:38,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 20:22:38,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 20:22:38,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 20:22:38,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:22:38,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 20:22:38,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 20:22:38,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:22:38,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:22:38,168 INFO L130 BoogieDeclarations]: Found specification of procedure append [2024-10-11 20:22:38,168 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2024-10-11 20:22:38,298 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:22:38,302 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:22:38,515 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-10-11 20:22:38,516 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:22:38,539 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:22:38,540 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 20:22:38,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:22:38 BoogieIcfgContainer [2024-10-11 20:22:38,541 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:22:38,542 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:22:38,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:22:38,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:22:38,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:22:37" (1/3) ... [2024-10-11 20:22:38,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40dfd783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:22:38, skipping insertion in model container [2024-10-11 20:22:38,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:37" (2/3) ... [2024-10-11 20:22:38,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40dfd783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:22:38, skipping insertion in model container [2024-10-11 20:22:38,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:22:38" (3/3) ... [2024-10-11 20:22:38,547 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03-2.i [2024-10-11 20:22:38,560 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:22:38,560 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 20:22:38,601 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:22:38,607 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;@63bb4673, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:22:38,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 20:22:38,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.7) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:22:38,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 20:22:38,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:38,617 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:38,617 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:38,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:38,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1123568576, now seen corresponding path program 1 times [2024-10-11 20:22:38,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:38,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824945993] [2024-10-11 20:22:38,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:38,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:38,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-10-11 20:22:38,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:38,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824945993] [2024-10-11 20:22:38,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824945993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:38,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:22:38,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:22:38,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487514714] [2024-10-11 20:22:38,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:38,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:22:38,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:38,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:22:38,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:22:38,932 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.7) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-10-11 20:22:38,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:38,968 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2024-10-11 20:22:38,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:22:38,970 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-10-11 20:22:38,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:38,974 INFO L225 Difference]: With dead ends: 51 [2024-10-11 20:22:38,974 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 20:22:38,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:22:38,979 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:38,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:22:38,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 20:22:39,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-11 20:22:39,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:22:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-10-11 20:22:39,005 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 9 [2024-10-11 20:22:39,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:39,006 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-10-11 20:22:39,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-10-11 20:22:39,006 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-10-11 20:22:39,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 20:22:39,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:39,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:39,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:22:39,008 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-10-11 20:22:39,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:39,009 INFO L85 PathProgramCache]: Analyzing trace with hash 576572527, now seen corresponding path program 1 times [2024-10-11 20:22:39,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:39,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830053316] [2024-10-11 20:22:39,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:39,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:39,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 20:22:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:39,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:22:39,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:39,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830053316] [2024-10-11 20:22:39,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830053316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:39,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:22:39,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:22:39,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438075258] [2024-10-11 20:22:39,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:39,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:22:39,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:39,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:22:39,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:22:39,191 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:22:39,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:39,249 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2024-10-11 20:22:39,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:22:39,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-11 20:22:39,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:39,251 INFO L225 Difference]: With dead ends: 38 [2024-10-11 20:22:39,251 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 20:22:39,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-10-11 20:22:39,252 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:39,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 65 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:22:39,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 20:22:39,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2024-10-11 20:22:39,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.45) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:22:39,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-10-11 20:22:39,258 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2024-10-11 20:22:39,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:39,258 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-10-11 20:22:39,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:22:39,259 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-10-11 20:22:39,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 20:22:39,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:39,259 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:39,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:22:39,260 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:39,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:39,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1062043710, now seen corresponding path program 1 times [2024-10-11 20:22:39,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:39,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354613803] [2024-10-11 20:22:39,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:39,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:39,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 20:22:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:39,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:22:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:39,464 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 20:22:39,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:39,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354613803] [2024-10-11 20:22:39,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354613803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:39,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:22:39,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:22:39,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324802924] [2024-10-11 20:22:39,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:39,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:22:39,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:39,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:22:39,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:22:39,468 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:22:39,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:39,540 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-10-11 20:22:39,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:22:39,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-10-11 20:22:39,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:39,541 INFO L225 Difference]: With dead ends: 34 [2024-10-11 20:22:39,541 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 20:22:39,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:22:39,543 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:39,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 82 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:22:39,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 20:22:39,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-10-11 20:22:39,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.391304347826087) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:22:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-10-11 20:22:39,550 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 20 [2024-10-11 20:22:39,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:39,551 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-10-11 20:22:39,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:22:39,551 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-10-11 20:22:39,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 20:22:39,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:39,553 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:39,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:22:39,553 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:39,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:39,554 INFO L85 PathProgramCache]: Analyzing trace with hash -280291080, now seen corresponding path program 1 times [2024-10-11 20:22:39,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:39,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842560310] [2024-10-11 20:22:39,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:39,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:39,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 20:22:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:39,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:22:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:39,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 20:22:39,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:39,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842560310] [2024-10-11 20:22:39,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842560310] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:22:39,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69034892] [2024-10-11 20:22:39,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:39,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:39,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:39,830 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:22:39,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:22:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:39,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:22:39,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:22:40,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 20:22:40,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:22:40,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 20:22:40,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69034892] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:22:40,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:22:40,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-10-11 20:22:40,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753617807] [2024-10-11 20:22:40,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:22:40,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 20:22:40,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:40,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 20:22:40,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:22:40,103 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:22:40,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:40,258 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2024-10-11 20:22:40,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:22:40,263 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 27 [2024-10-11 20:22:40,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:40,263 INFO L225 Difference]: With dead ends: 47 [2024-10-11 20:22:40,263 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 20:22:40,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:22:40,265 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:40,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 114 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:22:40,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 20:22:40,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2024-10-11 20:22:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 31 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:22:40,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2024-10-11 20:22:40,277 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 27 [2024-10-11 20:22:40,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:40,277 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2024-10-11 20:22:40,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:22:40,278 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2024-10-11 20:22:40,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 20:22:40,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:40,278 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:40,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:22:40,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:40,483 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:40,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:40,484 INFO L85 PathProgramCache]: Analyzing trace with hash -771032299, now seen corresponding path program 1 times [2024-10-11 20:22:40,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:40,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434303267] [2024-10-11 20:22:40,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:40,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:40,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 20:22:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:40,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:22:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:40,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 20:22:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:22:41,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:41,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434303267] [2024-10-11 20:22:41,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434303267] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:22:41,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552670526] [2024-10-11 20:22:41,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:41,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:41,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:41,141 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:22:41,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:22:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:41,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:22:41,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:22:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:22:41,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:22:41,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552670526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:41,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:22:41,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-10-11 20:22:41,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833870527] [2024-10-11 20:22:41,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:41,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:22:41,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:41,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:22:41,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:22:41,327 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:22:41,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:41,359 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2024-10-11 20:22:41,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:22:41,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2024-10-11 20:22:41,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:41,364 INFO L225 Difference]: With dead ends: 38 [2024-10-11 20:22:41,364 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 20:22:41,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:22:41,365 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:41,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 84 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:22:41,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 20:22:41,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2024-10-11 20:22:41,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 30 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:22:41,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-10-11 20:22:41,370 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 30 [2024-10-11 20:22:41,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:41,370 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-10-11 20:22:41,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:22:41,370 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-10-11 20:22:41,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 20:22:41,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:41,371 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:41,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:22:41,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:41,576 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-10-11 20:22:41,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:41,577 INFO L85 PathProgramCache]: Analyzing trace with hash -747073387, now seen corresponding path program 1 times [2024-10-11 20:22:41,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:41,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111444919] [2024-10-11 20:22:41,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:41,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:41,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 20:22:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:41,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:22:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:41,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 20:22:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:42,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:22:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:42,064 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 20:22:42,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:42,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111444919] [2024-10-11 20:22:42,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111444919] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:22:42,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937660568] [2024-10-11 20:22:42,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:42,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:42,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:42,066 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:22:42,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:22:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:42,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:22:42,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:22:42,328 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 20:22:42,328 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:22:42,440 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 20:22:42,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937660568] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:22:42,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:22:42,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2024-10-11 20:22:42,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062484104] [2024-10-11 20:22:42,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:22:42,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 20:22:42,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:42,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 20:22:42,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2024-10-11 20:22:42,443 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 9 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-10-11 20:22:43,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:43,106 INFO L93 Difference]: Finished difference Result 96 states and 133 transitions. [2024-10-11 20:22:43,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-11 20:22:43,107 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 9 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 41 [2024-10-11 20:22:43,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:43,109 INFO L225 Difference]: With dead ends: 96 [2024-10-11 20:22:43,109 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 20:22:43,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=1013, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 20:22:43,110 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:43,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 197 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 20:22:43,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 20:22:43,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2024-10-11 20:22:43,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 46 states have internal predecessors, (53), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2024-10-11 20:22:43,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2024-10-11 20:22:43,119 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 41 [2024-10-11 20:22:43,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:43,119 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2024-10-11 20:22:43,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 9 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-10-11 20:22:43,120 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2024-10-11 20:22:43,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 20:22:43,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:43,121 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:43,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:22:43,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:43,325 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:43,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:43,325 INFO L85 PathProgramCache]: Analyzing trace with hash 104356812, now seen corresponding path program 1 times [2024-10-11 20:22:43,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:43,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546040616] [2024-10-11 20:22:43,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:43,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:43,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 20:22:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:43,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:22:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:43,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 20:22:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:43,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:22:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:43,579 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 20:22:43,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:43,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546040616] [2024-10-11 20:22:43,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546040616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:43,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:22:43,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:22:43,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006277796] [2024-10-11 20:22:43,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:43,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:22:43,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:43,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:22:43,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:22:43,584 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:22:43,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:43,682 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2024-10-11 20:22:43,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:22:43,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2024-10-11 20:22:43,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:43,683 INFO L225 Difference]: With dead ends: 61 [2024-10-11 20:22:43,683 INFO L226 Difference]: Without dead ends: 59 [2024-10-11 20:22:43,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:22:43,684 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 74 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-10-11 20:22:43,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 74 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:22:43,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-11 20:22:43,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-11 20:22:43,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 49 states have internal predecessors, (56), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2024-10-11 20:22:43,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2024-10-11 20:22:43,690 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 47 [2024-10-11 20:22:43,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:43,691 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2024-10-11 20:22:43,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:22:43,691 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2024-10-11 20:22:43,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 20:22:43,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:43,692 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:43,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:22:43,692 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:43,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:43,692 INFO L85 PathProgramCache]: Analyzing trace with hash -662439787, now seen corresponding path program 1 times [2024-10-11 20:22:43,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:43,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295163254] [2024-10-11 20:22:43,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:43,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:43,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 20:22:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:43,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:22:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:43,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 20:22:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:43,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:22:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 20:22:43,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:43,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295163254] [2024-10-11 20:22:43,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295163254] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:22:43,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113106719] [2024-10-11 20:22:43,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:43,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:43,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:43,908 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:22:43,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:22:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:44,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:22:44,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:22:44,146 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 20:22:44,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:22:44,222 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 20:22:44,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113106719] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:22:44,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:22:44,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 16 [2024-10-11 20:22:44,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680347370] [2024-10-11 20:22:44,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:22:44,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 20:22:44,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:44,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 20:22:44,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:22:44,224 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 16 states, 16 states have (on average 2.9375) internal successors, (47), 15 states have internal predecessors, (47), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:22:44,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:44,332 INFO L93 Difference]: Finished difference Result 100 states and 129 transitions. [2024-10-11 20:22:44,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 20:22:44,333 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 15 states have internal predecessors, (47), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 50 [2024-10-11 20:22:44,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:44,334 INFO L225 Difference]: With dead ends: 100 [2024-10-11 20:22:44,334 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 20:22:44,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:22:44,335 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:44,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 131 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:22:44,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 20:22:44,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-11 20:22:44,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.1111111111111112) internal successors, (80), 73 states have internal predecessors, (80), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (19), 13 states have call predecessors, (19), 12 states have call successors, (19) [2024-10-11 20:22:44,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 111 transitions. [2024-10-11 20:22:44,344 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 111 transitions. Word has length 50 [2024-10-11 20:22:44,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:44,344 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 111 transitions. [2024-10-11 20:22:44,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 15 states have internal predecessors, (47), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:22:44,345 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2024-10-11 20:22:44,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 20:22:44,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:44,346 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:44,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:22:44,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 20:22:44,547 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:44,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:44,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1705461417, now seen corresponding path program 2 times [2024-10-11 20:22:44,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:44,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436953875] [2024-10-11 20:22:44,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:44,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:44,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 20:22:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:44,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:22:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:44,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 20:22:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:44,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:22:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:44,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:22:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:44,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 20:22:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:44,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:22:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:44,817 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-10-11 20:22:44,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:44,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436953875] [2024-10-11 20:22:44,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436953875] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:22:44,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246036388] [2024-10-11 20:22:44,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:22:44,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:44,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:44,819 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:22:44,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:22:45,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:22:45,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:22:45,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:22:45,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:22:45,329 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-10-11 20:22:45,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:22:45,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246036388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:45,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:22:45,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-11 20:22:45,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862028001] [2024-10-11 20:22:45,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:45,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:22:45,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:45,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:22:45,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:22:45,331 INFO L87 Difference]: Start difference. First operand 89 states and 111 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:22:45,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:45,371 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2024-10-11 20:22:45,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:22:45,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 80 [2024-10-11 20:22:45,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:45,373 INFO L225 Difference]: With dead ends: 89 [2024-10-11 20:22:45,373 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 20:22:45,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:22:45,374 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:45,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 80 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:22:45,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 20:22:45,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-11 20:22:45,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 72 states have internal predecessors, (79), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (19), 13 states have call predecessors, (19), 12 states have call successors, (19) [2024-10-11 20:22:45,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 110 transitions. [2024-10-11 20:22:45,386 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 110 transitions. Word has length 80 [2024-10-11 20:22:45,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:45,387 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 110 transitions. [2024-10-11 20:22:45,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:22:45,387 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 110 transitions. [2024-10-11 20:22:45,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 20:22:45,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:45,390 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:45,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 20:22:45,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:45,594 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:45,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:45,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1329696279, now seen corresponding path program 1 times [2024-10-11 20:22:45,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:45,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566783180] [2024-10-11 20:22:45,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:45,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:45,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 20:22:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:45,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:22:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:45,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 20:22:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:45,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:22:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:45,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:22:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:45,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 20:22:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:45,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:22:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-10-11 20:22:45,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:45,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566783180] [2024-10-11 20:22:45,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566783180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:45,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:22:45,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:22:45,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774420179] [2024-10-11 20:22:45,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:45,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:22:45,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:45,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:22:45,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:22:45,790 INFO L87 Difference]: Start difference. First operand 88 states and 110 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:22:45,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:45,833 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2024-10-11 20:22:45,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:22:45,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2024-10-11 20:22:45,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:45,834 INFO L225 Difference]: With dead ends: 88 [2024-10-11 20:22:45,834 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:22:45,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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-10-11 20:22:45,835 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:45,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:22:45,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:22:45,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:22:45,835 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-10-11 20:22:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:22:45,835 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2024-10-11 20:22:45,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:45,836 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:22:45,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:22:45,836 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:22:45,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:22:45,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-11 20:22:45,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-11 20:22:45,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-11 20:22:45,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-11 20:22:45,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 20:22:45,841 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:45,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:22:45,970 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:22:45,981 WARN L155 FloydHoareUtils]: Requires clause for append contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-10-11 20:22:45,985 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-11 20:22:45,985 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-11 20:22:45,985 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[#in~head!base,]]] [2024-10-11 20:22:45,985 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-11 20:22:45,986 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL]] [2024-10-11 20:22:45,986 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL]],[IdentifierExpression[#in~head!base,]]] [2024-10-11 20:22:45,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:22:45 BoogieIcfgContainer [2024-10-11 20:22:45,986 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:22:45,987 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:22:45,987 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:22:45,987 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:22:45,987 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:22:38" (3/4) ... [2024-10-11 20:22:45,988 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:22:45,991 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure append [2024-10-11 20:22:45,993 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-11 20:22:45,994 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 20:22:45,994 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 20:22:45,994 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:22:46,069 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:22:46,070 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:22:46,070 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:22:46,071 INFO L158 Benchmark]: Toolchain (without parser) took 8450.78ms. Allocated memory was 146.8MB in the beginning and 299.9MB in the end (delta: 153.1MB). Free memory was 92.7MB in the beginning and 149.1MB in the end (delta: -56.4MB). Peak memory consumption was 98.5MB. Max. memory is 16.1GB. [2024-10-11 20:22:46,071 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 146.8MB. Free memory is still 106.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:22:46,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.29ms. Allocated memory is still 146.8MB. Free memory was 92.7MB in the beginning and 73.6MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 20:22:46,071 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.97ms. Allocated memory is still 146.8MB. Free memory was 73.3MB in the beginning and 71.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:22:46,071 INFO L158 Benchmark]: Boogie Preprocessor took 65.40ms. Allocated memory is still 146.8MB. Free memory was 71.5MB in the beginning and 68.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:22:46,072 INFO L158 Benchmark]: RCFGBuilder took 447.39ms. Allocated memory was 146.8MB in the beginning and 241.2MB in the end (delta: 94.4MB). Free memory was 68.7MB in the beginning and 199.8MB in the end (delta: -131.1MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2024-10-11 20:22:46,072 INFO L158 Benchmark]: TraceAbstraction took 7443.74ms. Allocated memory was 241.2MB in the beginning and 299.9MB in the end (delta: 58.7MB). Free memory was 198.7MB in the beginning and 154.4MB in the end (delta: 44.4MB). Peak memory consumption was 103.1MB. Max. memory is 16.1GB. [2024-10-11 20:22:46,072 INFO L158 Benchmark]: Witness Printer took 83.68ms. Allocated memory is still 299.9MB. Free memory was 154.4MB in the beginning and 149.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:22:46,073 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.10ms. Allocated memory is still 146.8MB. Free memory is still 106.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.29ms. Allocated memory is still 146.8MB. Free memory was 92.7MB in the beginning and 73.6MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.97ms. Allocated memory is still 146.8MB. Free memory was 73.3MB in the beginning and 71.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 65.40ms. Allocated memory is still 146.8MB. Free memory was 71.5MB in the beginning and 68.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 447.39ms. Allocated memory was 146.8MB in the beginning and 241.2MB in the end (delta: 94.4MB). Free memory was 68.7MB in the beginning and 199.8MB in the end (delta: -131.1MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7443.74ms. Allocated memory was 241.2MB in the beginning and 299.9MB in the end (delta: 58.7MB). Free memory was 198.7MB in the beginning and 154.4MB in the end (delta: 44.4MB). Peak memory consumption was 103.1MB. Max. memory is 16.1GB. * Witness Printer took 83.68ms. Allocated memory is still 299.9MB. Free memory was 154.4MB in the beginning and 149.1MB 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_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[#in~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL]],[IdentifierExpression[#in~head!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: 578]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 578]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 591]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 591]: 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 2 procedures, 28 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 911 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 687 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 698 IncrementalHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 224 mSDtfsCounter, 698 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 469 GetRequests, 382 SyntacticMatches, 3 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=8, InterpolantAutomatonStates: 79, 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, 10 MinimizatonAttempts, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 630 NumberOfCodeBlocks, 630 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 730 ConstructedInterpolants, 0 QuantifiedInterpolants, 2030 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2784 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 18 InterpolantComputations, 7 PerfectInterpolantSequences, 854/959 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: 573]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 584]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 578]: Loop Invariant Derived loop invariant: ((c <= 2147483645) && (0 <= (c + 2147483648))) - InvariantResult [Line: 591]: Loop Invariant Derived loop invariant: (0 < (2147483649 + c)) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:22:46,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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