./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_compareModified_ground.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/array-examples/standard_compareModified_ground.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 ec4d4b5cea975144b4de3d9f9eb9b04d1c4b7aa6b7464f360f53530c4a9bd50e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:06:04,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:06:04,138 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:06:04,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:06:04,146 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:06:04,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:06:04,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:06:04,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:06:04,180 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:06:04,181 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:06:04,182 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:06:04,182 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:06:04,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:06:04,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:06:04,185 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:06:04,185 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:06:04,186 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:06:04,186 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:06:04,186 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:06:04,186 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:06:04,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:06:04,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:06:04,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:06:04,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:06:04,191 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:06:04,191 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:06:04,191 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:06:04,191 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:06:04,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:06:04,192 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:06:04,192 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:06:04,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:06:04,193 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:06:04,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:06:04,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:06:04,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:06:04,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:06:04,194 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:06:04,194 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:06:04,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:06:04,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:06:04,196 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:06:04,197 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:06:04,197 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:06:04,197 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 -> ec4d4b5cea975144b4de3d9f9eb9b04d1c4b7aa6b7464f360f53530c4a9bd50e [2024-10-11 20:06:04,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:06:04,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:06:04,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:06:04,475 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:06:04,475 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:06:04,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_compareModified_ground.i [2024-10-11 20:06:05,908 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:06:06,111 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:06:06,112 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_compareModified_ground.i [2024-10-11 20:06:06,119 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e6bb1f44f/1955abff797d4618ae428a30333b3bb8/FLAG98c0dfef4 [2024-10-11 20:06:06,131 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e6bb1f44f/1955abff797d4618ae428a30333b3bb8 [2024-10-11 20:06:06,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:06:06,135 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:06:06,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:06:06,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:06:06,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:06:06,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:06:06" (1/1) ... [2024-10-11 20:06:06,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2650ffd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:06, skipping insertion in model container [2024-10-11 20:06:06,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:06:06" (1/1) ... [2024-10-11 20:06:06,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:06:06,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:06:06,370 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:06:06,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:06:06,413 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:06:06,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:06 WrapperNode [2024-10-11 20:06:06,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:06:06,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:06:06,415 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:06:06,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:06:06,423 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:06:06" (1/1) ... [2024-10-11 20:06:06,433 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:06:06" (1/1) ... [2024-10-11 20:06:06,459 INFO L138 Inliner]: procedures = 16, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 103 [2024-10-11 20:06:06,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:06:06,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:06:06,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:06:06,461 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:06:06,471 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:06" (1/1) ... [2024-10-11 20:06:06,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:06" (1/1) ... [2024-10-11 20:06:06,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:06" (1/1) ... [2024-10-11 20:06:06,494 INFO L175 MemorySlicer]: Split 12 memory accesses to 4 slices as follows [2, 2, 3, 5]. 42 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-10-11 20:06:06,494 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:06" (1/1) ... [2024-10-11 20:06:06,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:06" (1/1) ... [2024-10-11 20:06:06,502 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:06" (1/1) ... [2024-10-11 20:06:06,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:06" (1/1) ... [2024-10-11 20:06:06,506 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:06" (1/1) ... [2024-10-11 20:06:06,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:06" (1/1) ... [2024-10-11 20:06:06,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:06:06,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:06:06,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:06:06,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:06:06,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:06" (1/1) ... [2024-10-11 20:06:06,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:06:06,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:06:06,543 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:06:06,547 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:06:06,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:06:06,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:06:06,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 20:06:06,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 20:06:06,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 20:06:06,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 20:06:06,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 20:06:06,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 20:06:06,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 20:06:06,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 20:06:06,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:06:06,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:06:06,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 20:06:06,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 20:06:06,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 20:06:06,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 20:06:06,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:06:06,589 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:06:06,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 20:06:06,663 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:06:06,665 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:06:06,867 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-11 20:06:06,867 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:06:06,909 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:06:06,909 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 20:06:06,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:06:06 BoogieIcfgContainer [2024-10-11 20:06:06,910 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:06:06,913 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:06:06,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:06:06,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:06:06,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:06:06" (1/3) ... [2024-10-11 20:06:06,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3900bcff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:06:06, skipping insertion in model container [2024-10-11 20:06:06,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:06" (2/3) ... [2024-10-11 20:06:06,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3900bcff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:06:06, skipping insertion in model container [2024-10-11 20:06:06,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:06:06" (3/3) ... [2024-10-11 20:06:06,925 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_compareModified_ground.i [2024-10-11 20:06:06,943 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:06:06,944 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-11 20:06:07,014 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:06:07,020 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;@401df96d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:06:07,021 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 20:06:07,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 35 states have internal predecessors, (47), 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:06:07,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 20:06:07,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:06:07,038 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 20:06:07,039 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:06:07,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:06:07,044 INFO L85 PathProgramCache]: Analyzing trace with hash 145806, now seen corresponding path program 1 times [2024-10-11 20:06:07,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:06:07,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198729920] [2024-10-11 20:06:07,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:06:07,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:06:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:07,378 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:06:07,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:06:07,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198729920] [2024-10-11 20:06:07,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198729920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:06:07,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:06:07,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:06:07,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295886943] [2024-10-11 20:06:07,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:06:07,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:06:07,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:06:07,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:06:07,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:06:07,417 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 35 states have internal predecessors, (47), 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 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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:06:07,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:06:07,482 INFO L93 Difference]: Finished difference Result 76 states and 102 transitions. [2024-10-11 20:06:07,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:06:07,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-10-11 20:06:07,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:06:07,490 INFO L225 Difference]: With dead ends: 76 [2024-10-11 20:06:07,490 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 20:06:07,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:06:07,499 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:06:07,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 104 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:06:07,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 20:06:07,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-11 20:06:07,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 34 states have internal predecessors, (40), 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:06:07,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-10-11 20:06:07,533 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 3 [2024-10-11 20:06:07,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:06:07,533 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-10-11 20:06:07,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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:06:07,534 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-10-11 20:06:07,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:06:07,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:06:07,534 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2024-10-11 20:06:07,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:06:07,535 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:06:07,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:06:07,535 INFO L85 PathProgramCache]: Analyzing trace with hash 48787995, now seen corresponding path program 1 times [2024-10-11 20:06:07,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:06:07,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125474798] [2024-10-11 20:06:07,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:06:07,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:06:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:07,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:06:07,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:06:07,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125474798] [2024-10-11 20:06:07,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125474798] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:06:07,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965837546] [2024-10-11 20:06:07,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:06:07,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:06:07,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:06:07,731 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:06:07,732 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:06:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:07,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:06:07,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:06:07,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:06:07,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:06:07,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965837546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:06:07,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:06:07,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-11 20:06:07,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862867720] [2024-10-11 20:06:07,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:06:07,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:06:07,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:06:07,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:06:07,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:06:07,876 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:06:07,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:06:07,930 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2024-10-11 20:06:07,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:06:07,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 6 [2024-10-11 20:06:07,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:06:07,933 INFO L225 Difference]: With dead ends: 38 [2024-10-11 20:06:07,933 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 20:06:07,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:06:07,934 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:06:07,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 126 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:06:07,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 20:06:07,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-11 20:06:07,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 33 states have internal predecessors, (39), 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:06:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-10-11 20:06:07,945 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 6 [2024-10-11 20:06:07,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:06:07,945 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-10-11 20:06:07,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:06:07,945 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-10-11 20:06:07,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 20:06:07,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:06:07,946 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2024-10-11 20:06:07,960 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:06:08,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:06:08,147 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:06:08,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:06:08,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1512427891, now seen corresponding path program 1 times [2024-10-11 20:06:08,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:06:08,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229581641] [2024-10-11 20:06:08,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:06:08,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:06:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:08,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:06:08,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:06:08,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229581641] [2024-10-11 20:06:08,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229581641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:06:08,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:06:08,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:06:08,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113694944] [2024-10-11 20:06:08,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:06:08,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:06:08,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:06:08,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:06:08,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:06:08,240 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:06:08,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:06:08,264 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-10-11 20:06:08,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:06:08,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 20:06:08,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:06:08,267 INFO L225 Difference]: With dead ends: 37 [2024-10-11 20:06:08,267 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 20:06:08,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:06:08,269 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:06:08,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:06:08,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 20:06:08,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-10-11 20:06:08,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.44) internal successors, (36), 30 states have internal predecessors, (36), 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:06:08,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-10-11 20:06:08,280 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 7 [2024-10-11 20:06:08,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:06:08,281 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-10-11 20:06:08,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:06:08,281 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-10-11 20:06:08,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 20:06:08,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:06:08,282 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:06:08,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:06:08,283 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:06:08,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:06:08,284 INFO L85 PathProgramCache]: Analyzing trace with hash -524963311, now seen corresponding path program 1 times [2024-10-11 20:06:08,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:06:08,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845863029] [2024-10-11 20:06:08,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:06:08,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:06:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:06:08,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:06:08,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845863029] [2024-10-11 20:06:08,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845863029] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:06:08,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106507132] [2024-10-11 20:06:08,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:06:08,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:06:08,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:06:08,386 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:06:08,390 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:06:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:08,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 20:06:08,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:06:08,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:06:08,483 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:06:08,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106507132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:06:08,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:06:08,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2024-10-11 20:06:08,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905831238] [2024-10-11 20:06:08,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:06:08,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:06:08,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:06:08,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:06:08,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:06:08,488 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:06:08,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:06:08,524 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2024-10-11 20:06:08,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:06:08,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2024-10-11 20:06:08,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:06:08,525 INFO L225 Difference]: With dead ends: 34 [2024-10-11 20:06:08,526 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 20:06:08,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:06:08,527 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:06:08,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 50 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:06:08,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 20:06:08,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-11 20:06:08,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.4) internal successors, (35), 29 states have internal predecessors, (35), 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:06:08,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-10-11 20:06:08,538 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 10 [2024-10-11 20:06:08,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:06:08,538 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-10-11 20:06:08,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:06:08,539 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-10-11 20:06:08,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 20:06:08,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:06:08,540 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:06:08,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 20:06:08,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:06:08,741 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:06:08,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:06:08,742 INFO L85 PathProgramCache]: Analyzing trace with hash 906006613, now seen corresponding path program 1 times [2024-10-11 20:06:08,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:06:08,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961578256] [2024-10-11 20:06:08,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:06:08,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:06:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:08,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:06:08,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:06:08,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961578256] [2024-10-11 20:06:08,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961578256] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:06:08,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089613811] [2024-10-11 20:06:08,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:06:08,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:06:08,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:06:08,802 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:06:08,804 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:06:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:08,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 20:06:08,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:06:08,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:06:08,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:06:08,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089613811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:06:08,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:06:08,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2024-10-11 20:06:08,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141438440] [2024-10-11 20:06:08,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:06:08,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:06:08,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:06:08,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:06:08,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:06:08,901 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:06:08,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:06:08,941 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2024-10-11 20:06:08,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:06:08,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 20:06:08,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:06:08,942 INFO L225 Difference]: With dead ends: 60 [2024-10-11 20:06:08,943 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 20:06:08,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:06:08,944 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:06:08,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:06:08,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 20:06:08,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-11 20:06:08,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 34 states have internal predecessors, (41), 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:06:08,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-10-11 20:06:08,953 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 11 [2024-10-11 20:06:08,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:06:08,954 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-10-11 20:06:08,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:06:08,954 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-10-11 20:06:08,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 20:06:08,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:06:08,955 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:06:08,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 20:06:09,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:06:09,160 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:06:09,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:06:09,160 INFO L85 PathProgramCache]: Analyzing trace with hash -666765620, now seen corresponding path program 1 times [2024-10-11 20:06:09,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:06:09,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677605947] [2024-10-11 20:06:09,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:06:09,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:06:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:09,279 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:06:09,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:06:09,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677605947] [2024-10-11 20:06:09,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677605947] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:06:09,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010342159] [2024-10-11 20:06:09,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:06:09,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:06:09,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:06:09,285 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:06:09,287 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:06:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:09,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 20:06:09,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:06:09,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 20:06:09,386 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:06:09,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010342159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:06:09,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:06:09,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2024-10-11 20:06:09,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152350668] [2024-10-11 20:06:09,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:06:09,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:06:09,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:06:09,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:06:09,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:06:09,389 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:06:09,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:06:09,414 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-10-11 20:06:09,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:06:09,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 20:06:09,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:06:09,415 INFO L225 Difference]: With dead ends: 38 [2024-10-11 20:06:09,415 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 20:06:09,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:06:09,416 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:06:09,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 51 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:06:09,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 20:06:09,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2024-10-11 20:06:09,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 states have internal predecessors, (35), 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:06:09,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-10-11 20:06:09,427 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 16 [2024-10-11 20:06:09,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:06:09,427 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-10-11 20:06:09,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:06:09,427 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-10-11 20:06:09,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 20:06:09,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:06:09,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:06:09,455 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:06:09,629 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,SelfDestructingSolverStorable5 [2024-10-11 20:06:09,629 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:06:09,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:06:09,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1573071028, now seen corresponding path program 1 times [2024-10-11 20:06:09,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:06:09,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275235600] [2024-10-11 20:06:09,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:06:09,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:06:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:09,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 20:06:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:09,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:06:09,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:06:09,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275235600] [2024-10-11 20:06:09,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275235600] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:06:09,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869361233] [2024-10-11 20:06:09,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:06:09,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:06:09,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:06:09,714 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:06:09,716 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:06:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:09,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:06:09,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:06:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:06:09,813 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:06:09,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869361233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:06:09,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:06:09,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-11 20:06:09,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012691886] [2024-10-11 20:06:09,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:06:09,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:06:09,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:06:09,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:06:09,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:06:09,817 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:06:09,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:06:09,834 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2024-10-11 20:06:09,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:06:09,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 22 [2024-10-11 20:06:09,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:06:09,835 INFO L225 Difference]: With dead ends: 59 [2024-10-11 20:06:09,835 INFO L226 Difference]: Without dead ends: 40 [2024-10-11 20:06:09,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:06:09,838 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:06:09,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 65 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:06:09,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-11 20:06:09,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-11 20:06:09,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 36 states have internal predecessors, (44), 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:06:09,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-10-11 20:06:09,843 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 22 [2024-10-11 20:06:09,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:06:09,843 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-10-11 20:06:09,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:06:09,844 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-10-11 20:06:09,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 20:06:09,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:06:09,845 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:06:09,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:06:10,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:06:10,046 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:06:10,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:06:10,046 INFO L85 PathProgramCache]: Analyzing trace with hash 293207350, now seen corresponding path program 1 times [2024-10-11 20:06:10,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:06:10,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922967721] [2024-10-11 20:06:10,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:06:10,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:06:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:10,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 20:06:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:10,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:06:10,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:06:10,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922967721] [2024-10-11 20:06:10,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922967721] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:06:10,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828017118] [2024-10-11 20:06:10,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:06:10,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:06:10,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:06:10,126 INFO L229 MonitoredProcess]: Starting monitored process 7 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:06:10,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:06:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:10,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:06:10,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:06:10,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:06:10,229 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:06:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:06:10,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828017118] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:06:10,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:06:10,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2024-10-11 20:06:10,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683193093] [2024-10-11 20:06:10,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:06:10,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 20:06:10,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:06:10,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 20:06:10,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:06:10,279 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:06:10,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:06:10,320 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2024-10-11 20:06:10,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:06:10,320 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-10-11 20:06:10,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:06:10,321 INFO L225 Difference]: With dead ends: 81 [2024-10-11 20:06:10,321 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 20:06:10,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:06:10,322 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:06:10,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:06:10,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 20:06:10,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-11 20:06:10,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 42 states have internal predecessors, (50), 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:06:10,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-10-11 20:06:10,327 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 22 [2024-10-11 20:06:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:06:10,328 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-10-11 20:06:10,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:06:10,328 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2024-10-11 20:06:10,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 20:06:10,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:06:10,329 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:06:10,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 20:06:10,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 20:06:10,530 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:06:10,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:06:10,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1293514838, now seen corresponding path program 2 times [2024-10-11 20:06:10,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:06:10,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104509922] [2024-10-11 20:06:10,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:06:10,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:06:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:10,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 20:06:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:10,587 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:06:10,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:06:10,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104509922] [2024-10-11 20:06:10,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104509922] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:06:10,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570368412] [2024-10-11 20:06:10,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:06:10,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:06:10,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:06:10,591 INFO L229 MonitoredProcess]: Starting monitored process 8 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:06:10,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:06:10,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:06:10,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:06:10,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:06:10,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:06:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 20:06:10,697 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:06:10,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570368412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:06:10,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:06:10,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-11 20:06:10,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110270062] [2024-10-11 20:06:10,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:06:10,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:06:10,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:06:10,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:06:10,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:06:10,699 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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:06:10,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:06:10,735 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2024-10-11 20:06:10,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:06:10,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 28 [2024-10-11 20:06:10,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:06:10,736 INFO L225 Difference]: With dead ends: 49 [2024-10-11 20:06:10,736 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 20:06:10,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:06:10,737 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:06:10,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 73 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:06:10,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 20:06:10,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2024-10-11 20:06:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 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:06:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2024-10-11 20:06:10,747 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 28 [2024-10-11 20:06:10,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:06:10,747 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2024-10-11 20:06:10,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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:06:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2024-10-11 20:06:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 20:06:10,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:06:10,751 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:06:10,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:06:10,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:06:10,953 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:06:10,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:06:10,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1106690854, now seen corresponding path program 1 times [2024-10-11 20:06:10,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:06:10,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770383131] [2024-10-11 20:06:10,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:06:10,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:06:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:11,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 20:06:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:06:11,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:06:11,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770383131] [2024-10-11 20:06:11,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770383131] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:06:11,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426457518] [2024-10-11 20:06:11,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:06:11,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:06:11,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:06:11,029 INFO L229 MonitoredProcess]: Starting monitored process 9 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:06:11,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:06:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:11,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:06:11,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:06:11,172 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:06:11,172 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:06:11,273 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:06:11,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426457518] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:06:11,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:06:11,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 9] total 18 [2024-10-11 20:06:11,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124641021] [2024-10-11 20:06:11,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:06:11,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 20:06:11,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:06:11,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 20:06:11,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-10-11 20:06:11,276 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:06:11,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:06:11,499 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2024-10-11 20:06:11,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 20:06:11,500 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-10-11 20:06:11,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:06:11,501 INFO L225 Difference]: With dead ends: 108 [2024-10-11 20:06:11,501 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 20:06:11,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=712, Unknown=0, NotChecked=0, Total=930 [2024-10-11 20:06:11,503 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:06:11,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 199 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:06:11,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 20:06:11,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2024-10-11 20:06:11,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 62 states have internal predecessors, (71), 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:06:11,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2024-10-11 20:06:11,516 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 29 [2024-10-11 20:06:11,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:06:11,519 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2024-10-11 20:06:11,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:06:11,519 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2024-10-11 20:06:11,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 20:06:11,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:06:11,520 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:06:11,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 20:06:11,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 20:06:11,722 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:06:11,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:06:11,722 INFO L85 PathProgramCache]: Analyzing trace with hash 861610321, now seen corresponding path program 2 times [2024-10-11 20:06:11,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:06:11,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658439368] [2024-10-11 20:06:11,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:06:11,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:06:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:11,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:06:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:11,802 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-11 20:06:11,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:06:11,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658439368] [2024-10-11 20:06:11,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658439368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:06:11,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:06:11,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:06:11,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501572911] [2024-10-11 20:06:11,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:06:11,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:06:11,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:06:11,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:06:11,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:06:11,804 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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:06:11,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:06:11,838 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2024-10-11 20:06:11,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:06:11,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 46 [2024-10-11 20:06:11,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:06:11,839 INFO L225 Difference]: With dead ends: 86 [2024-10-11 20:06:11,839 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 20:06:11,840 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:06:11,840 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:06:11,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 77 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:06:11,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 20:06:11,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2024-10-11 20:06:11,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 67 states have internal predecessors, (76), 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:06:11,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2024-10-11 20:06:11,846 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 46 [2024-10-11 20:06:11,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:06:11,847 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2024-10-11 20:06:11,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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:06:11,847 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2024-10-11 20:06:11,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 20:06:11,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:06:11,848 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:06:11,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 20:06:11,848 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:06:11,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:06:11,849 INFO L85 PathProgramCache]: Analyzing trace with hash -459709888, now seen corresponding path program 1 times [2024-10-11 20:06:11,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:06:11,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921645313] [2024-10-11 20:06:11,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:06:11,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:06:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:11,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 20:06:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:11,926 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-11 20:06:11,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:06:11,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921645313] [2024-10-11 20:06:11,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921645313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:06:11,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:06:11,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:06:11,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606130418] [2024-10-11 20:06:11,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:06:11,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:06:11,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:06:11,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:06:11,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:06:11,928 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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:06:11,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:06:11,961 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2024-10-11 20:06:11,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:06:11,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 46 [2024-10-11 20:06:11,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:06:11,963 INFO L225 Difference]: With dead ends: 77 [2024-10-11 20:06:11,963 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 20:06:11,963 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:06:11,963 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:06:11,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 78 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:06:11,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 20:06:11,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-11 20:06:11,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 68 states have (on average 1.161764705882353) internal successors, (79), 70 states have internal predecessors, (79), 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:06:11,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2024-10-11 20:06:11,975 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 46 [2024-10-11 20:06:11,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:06:11,976 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2024-10-11 20:06:11,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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:06:11,977 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2024-10-11 20:06:11,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 20:06:11,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:06:11,980 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:06:11,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 20:06:11,981 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:06:11,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:06:11,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1880717003, now seen corresponding path program 1 times [2024-10-11 20:06:11,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:06:11,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939152690] [2024-10-11 20:06:11,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:06:11,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:06:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:12,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:06:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:12,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 20:06:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:12,102 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-11 20:06:12,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:06:12,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939152690] [2024-10-11 20:06:12,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939152690] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:06:12,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813186721] [2024-10-11 20:06:12,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:06:12,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:06:12,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:06:12,115 INFO L229 MonitoredProcess]: Starting monitored process 10 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:06:12,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 20:06:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:12,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 20:06:12,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:06:12,406 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:06:12,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:06:12,729 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:06:12,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813186721] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:06:12,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:06:12,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 16, 17] total 35 [2024-10-11 20:06:12,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88594933] [2024-10-11 20:06:12,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:06:12,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-11 20:06:12,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:06:12,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-11 20:06:12,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=909, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 20:06:12,733 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 35 states, 35 states have (on average 2.4) internal successors, (84), 35 states have internal predecessors, (84), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:06:13,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:06:13,283 INFO L93 Difference]: Finished difference Result 171 states and 206 transitions. [2024-10-11 20:06:13,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-11 20:06:13,283 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.4) internal successors, (84), 35 states have internal predecessors, (84), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2024-10-11 20:06:13,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:06:13,284 INFO L225 Difference]: With dead ends: 171 [2024-10-11 20:06:13,284 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 20:06:13,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=855, Invalid=3177, Unknown=0, NotChecked=0, Total=4032 [2024-10-11 20:06:13,287 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:06:13,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 179 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:06:13,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 20:06:13,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2024-10-11 20:06:13,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 102 states have (on average 1.1274509803921569) internal successors, (115), 104 states have internal predecessors, (115), 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:06:13,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2024-10-11 20:06:13,295 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 55 [2024-10-11 20:06:13,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:06:13,295 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2024-10-11 20:06:13,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.4) internal successors, (84), 35 states have internal predecessors, (84), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:06:13,295 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2024-10-11 20:06:13,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 20:06:13,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:06:13,297 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:06:13,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 20:06:13,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:06:13,498 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:06:13,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:06:13,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1807743956, now seen corresponding path program 2 times [2024-10-11 20:06:13,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:06:13,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710546791] [2024-10-11 20:06:13,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:06:13,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:06:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:13,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 20:06:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:13,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 20:06:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:13,664 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-10-11 20:06:13,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:06:13,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710546791] [2024-10-11 20:06:13,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710546791] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:06:13,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440486793] [2024-10-11 20:06:13,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:06:13,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:06:13,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:06:13,666 INFO L229 MonitoredProcess]: Starting monitored process 11 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:06:13,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 20:06:13,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:06:13,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:06:13,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 20:06:13,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:06:14,352 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 20:06:14,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:06:15,294 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 20:06:15,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440486793] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:06:15,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:06:15,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 32, 33] total 68 [2024-10-11 20:06:15,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609400948] [2024-10-11 20:06:15,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:06:15,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-10-11 20:06:15,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:06:15,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-10-11 20:06:15,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1070, Invalid=3486, Unknown=0, NotChecked=0, Total=4556 [2024-10-11 20:06:15,300 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand has 68 states, 68 states have (on average 2.014705882352941) internal successors, (137), 68 states have internal predecessors, (137), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:06:16,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:06:16,870 INFO L93 Difference]: Finished difference Result 239 states and 286 transitions. [2024-10-11 20:06:16,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-10-11 20:06:16,871 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.014705882352941) internal successors, (137), 68 states have internal predecessors, (137), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 84 [2024-10-11 20:06:16,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:06:16,872 INFO L225 Difference]: With dead ends: 239 [2024-10-11 20:06:16,872 INFO L226 Difference]: Without dead ends: 176 [2024-10-11 20:06:16,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4205 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3313, Invalid=13199, Unknown=0, NotChecked=0, Total=16512 [2024-10-11 20:06:16,877 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 11 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:06:16,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 228 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:06:16,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-11 20:06:16,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 168. [2024-10-11 20:06:16,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 160 states have (on average 1.09375) internal successors, (175), 162 states have internal predecessors, (175), 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:06:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 183 transitions. [2024-10-11 20:06:16,889 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 183 transitions. Word has length 84 [2024-10-11 20:06:16,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:06:16,889 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 183 transitions. [2024-10-11 20:06:16,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 2.014705882352941) internal successors, (137), 68 states have internal predecessors, (137), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:06:16,890 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 183 transitions. [2024-10-11 20:06:16,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 20:06:16,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:06:16,891 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:06:16,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 20:06:17,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 20:06:17,096 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:06:17,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:06:17,096 INFO L85 PathProgramCache]: Analyzing trace with hash 715486741, now seen corresponding path program 3 times [2024-10-11 20:06:17,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:06:17,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605834517] [2024-10-11 20:06:17,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:06:17,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:06:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:17,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 20:06:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:17,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 20:06:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:17,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1434 trivial. 0 not checked. [2024-10-11 20:06:17,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:06:17,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605834517] [2024-10-11 20:06:17,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605834517] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:06:17,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189103307] [2024-10-11 20:06:17,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:06:17,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:06:17,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:06:17,422 INFO L229 MonitoredProcess]: Starting monitored process 12 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:06:17,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 20:06:17,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 20:06:17,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:06:17,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:06:17,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:06:17,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1464 trivial. 0 not checked. [2024-10-11 20:06:17,613 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:06:17,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189103307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:06:17,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:06:17,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-10-11 20:06:17,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613006521] [2024-10-11 20:06:17,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:06:17,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:06:17,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:06:17,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:06:17,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:06:17,614 INFO L87 Difference]: Start difference. First operand 168 states and 183 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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:06:17,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:06:17,659 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2024-10-11 20:06:17,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:06:17,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 137 [2024-10-11 20:06:17,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:06:17,661 INFO L225 Difference]: With dead ends: 168 [2024-10-11 20:06:17,661 INFO L226 Difference]: Without dead ends: 167 [2024-10-11 20:06:17,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:06:17,661 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:06:17,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 98 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:06:17,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-11 20:06:17,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-10-11 20:06:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 160 states have (on average 1.0875) internal successors, (174), 161 states have internal predecessors, (174), 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:06:17,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 182 transitions. [2024-10-11 20:06:17,670 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 182 transitions. Word has length 137 [2024-10-11 20:06:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:06:17,670 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 182 transitions. [2024-10-11 20:06:17,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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:06:17,671 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 182 transitions. [2024-10-11 20:06:17,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 20:06:17,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:06:17,672 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:06:17,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 20:06:17,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 20:06:17,872 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:06:17,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:06:17,873 INFO L85 PathProgramCache]: Analyzing trace with hash -2104154896, now seen corresponding path program 1 times [2024-10-11 20:06:17,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:06:17,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984242663] [2024-10-11 20:06:17,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:06:17,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:06:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:18,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 20:06:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:18,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 20:06:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1469 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1465 trivial. 0 not checked. [2024-10-11 20:06:18,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:06:18,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984242663] [2024-10-11 20:06:18,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984242663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:06:18,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:06:18,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:06:18,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775990864] [2024-10-11 20:06:18,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:06:18,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:06:18,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:06:18,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:06:18,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:06:18,066 INFO L87 Difference]: Start difference. First operand 167 states and 182 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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:06:18,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:06:18,096 INFO L93 Difference]: Finished difference Result 167 states and 182 transitions. [2024-10-11 20:06:18,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:06:18,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 137 [2024-10-11 20:06:18,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:06:18,098 INFO L225 Difference]: With dead ends: 167 [2024-10-11 20:06:18,098 INFO L226 Difference]: Without dead ends: 166 [2024-10-11 20:06:18,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:06:18,099 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:06:18,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 71 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:06:18,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-11 20:06:18,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2024-10-11 20:06:18,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 157 states have (on average 1.0828025477707006) internal successors, (170), 157 states have internal predecessors, (170), 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:06:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 176 transitions. [2024-10-11 20:06:18,108 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 176 transitions. Word has length 137 [2024-10-11 20:06:18,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:06:18,109 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 176 transitions. [2024-10-11 20:06:18,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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:06:18,109 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 176 transitions. [2024-10-11 20:06:18,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 20:06:18,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:06:18,112 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:06:18,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 20:06:18,113 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 20:06:18,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:06:18,113 INFO L85 PathProgramCache]: Analyzing trace with hash 705252607, now seen corresponding path program 1 times [2024-10-11 20:06:18,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:06:18,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213146952] [2024-10-11 20:06:18,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:06:18,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:06:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:18,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 20:06:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:18,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 20:06:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:06:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1469 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1465 trivial. 0 not checked. [2024-10-11 20:06:18,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:06:18,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213146952] [2024-10-11 20:06:18,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213146952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:06:18,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:06:18,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:06:18,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258759447] [2024-10-11 20:06:18,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:06:18,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:06:18,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:06:18,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:06:18,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:06:18,283 INFO L87 Difference]: Start difference. First operand 162 states and 176 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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:06:18,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:06:18,308 INFO L93 Difference]: Finished difference Result 162 states and 176 transitions. [2024-10-11 20:06:18,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:06:18,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 138 [2024-10-11 20:06:18,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:06:18,309 INFO L225 Difference]: With dead ends: 162 [2024-10-11 20:06:18,309 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:06:18,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:06:18,310 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:06:18,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 68 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:06:18,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:06:18,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:06:18,311 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:06:18,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:06:18,311 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2024-10-11 20:06:18,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:06:18,311 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:06:18,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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:06:18,311 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:06:18,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:06:18,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-11 20:06:18,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-11 20:06:18,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-11 20:06:18,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-11 20:06:18,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-11 20:06:18,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-11 20:06:18,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-11 20:06:18,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-11 20:06:18,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 20:06:18,320 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:06:18,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:06:18,515 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:06:18,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:06:18 BoogieIcfgContainer [2024-10-11 20:06:18,533 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:06:18,534 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:06:18,534 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:06:18,535 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:06:18,535 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:06:06" (3/4) ... [2024-10-11 20:06:18,537 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:06:18,541 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 20:06:18,544 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-11 20:06:18,546 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 20:06:18,546 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 20:06:18,546 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:06:18,635 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:06:18,636 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:06:18,636 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:06:18,636 INFO L158 Benchmark]: Toolchain (without parser) took 12502.23ms. Allocated memory was 163.6MB in the beginning and 268.4MB in the end (delta: 104.9MB). Free memory was 109.8MB in the beginning and 205.5MB in the end (delta: -95.7MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2024-10-11 20:06:18,637 INFO L158 Benchmark]: CDTParser took 0.95ms. Allocated memory is still 163.6MB. Free memory was 123.3MB in the beginning and 123.2MB in the end (delta: 169.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:06:18,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.85ms. Allocated memory is still 163.6MB. Free memory was 109.8MB in the beginning and 97.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:06:18,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.40ms. Allocated memory is still 163.6MB. Free memory was 97.2MB in the beginning and 95.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:06:18,637 INFO L158 Benchmark]: Boogie Preprocessor took 48.26ms. Allocated memory is still 163.6MB. Free memory was 95.5MB in the beginning and 93.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:06:18,639 INFO L158 Benchmark]: RCFGBuilder took 399.74ms. Allocated memory is still 163.6MB. Free memory was 93.5MB in the beginning and 77.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 20:06:18,639 INFO L158 Benchmark]: TraceAbstraction took 11620.07ms. Allocated memory was 163.6MB in the beginning and 268.4MB in the end (delta: 104.9MB). Free memory was 76.7MB in the beginning and 210.8MB in the end (delta: -134.0MB). Peak memory consumption was 101.2MB. Max. memory is 16.1GB. [2024-10-11 20:06:18,639 INFO L158 Benchmark]: Witness Printer took 101.42ms. Allocated memory is still 268.4MB. Free memory was 210.8MB in the beginning and 205.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:06:18,641 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.95ms. Allocated memory is still 163.6MB. Free memory was 123.3MB in the beginning and 123.2MB in the end (delta: 169.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.85ms. Allocated memory is still 163.6MB. Free memory was 109.8MB in the beginning and 97.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.40ms. Allocated memory is still 163.6MB. Free memory was 97.2MB in the beginning and 95.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.26ms. Allocated memory is still 163.6MB. Free memory was 95.5MB in the beginning and 93.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 399.74ms. Allocated memory is still 163.6MB. Free memory was 93.5MB in the beginning and 77.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11620.07ms. Allocated memory was 163.6MB in the beginning and 268.4MB in the end (delta: 104.9MB). Free memory was 76.7MB in the beginning and 210.8MB in the end (delta: -134.0MB). Peak memory consumption was 101.2MB. Max. memory is 16.1GB. * Witness Printer took 101.42ms. Allocated memory is still 268.4MB. Free memory was 210.8MB in the beginning and 205.5MB 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.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: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: 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, 39 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 11.3s, OverallIterations: 17, TraceHistogramMax: 31, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 55 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 1767 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1276 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 719 IncrementalHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 491 mSDtfsCounter, 719 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 791 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5334 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=14, InterpolantAutomatonStates: 174, 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, 17 MinimizatonAttempts, 39 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1217 NumberOfCodeBlocks, 1098 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1375 ConstructedInterpolants, 0 QuantifiedInterpolants, 2385 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1667 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 32 InterpolantComputations, 13 PerfectInterpolantSequences, 6555/7449 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 8 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((i == 0) && (j == 0)) || ((i == 0) && (1 <= j))) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (0 < ((long long) x + 1)) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (0 < ((long long) i + 1)) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (0 < (2147483649 + x)) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:06:18,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE