./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e14135f4afb726bf8552a88de51bf2d1eeb5945775070b599f71e8288a74bc87 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 13:54:14,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 13:54:14,982 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-13 13:54:15,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 13:54:15,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 13:54:15,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 13:54:15,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 13:54:15,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 13:54:15,027 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 13:54:15,029 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 13:54:15,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 13:54:15,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 13:54:15,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 13:54:15,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 13:54:15,032 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 13:54:15,032 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 13:54:15,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 13:54:15,033 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 13:54:15,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 13:54:15,033 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 13:54:15,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 13:54:15,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 13:54:15,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 13:54:15,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 13:54:15,038 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 13:54:15,038 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 13:54:15,038 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 13:54:15,039 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 13:54:15,039 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 13:54:15,039 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 13:54:15,039 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 13:54:15,039 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 13:54:15,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 13:54:15,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 13:54:15,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:54:15,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 13:54:15,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 13:54:15,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 13:54:15,044 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 13:54:15,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 13:54:15,045 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 13:54:15,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 13:54:15,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 13:54:15,046 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 13:54:15,047 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e14135f4afb726bf8552a88de51bf2d1eeb5945775070b599f71e8288a74bc87 [2024-10-13 13:54:15,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 13:54:15,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 13:54:15,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 13:54:15,334 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 13:54:15,334 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 13:54:15,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound5.c [2024-10-13 13:54:16,728 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 13:54:16,889 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 13:54:16,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound5.c [2024-10-13 13:54:16,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c034fdda/025131a13a1b4f519ed6a8207cf94983/FLAG04570651e [2024-10-13 13:54:16,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c034fdda/025131a13a1b4f519ed6a8207cf94983 [2024-10-13 13:54:16,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 13:54:16,911 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 13:54:16,912 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 13:54:16,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 13:54:16,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 13:54:16,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:54:16" (1/1) ... [2024-10-13 13:54:16,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58ddf247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:16, skipping insertion in model container [2024-10-13 13:54:16,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:54:16" (1/1) ... [2024-10-13 13:54:16,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 13:54:17,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:54:17,143 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 13:54:17,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:54:17,186 INFO L204 MainTranslator]: Completed translation [2024-10-13 13:54:17,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:17 WrapperNode [2024-10-13 13:54:17,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 13:54:17,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 13:54:17,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 13:54:17,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 13:54:17,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:17" (1/1) ... [2024-10-13 13:54:17,201 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:17" (1/1) ... [2024-10-13 13:54:17,235 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 126 [2024-10-13 13:54:17,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 13:54:17,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 13:54:17,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 13:54:17,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 13:54:17,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:17" (1/1) ... [2024-10-13 13:54:17,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:17" (1/1) ... [2024-10-13 13:54:17,249 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:17" (1/1) ... [2024-10-13 13:54:17,261 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 13:54:17,261 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:17" (1/1) ... [2024-10-13 13:54:17,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:17" (1/1) ... [2024-10-13 13:54:17,265 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:17" (1/1) ... [2024-10-13 13:54:17,268 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:17" (1/1) ... [2024-10-13 13:54:17,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:17" (1/1) ... [2024-10-13 13:54:17,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:17" (1/1) ... [2024-10-13 13:54:17,276 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 13:54:17,278 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 13:54:17,278 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 13:54:17,278 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 13:54:17,279 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:17" (1/1) ... [2024-10-13 13:54:17,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:54:17,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:54:17,313 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 13:54:17,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 13:54:17,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 13:54:17,367 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 13:54:17,367 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 13:54:17,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 13:54:17,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 13:54:17,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 13:54:17,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 13:54:17,368 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 13:54:17,429 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 13:54:17,433 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 13:54:17,906 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-10-13 13:54:17,908 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 13:54:17,940 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 13:54:17,940 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 13:54:17,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:54:17 BoogieIcfgContainer [2024-10-13 13:54:17,941 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 13:54:17,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 13:54:17,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 13:54:17,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 13:54:17,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:54:16" (1/3) ... [2024-10-13 13:54:17,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d10ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:54:17, skipping insertion in model container [2024-10-13 13:54:17,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:54:17" (2/3) ... [2024-10-13 13:54:17,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d10ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:54:17, skipping insertion in model container [2024-10-13 13:54:17,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:54:17" (3/3) ... [2024-10-13 13:54:17,952 INFO L112 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound5.c [2024-10-13 13:54:17,967 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 13:54:17,967 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 84 error locations. [2024-10-13 13:54:18,032 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 13:54:18,039 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;@60cf0c79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 13:54:18,040 INFO L334 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2024-10-13 13:54:18,044 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 95 states have (on average 1.936842105263158) internal successors, (184), 179 states have internal predecessors, (184), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 13:54:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 13:54:18,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:54:18,052 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:54:18,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:54:18,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:54:18,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1162004414, now seen corresponding path program 1 times [2024-10-13 13:54:18,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:54:18,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442870250] [2024-10-13 13:54:18,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:18,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:54:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:18,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:54:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:18,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:54:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:18,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:54:18,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:54:18,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442870250] [2024-10-13 13:54:18,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442870250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:54:18,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:54:18,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:54:18,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593703111] [2024-10-13 13:54:18,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:54:18,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 13:54:18,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:54:18,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 13:54:18,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 13:54:18,245 INFO L87 Difference]: Start difference. First operand has 187 states, 95 states have (on average 1.936842105263158) internal successors, (184), 179 states have internal predecessors, (184), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 13:54:18,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:54:18,299 INFO L93 Difference]: Finished difference Result 359 states and 390 transitions. [2024-10-13 13:54:18,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 13:54:18,302 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-10-13 13:54:18,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:54:18,310 INFO L225 Difference]: With dead ends: 359 [2024-10-13 13:54:18,311 INFO L226 Difference]: Without dead ends: 171 [2024-10-13 13:54:18,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 13:54:18,319 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:54:18,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 175 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:54:18,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-13 13:54:18,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-10-13 13:54:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 94 states have (on average 1.7553191489361701) internal successors, (165), 164 states have internal predecessors, (165), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 13:54:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2024-10-13 13:54:18,373 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 14 [2024-10-13 13:54:18,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:54:18,374 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2024-10-13 13:54:18,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 13:54:18,374 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2024-10-13 13:54:18,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 13:54:18,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:54:18,376 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:54:18,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 13:54:18,377 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:54:18,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:54:18,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1920324093, now seen corresponding path program 1 times [2024-10-13 13:54:18,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:54:18,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293300553] [2024-10-13 13:54:18,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:18,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:54:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:18,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:54:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:18,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:54:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:54:18,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:54:18,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293300553] [2024-10-13 13:54:18,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293300553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:54:18,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:54:18,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:54:18,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659296060] [2024-10-13 13:54:18,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:54:18,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:54:18,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:54:18,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:54:18,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:54:18,503 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:54:18,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:54:18,991 INFO L93 Difference]: Finished difference Result 308 states and 320 transitions. [2024-10-13 13:54:18,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:54:18,992 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2024-10-13 13:54:18,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:54:18,996 INFO L225 Difference]: With dead ends: 308 [2024-10-13 13:54:18,997 INFO L226 Difference]: Without dead ends: 252 [2024-10-13 13:54:18,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-13 13:54:19,000 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 82 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 13:54:19,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 124 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 13:54:19,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-13 13:54:19,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 246. [2024-10-13 13:54:19,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 168 states have (on average 1.505952380952381) internal successors, (253), 238 states have internal predecessors, (253), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 13:54:19,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 263 transitions. [2024-10-13 13:54:19,028 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 263 transitions. Word has length 14 [2024-10-13 13:54:19,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:54:19,029 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 263 transitions. [2024-10-13 13:54:19,029 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:54:19,030 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 263 transitions. [2024-10-13 13:54:19,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-13 13:54:19,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:54:19,031 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:54:19,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 13:54:19,031 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:54:19,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:54:19,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1713492121, now seen corresponding path program 1 times [2024-10-13 13:54:19,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:54:19,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227220777] [2024-10-13 13:54:19,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:19,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:54:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:19,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:54:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:19,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:54:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:19,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:54:19,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:54:19,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227220777] [2024-10-13 13:54:19,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227220777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:54:19,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:54:19,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:54:19,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924239480] [2024-10-13 13:54:19,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:54:19,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:54:19,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:54:19,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:54:19,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:54:19,166 INFO L87 Difference]: Start difference. First operand 246 states and 263 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:54:19,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:54:19,243 INFO L93 Difference]: Finished difference Result 265 states and 277 transitions. [2024-10-13 13:54:19,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:54:19,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2024-10-13 13:54:19,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:54:19,246 INFO L225 Difference]: With dead ends: 265 [2024-10-13 13:54:19,248 INFO L226 Difference]: Without dead ends: 260 [2024-10-13 13:54:19,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-13 13:54:19,249 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 58 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:54:19,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 293 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:54:19,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-13 13:54:19,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 253. [2024-10-13 13:54:19,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 175 states have (on average 1.4857142857142858) internal successors, (260), 245 states have internal predecessors, (260), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 13:54:19,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 270 transitions. [2024-10-13 13:54:19,272 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 270 transitions. Word has length 42 [2024-10-13 13:54:19,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:54:19,273 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 270 transitions. [2024-10-13 13:54:19,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:54:19,273 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 270 transitions. [2024-10-13 13:54:19,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 13:54:19,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:54:19,275 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:54:19,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 13:54:19,275 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:54:19,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:54:19,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1693457243, now seen corresponding path program 1 times [2024-10-13 13:54:19,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:54:19,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648338322] [2024-10-13 13:54:19,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:19,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:54:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:19,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:54:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:19,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:54:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:19,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:54:19,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:54:19,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648338322] [2024-10-13 13:54:19,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648338322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:54:19,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:54:19,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:54:19,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812428946] [2024-10-13 13:54:19,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:54:19,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:54:19,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:54:19,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:54:19,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:54:19,435 INFO L87 Difference]: Start difference. First operand 253 states and 270 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:54:19,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:54:19,625 INFO L93 Difference]: Finished difference Result 264 states and 272 transitions. [2024-10-13 13:54:19,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:54:19,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2024-10-13 13:54:19,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:54:19,627 INFO L225 Difference]: With dead ends: 264 [2024-10-13 13:54:19,627 INFO L226 Difference]: Without dead ends: 259 [2024-10-13 13:54:19,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:54:19,629 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 133 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:54:19,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 230 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:54:19,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-13 13:54:19,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 253. [2024-10-13 13:54:19,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 175 states have (on average 1.457142857142857) internal successors, (255), 245 states have internal predecessors, (255), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 13:54:19,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 265 transitions. [2024-10-13 13:54:19,651 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 265 transitions. Word has length 44 [2024-10-13 13:54:19,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:54:19,651 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 265 transitions. [2024-10-13 13:54:19,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:54:19,652 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 265 transitions. [2024-10-13 13:54:19,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 13:54:19,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:54:19,653 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:54:19,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 13:54:19,653 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:54:19,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:54:19,656 INFO L85 PathProgramCache]: Analyzing trace with hash 957567089, now seen corresponding path program 1 times [2024-10-13 13:54:19,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:54:19,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706960990] [2024-10-13 13:54:19,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:19,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:54:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:19,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:54:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:19,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:54:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:54:19,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:54:19,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706960990] [2024-10-13 13:54:19,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706960990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:54:19,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:54:19,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:54:19,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197672621] [2024-10-13 13:54:19,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:54:19,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:54:19,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:54:19,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:54:19,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:54:19,763 INFO L87 Difference]: Start difference. First operand 253 states and 265 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:54:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:54:20,180 INFO L93 Difference]: Finished difference Result 263 states and 267 transitions. [2024-10-13 13:54:20,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:54:20,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-10-13 13:54:20,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:54:20,183 INFO L225 Difference]: With dead ends: 263 [2024-10-13 13:54:20,184 INFO L226 Difference]: Without dead ends: 225 [2024-10-13 13:54:20,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:54:20,185 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 82 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 13:54:20,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 264 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 13:54:20,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-13 13:54:20,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 219. [2024-10-13 13:54:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 211 states have internal predecessors, (217), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 13:54:20,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 227 transitions. [2024-10-13 13:54:20,196 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 227 transitions. Word has length 45 [2024-10-13 13:54:20,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:54:20,197 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 227 transitions. [2024-10-13 13:54:20,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:54:20,197 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 227 transitions. [2024-10-13 13:54:20,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-13 13:54:20,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:54:20,198 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:54:20,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 13:54:20,199 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:54:20,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:54:20,200 INFO L85 PathProgramCache]: Analyzing trace with hash -280525862, now seen corresponding path program 1 times [2024-10-13 13:54:20,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:54:20,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085644506] [2024-10-13 13:54:20,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:20,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:54:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:20,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:54:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:20,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:54:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:20,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 13:54:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:54:20,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:54:20,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085644506] [2024-10-13 13:54:20,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085644506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:54:20,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:54:20,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:54:20,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946997971] [2024-10-13 13:54:20,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:54:20,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:54:20,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:54:20,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:54:20,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:54:20,305 INFO L87 Difference]: Start difference. First operand 219 states and 227 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:54:20,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:54:20,329 INFO L93 Difference]: Finished difference Result 221 states and 227 transitions. [2024-10-13 13:54:20,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:54:20,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2024-10-13 13:54:20,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:54:20,333 INFO L225 Difference]: With dead ends: 221 [2024-10-13 13:54:20,333 INFO L226 Difference]: Without dead ends: 219 [2024-10-13 13:54:20,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-13 13:54:20,334 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 1 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:54:20,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 334 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:54:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-13 13:54:20,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-13 13:54:20,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 141 states have (on average 1.524822695035461) internal successors, (215), 211 states have internal predecessors, (215), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 13:54:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 225 transitions. [2024-10-13 13:54:20,344 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 225 transitions. Word has length 54 [2024-10-13 13:54:20,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:54:20,345 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 225 transitions. [2024-10-13 13:54:20,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:54:20,345 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 225 transitions. [2024-10-13 13:54:20,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 13:54:20,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:54:20,347 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:54:20,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 13:54:20,347 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:54:20,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:54:20,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1964749084, now seen corresponding path program 1 times [2024-10-13 13:54:20,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:54:20,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663127128] [2024-10-13 13:54:20,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:20,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:54:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:54:20,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1566707523] [2024-10-13 13:54:20,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:20,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:54:20,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:54:20,380 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:54:20,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 13:54:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:20,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 13:54:20,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:54:20,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:54:20,572 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:54:20,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:54:20,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663127128] [2024-10-13 13:54:20,573 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:54:20,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566707523] [2024-10-13 13:54:20,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566707523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:54:20,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:54:20,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:54:20,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554480593] [2024-10-13 13:54:20,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:54:20,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:54:20,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:54:20,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:54:20,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:54:20,576 INFO L87 Difference]: Start difference. First operand 219 states and 225 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:54:20,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:54:20,947 INFO L93 Difference]: Finished difference Result 358 states and 374 transitions. [2024-10-13 13:54:20,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:54:20,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-10-13 13:54:20,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:54:20,950 INFO L225 Difference]: With dead ends: 358 [2024-10-13 13:54:20,951 INFO L226 Difference]: Without dead ends: 304 [2024-10-13 13:54:20,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 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-13 13:54:20,953 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 90 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 13:54:20,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 149 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 13:54:20,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-13 13:54:20,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 298. [2024-10-13 13:54:20,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 218 states have (on average 1.4036697247706422) internal successors, (306), 288 states have internal predecessors, (306), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 13:54:20,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 320 transitions. [2024-10-13 13:54:20,966 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 320 transitions. Word has length 59 [2024-10-13 13:54:20,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:54:20,967 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 320 transitions. [2024-10-13 13:54:20,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:54:20,967 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 320 transitions. [2024-10-13 13:54:20,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-13 13:54:20,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:54:20,970 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:54:20,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 13:54:21,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:54:21,175 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:54:21,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:54:21,175 INFO L85 PathProgramCache]: Analyzing trace with hash -69304982, now seen corresponding path program 1 times [2024-10-13 13:54:21,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:54:21,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809650006] [2024-10-13 13:54:21,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:21,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:54:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:21,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:54:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:21,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:54:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:21,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 13:54:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:21,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:54:21,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:54:21,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809650006] [2024-10-13 13:54:21,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809650006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:54:21,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:54:21,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:54:21,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048853736] [2024-10-13 13:54:21,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:54:21,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:54:21,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:54:21,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:54:21,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:54:21,270 INFO L87 Difference]: Start difference. First operand 298 states and 320 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:54:25,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:54:29,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:54:29,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:54:29,513 INFO L93 Difference]: Finished difference Result 299 states and 320 transitions. [2024-10-13 13:54:29,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:54:29,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2024-10-13 13:54:29,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:54:29,515 INFO L225 Difference]: With dead ends: 299 [2024-10-13 13:54:29,515 INFO L226 Difference]: Without dead ends: 298 [2024-10-13 13:54:29,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:54:29,516 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 39 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:54:29,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 298 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2024-10-13 13:54:29,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-10-13 13:54:29,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2024-10-13 13:54:29,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 218 states have (on average 1.3990825688073394) internal successors, (305), 288 states have internal predecessors, (305), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 13:54:29,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 319 transitions. [2024-10-13 13:54:29,526 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 319 transitions. Word has length 65 [2024-10-13 13:54:29,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:54:29,526 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 319 transitions. [2024-10-13 13:54:29,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:54:29,527 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 319 transitions. [2024-10-13 13:54:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 13:54:29,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:54:29,528 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:54:29,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 13:54:29,528 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:54:29,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:54:29,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1220812152, now seen corresponding path program 1 times [2024-10-13 13:54:29,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:54:29,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172216540] [2024-10-13 13:54:29,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:29,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:54:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:54:29,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [860170391] [2024-10-13 13:54:29,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:29,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:54:29,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:54:29,552 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:54:29,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 13:54:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:29,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 13:54:29,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:54:29,785 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-13 13:54:29,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:54:29,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:54:29,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172216540] [2024-10-13 13:54:29,785 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:54:29,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860170391] [2024-10-13 13:54:29,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860170391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:54:29,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:54:29,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:54:29,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606021238] [2024-10-13 13:54:29,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:54:29,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:54:29,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:54:29,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:54:29,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:54:29,787 INFO L87 Difference]: Start difference. First operand 298 states and 319 transitions. Second operand has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:54:29,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:54:29,896 INFO L93 Difference]: Finished difference Result 298 states and 319 transitions. [2024-10-13 13:54:29,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:54:29,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 95 [2024-10-13 13:54:29,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:54:29,898 INFO L225 Difference]: With dead ends: 298 [2024-10-13 13:54:29,898 INFO L226 Difference]: Without dead ends: 295 [2024-10-13 13:54:29,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:54:29,899 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 95 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:54:29,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 156 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:54:29,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-13 13:54:29,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2024-10-13 13:54:29,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 218 states have (on average 1.3761467889908257) internal successors, (300), 285 states have internal predecessors, (300), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 13:54:29,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 314 transitions. [2024-10-13 13:54:29,908 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 314 transitions. Word has length 95 [2024-10-13 13:54:29,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:54:29,909 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 314 transitions. [2024-10-13 13:54:29,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:54:29,909 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 314 transitions. [2024-10-13 13:54:29,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-13 13:54:29,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:54:29,910 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:54:29,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 13:54:30,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-13 13:54:30,111 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:54:30,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:54:30,112 INFO L85 PathProgramCache]: Analyzing trace with hash 809529056, now seen corresponding path program 1 times [2024-10-13 13:54:30,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:54:30,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379206177] [2024-10-13 13:54:30,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:30,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:54:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:54:30,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1566361592] [2024-10-13 13:54:30,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:30,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:54:30,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:54:30,136 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:54:30,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 13:54:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:30,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 13:54:30,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:54:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:54:30,462 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:54:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:54:30,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:54:30,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379206177] [2024-10-13 13:54:30,682 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:54:30,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566361592] [2024-10-13 13:54:30,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566361592] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:54:30,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 13:54:30,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-13 13:54:30,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240084222] [2024-10-13 13:54:30,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 13:54:30,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 13:54:30,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:54:30,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 13:54:30,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 13:54:30,684 INFO L87 Difference]: Start difference. First operand 295 states and 314 transitions. Second operand has 8 states, 7 states have (on average 23.857142857142858) internal successors, (167), 8 states have internal predecessors, (167), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 13:54:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:54:31,543 INFO L93 Difference]: Finished difference Result 367 states and 382 transitions. [2024-10-13 13:54:31,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 13:54:31,543 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 23.857142857142858) internal successors, (167), 8 states have internal predecessors, (167), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 96 [2024-10-13 13:54:31,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:54:31,546 INFO L225 Difference]: With dead ends: 367 [2024-10-13 13:54:31,546 INFO L226 Difference]: Without dead ends: 360 [2024-10-13 13:54:31,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-13 13:54:31,550 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 284 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 13:54:31,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 300 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 13:54:31,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-13 13:54:31,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 333. [2024-10-13 13:54:31,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 257 states have (on average 1.3968871595330739) internal successors, (359), 323 states have internal predecessors, (359), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 13:54:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 373 transitions. [2024-10-13 13:54:31,565 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 373 transitions. Word has length 96 [2024-10-13 13:54:31,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:54:31,566 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 373 transitions. [2024-10-13 13:54:31,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 23.857142857142858) internal successors, (167), 8 states have internal predecessors, (167), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 13:54:31,567 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 373 transitions. [2024-10-13 13:54:31,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-13 13:54:31,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:54:31,570 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:54:31,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 13:54:31,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:54:31,775 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:54:31,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:54:31,775 INFO L85 PathProgramCache]: Analyzing trace with hash -674402934, now seen corresponding path program 1 times [2024-10-13 13:54:31,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:54:31,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014992843] [2024-10-13 13:54:31,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:31,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:54:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:54:31,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [512597336] [2024-10-13 13:54:31,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:54:31,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:54:31,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:54:31,817 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:54:31,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 13:54:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:54:31,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 13:54:31,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:54:32,146 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:54:32,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:54:34,020 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:54:34,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:54:34,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014992843] [2024-10-13 13:54:34,021 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:54:34,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512597336] [2024-10-13 13:54:34,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512597336] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 13:54:34,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:54:34,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2024-10-13 13:54:34,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043552814] [2024-10-13 13:54:34,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:54:34,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 13:54:34,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:54:34,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 13:54:34,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:54:34,023 INFO L87 Difference]: Start difference. First operand 333 states and 373 transitions. Second operand has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:54:35,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:54:39,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:54:43,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:54:46,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:54:48,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:54:50,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:54:55,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:54:59,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:55:01,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:55:03,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:55:06,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:55:08,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:55:13,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 13:55:13,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:55:13,564 INFO L93 Difference]: Finished difference Result 333 states and 373 transitions. [2024-10-13 13:55:13,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:55:13,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 97 [2024-10-13 13:55:13,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:55:13,567 INFO L225 Difference]: With dead ends: 333 [2024-10-13 13:55:13,567 INFO L226 Difference]: Without dead ends: 331 [2024-10-13 13:55:13,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2024-10-13 13:55:13,568 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 147 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 8 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.5s IncrementalHoareTripleChecker+Time [2024-10-13 13:55:13,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 66 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 417 Invalid, 5 Unknown, 0 Unchecked, 39.5s Time] [2024-10-13 13:55:13,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-10-13 13:55:13,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2024-10-13 13:55:13,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 257 states have (on average 1.3813229571984436) internal successors, (355), 321 states have internal predecessors, (355), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 13:55:13,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 369 transitions. [2024-10-13 13:55:13,579 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 369 transitions. Word has length 97 [2024-10-13 13:55:13,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:55:13,580 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 369 transitions. [2024-10-13 13:55:13,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:55:13,580 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 369 transitions. [2024-10-13 13:55:13,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 13:55:13,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:55:13,583 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:55:13,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 13:55:13,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:55:13,784 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:55:13,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:55:13,785 INFO L85 PathProgramCache]: Analyzing trace with hash 568345634, now seen corresponding path program 1 times [2024-10-13 13:55:13,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:55:13,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085597012] [2024-10-13 13:55:13,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:13,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:55:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:55:13,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2133517584] [2024-10-13 13:55:13,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:13,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:55:13,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:55:13,820 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:55:13,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 13:55:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:13,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 13:55:13,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:55:14,037 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:55:14,037 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:55:14,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:55:14,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085597012] [2024-10-13 13:55:14,038 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:55:14,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133517584] [2024-10-13 13:55:14,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133517584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:55:14,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:55:14,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 13:55:14,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894811322] [2024-10-13 13:55:14,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:55:14,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:55:14,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:55:14,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:55:14,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:55:14,042 INFO L87 Difference]: Start difference. First operand 331 states and 369 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:55:14,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:55:14,393 INFO L93 Difference]: Finished difference Result 331 states and 369 transitions. [2024-10-13 13:55:14,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:55:14,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 98 [2024-10-13 13:55:14,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:55:14,395 INFO L225 Difference]: With dead ends: 331 [2024-10-13 13:55:14,395 INFO L226 Difference]: Without dead ends: 311 [2024-10-13 13:55:14,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:55:14,396 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 114 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 13:55:14,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 69 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 13:55:14,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-13 13:55:14,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2024-10-13 13:55:14,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 257 states have (on average 1.264591439688716) internal successors, (325), 301 states have internal predecessors, (325), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 13:55:14,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 339 transitions. [2024-10-13 13:55:14,407 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 339 transitions. Word has length 98 [2024-10-13 13:55:14,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:55:14,408 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 339 transitions. [2024-10-13 13:55:14,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:55:14,408 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 339 transitions. [2024-10-13 13:55:14,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 13:55:14,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:55:14,409 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:55:14,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 13:55:14,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-13 13:55:14,609 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:55:14,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:55:14,610 INFO L85 PathProgramCache]: Analyzing trace with hash 438845580, now seen corresponding path program 1 times [2024-10-13 13:55:14,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:55:14,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332241679] [2024-10-13 13:55:14,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:14,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:55:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:55:14,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [302436480] [2024-10-13 13:55:14,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:14,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:55:14,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:55:14,643 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:55:14,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 13:55:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:14,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 13:55:14,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:55:14,956 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:55:14,956 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:55:15,206 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-13 13:55:15,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:55:15,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332241679] [2024-10-13 13:55:15,206 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:55:15,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302436480] [2024-10-13 13:55:15,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302436480] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 13:55:15,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:55:15,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 13:55:15,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350415974] [2024-10-13 13:55:15,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:55:15,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:55:15,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:55:15,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:55:15,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:55:15,209 INFO L87 Difference]: Start difference. First operand 311 states and 339 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:55:17,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:55:17,329 INFO L93 Difference]: Finished difference Result 311 states and 339 transitions. [2024-10-13 13:55:17,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:55:17,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 99 [2024-10-13 13:55:17,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:55:17,331 INFO L225 Difference]: With dead ends: 311 [2024-10-13 13:55:17,331 INFO L226 Difference]: Without dead ends: 309 [2024-10-13 13:55:17,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:55:17,332 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 79 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:55:17,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 41 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-13 13:55:17,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-13 13:55:17,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2024-10-13 13:55:17,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 257 states have (on average 1.2490272373540856) internal successors, (321), 299 states have internal predecessors, (321), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 13:55:17,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 335 transitions. [2024-10-13 13:55:17,345 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 335 transitions. Word has length 99 [2024-10-13 13:55:17,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:55:17,345 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 335 transitions. [2024-10-13 13:55:17,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:55:17,346 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 335 transitions. [2024-10-13 13:55:17,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-13 13:55:17,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:55:17,347 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:55:17,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-13 13:55:17,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:55:17,549 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:55:17,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:55:17,549 INFO L85 PathProgramCache]: Analyzing trace with hash -920443063, now seen corresponding path program 1 times [2024-10-13 13:55:17,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:55:17,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703230262] [2024-10-13 13:55:17,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:17,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:55:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:17,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:55:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:17,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:55:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:17,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 13:55:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:17,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 13:55:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:17,716 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 13:55:17,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:55:17,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703230262] [2024-10-13 13:55:17,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703230262] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:55:17,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300275856] [2024-10-13 13:55:17,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:17,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:55:17,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:55:17,721 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:55:17,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 13:55:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:17,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 13:55:17,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:55:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 13:55:17,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:55:17,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300275856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:55:17,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:55:17,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-13 13:55:17,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9636301] [2024-10-13 13:55:17,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:55:17,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:55:17,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:55:17,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:55:17,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:55:17,882 INFO L87 Difference]: Start difference. First operand 309 states and 335 transitions. Second operand has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 13:55:17,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:55:17,911 INFO L93 Difference]: Finished difference Result 309 states and 335 transitions. [2024-10-13 13:55:17,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:55:17,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 107 [2024-10-13 13:55:17,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:55:17,913 INFO L225 Difference]: With dead ends: 309 [2024-10-13 13:55:17,913 INFO L226 Difference]: Without dead ends: 308 [2024-10-13 13:55:17,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:55:17,914 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 25 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:55:17,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 346 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:55:17,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-13 13:55:17,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-10-13 13:55:17,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 257 states have (on average 1.2412451361867705) internal successors, (319), 298 states have internal predecessors, (319), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 13:55:17,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 333 transitions. [2024-10-13 13:55:17,926 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 333 transitions. Word has length 107 [2024-10-13 13:55:17,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:55:17,927 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 333 transitions. [2024-10-13 13:55:17,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 13:55:17,927 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 333 transitions. [2024-10-13 13:55:17,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-13 13:55:17,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:55:17,928 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:55:17,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 13:55:18,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:55:18,129 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:55:18,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:55:18,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1531036241, now seen corresponding path program 1 times [2024-10-13 13:55:18,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:55:18,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284231457] [2024-10-13 13:55:18,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:18,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:55:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:18,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:55:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:18,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:55:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:18,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 13:55:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:18,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 13:55:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:18,257 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 13:55:18,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:55:18,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284231457] [2024-10-13 13:55:18,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284231457] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:55:18,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457792326] [2024-10-13 13:55:18,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:18,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:55:18,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:55:18,261 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:55:18,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 13:55:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:18,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 13:55:18,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:55:18,425 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 13:55:18,425 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:55:18,549 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 13:55:18,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457792326] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:55:18,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:55:18,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-13 13:55:18,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613463435] [2024-10-13 13:55:18,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:55:18,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:55:18,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:55:18,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:55:18,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:55:18,552 INFO L87 Difference]: Start difference. First operand 308 states and 333 transitions. Second operand has 7 states, 6 states have (on average 36.666666666666664) internal successors, (220), 7 states have internal predecessors, (220), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-13 13:55:18,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:55:18,600 INFO L93 Difference]: Finished difference Result 407 states and 420 transitions. [2024-10-13 13:55:18,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 13:55:18,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 36.666666666666664) internal successors, (220), 7 states have internal predecessors, (220), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 108 [2024-10-13 13:55:18,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:55:18,602 INFO L225 Difference]: With dead ends: 407 [2024-10-13 13:55:18,602 INFO L226 Difference]: Without dead ends: 406 [2024-10-13 13:55:18,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:55:18,603 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 68 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:55:18,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 528 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:55:18,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-13 13:55:18,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 365. [2024-10-13 13:55:18,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 312 states have (on average 1.2788461538461537) internal successors, (399), 353 states have internal predecessors, (399), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 13:55:18,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 417 transitions. [2024-10-13 13:55:18,638 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 417 transitions. Word has length 108 [2024-10-13 13:55:18,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:55:18,639 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 417 transitions. [2024-10-13 13:55:18,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 36.666666666666664) internal successors, (220), 7 states have internal predecessors, (220), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-13 13:55:18,639 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 417 transitions. [2024-10-13 13:55:18,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 13:55:18,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:55:18,641 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:55:18,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 13:55:18,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-13 13:55:18,841 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:55:18,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:55:18,842 INFO L85 PathProgramCache]: Analyzing trace with hash -423331491, now seen corresponding path program 1 times [2024-10-13 13:55:18,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:55:18,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363044541] [2024-10-13 13:55:18,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:18,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:55:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:18,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:55:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:18,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:55:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:18,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 13:55:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:18,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 13:55:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:18,925 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 13:55:18,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:55:18,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363044541] [2024-10-13 13:55:18,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363044541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:55:18,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:55:18,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:55:18,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559977868] [2024-10-13 13:55:18,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:55:18,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:55:18,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:55:18,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:55:18,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:55:18,929 INFO L87 Difference]: Start difference. First operand 365 states and 417 transitions. Second operand has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 13:55:19,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:55:19,177 INFO L93 Difference]: Finished difference Result 365 states and 417 transitions. [2024-10-13 13:55:19,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:55:19,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 120 [2024-10-13 13:55:19,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:55:19,180 INFO L225 Difference]: With dead ends: 365 [2024-10-13 13:55:19,180 INFO L226 Difference]: Without dead ends: 358 [2024-10-13 13:55:19,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:55:19,180 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 128 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:55:19,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 38 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:55:19,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-13 13:55:19,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2024-10-13 13:55:19,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 312 states have (on average 1.233974358974359) internal successors, (385), 346 states have internal predecessors, (385), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 13:55:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 403 transitions. [2024-10-13 13:55:19,196 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 403 transitions. Word has length 120 [2024-10-13 13:55:19,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:55:19,197 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 403 transitions. [2024-10-13 13:55:19,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 13:55:19,197 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 403 transitions. [2024-10-13 13:55:19,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-13 13:55:19,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:55:19,198 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:55:19,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 13:55:19,198 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:55:19,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:55:19,199 INFO L85 PathProgramCache]: Analyzing trace with hash -238374285, now seen corresponding path program 1 times [2024-10-13 13:55:19,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:55:19,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45335344] [2024-10-13 13:55:19,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:19,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:55:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:19,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:55:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:19,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:55:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:19,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 13:55:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:19,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 13:55:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:19,273 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 13:55:19,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:55:19,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45335344] [2024-10-13 13:55:19,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45335344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:55:19,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:55:19,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:55:19,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975834501] [2024-10-13 13:55:19,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:55:19,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:55:19,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:55:19,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:55:19,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:55:19,276 INFO L87 Difference]: Start difference. First operand 358 states and 403 transitions. Second operand has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 13:55:19,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:55:19,430 INFO L93 Difference]: Finished difference Result 358 states and 403 transitions. [2024-10-13 13:55:19,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:55:19,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 121 [2024-10-13 13:55:19,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:55:19,433 INFO L225 Difference]: With dead ends: 358 [2024-10-13 13:55:19,434 INFO L226 Difference]: Without dead ends: 357 [2024-10-13 13:55:19,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:55:19,435 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 108 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:55:19,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 38 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:55:19,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-13 13:55:19,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2024-10-13 13:55:19,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 312 states have (on average 1.2243589743589745) internal successors, (382), 345 states have internal predecessors, (382), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 13:55:19,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 400 transitions. [2024-10-13 13:55:19,452 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 400 transitions. Word has length 121 [2024-10-13 13:55:19,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:55:19,453 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 400 transitions. [2024-10-13 13:55:19,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.666666666666668) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 13:55:19,453 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 400 transitions. [2024-10-13 13:55:19,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-13 13:55:19,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:55:19,454 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:55:19,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 13:55:19,455 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:55:19,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:55:19,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1444419595, now seen corresponding path program 1 times [2024-10-13 13:55:19,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:55:19,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813183717] [2024-10-13 13:55:19,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:19,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:55:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:55:19,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2039317839] [2024-10-13 13:55:19,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:19,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:55:19,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:55:19,482 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:55:19,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 13:55:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:19,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 13:55:19,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:55:19,692 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 13:55:19,692 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:55:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 13:55:19,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:55:19,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813183717] [2024-10-13 13:55:19,907 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:55:19,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039317839] [2024-10-13 13:55:19,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039317839] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:55:19,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 13:55:19,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-13 13:55:19,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074362670] [2024-10-13 13:55:19,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 13:55:19,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 13:55:19,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:55:19,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 13:55:19,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 13:55:19,909 INFO L87 Difference]: Start difference. First operand 357 states and 400 transitions. Second operand has 8 states, 7 states have (on average 30.142857142857142) internal successors, (211), 8 states have internal predecessors, (211), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-13 13:55:20,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:55:20,509 INFO L93 Difference]: Finished difference Result 418 states and 453 transitions. [2024-10-13 13:55:20,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 13:55:20,510 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 30.142857142857142) internal successors, (211), 8 states have internal predecessors, (211), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 123 [2024-10-13 13:55:20,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:55:20,512 INFO L225 Difference]: With dead ends: 418 [2024-10-13 13:55:20,512 INFO L226 Difference]: Without dead ends: 388 [2024-10-13 13:55:20,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-13 13:55:20,513 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 272 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 13:55:20,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 191 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 13:55:20,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-13 13:55:20,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 341. [2024-10-13 13:55:20,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 301 states have (on average 1.1661129568106312) internal successors, (351), 330 states have internal predecessors, (351), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 13:55:20,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 367 transitions. [2024-10-13 13:55:20,527 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 367 transitions. Word has length 123 [2024-10-13 13:55:20,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:55:20,527 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 367 transitions. [2024-10-13 13:55:20,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 30.142857142857142) internal successors, (211), 8 states have internal predecessors, (211), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-13 13:55:20,528 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 367 transitions. [2024-10-13 13:55:20,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 13:55:20,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:55:20,529 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:55:20,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-13 13:55:20,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-13 13:55:20,734 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:55:20,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:55:20,734 INFO L85 PathProgramCache]: Analyzing trace with hash -351277160, now seen corresponding path program 1 times [2024-10-13 13:55:20,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:55:20,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774202479] [2024-10-13 13:55:20,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:20,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:55:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:55:20,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [602584209] [2024-10-13 13:55:20,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:20,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:55:20,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:55:20,765 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:55:20,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-13 13:55:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:20,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 13:55:20,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:55:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 13:55:21,182 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:55:22,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:55:22,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774202479] [2024-10-13 13:55:22,600 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:55:22,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602584209] [2024-10-13 13:55:22,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602584209] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:55:22,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:55:22,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-10-13 13:55:22,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692111168] [2024-10-13 13:55:22,600 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-13 13:55:22,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:55:22,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:55:22,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:55:22,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:55:22,601 INFO L87 Difference]: Start difference. First operand 341 states and 367 transitions. Second operand has 7 states, 6 states have (on average 21.166666666666668) internal successors, (127), 7 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-13 13:55:22,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:55:22,872 INFO L93 Difference]: Finished difference Result 379 states and 406 transitions. [2024-10-13 13:55:22,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 13:55:22,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 21.166666666666668) internal successors, (127), 7 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 146 [2024-10-13 13:55:22,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:55:22,874 INFO L225 Difference]: With dead ends: 379 [2024-10-13 13:55:22,874 INFO L226 Difference]: Without dead ends: 378 [2024-10-13 13:55:22,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:55:22,875 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 22 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 13:55:22,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 253 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 13:55:22,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-13 13:55:22,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2024-10-13 13:55:22,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 336 states have (on average 1.1488095238095237) internal successors, (386), 365 states have internal predecessors, (386), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 13:55:22,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 404 transitions. [2024-10-13 13:55:22,891 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 404 transitions. Word has length 146 [2024-10-13 13:55:22,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:55:22,892 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 404 transitions. [2024-10-13 13:55:22,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.166666666666668) internal successors, (127), 7 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-13 13:55:22,892 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 404 transitions. [2024-10-13 13:55:22,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 13:55:22,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:55:22,894 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:55:22,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-13 13:55:23,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:55:23,095 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:55:23,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:55:23,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1995310146, now seen corresponding path program 1 times [2024-10-13 13:55:23,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:55:23,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452242348] [2024-10-13 13:55:23,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:23,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:55:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:55:23,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1013249683] [2024-10-13 13:55:23,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:23,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:55:23,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:55:23,119 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:55:23,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-13 13:55:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:23,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 13:55:23,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:55:23,451 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 13:55:23,452 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:55:25,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:55:25,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452242348] [2024-10-13 13:55:25,538 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:55:25,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013249683] [2024-10-13 13:55:25,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013249683] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:55:25,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:55:25,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-10-13 13:55:25,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865691352] [2024-10-13 13:55:25,538 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-13 13:55:25,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:55:25,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:55:25,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:55:25,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:55:25,539 INFO L87 Difference]: Start difference. First operand 377 states and 404 transitions. Second operand has 7 states, 6 states have (on average 21.333333333333332) internal successors, (128), 7 states have internal predecessors, (128), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-13 13:55:25,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:55:25,868 INFO L93 Difference]: Finished difference Result 379 states and 405 transitions. [2024-10-13 13:55:25,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 13:55:25,868 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 21.333333333333332) internal successors, (128), 7 states have internal predecessors, (128), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 147 [2024-10-13 13:55:25,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:55:25,869 INFO L225 Difference]: With dead ends: 379 [2024-10-13 13:55:25,869 INFO L226 Difference]: Without dead ends: 341 [2024-10-13 13:55:25,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:55:25,870 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 20 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 13:55:25,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 274 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 13:55:25,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-10-13 13:55:25,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2024-10-13 13:55:25,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 301 states have (on average 1.1627906976744187) internal successors, (350), 330 states have internal predecessors, (350), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 13:55:25,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 366 transitions. [2024-10-13 13:55:25,884 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 366 transitions. Word has length 147 [2024-10-13 13:55:25,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:55:25,884 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 366 transitions. [2024-10-13 13:55:25,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.333333333333332) internal successors, (128), 7 states have internal predecessors, (128), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-13 13:55:25,885 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 366 transitions. [2024-10-13 13:55:25,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 13:55:25,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:55:25,886 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:55:25,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-13 13:55:26,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:55:26,091 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:55:26,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:55:26,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1439281792, now seen corresponding path program 1 times [2024-10-13 13:55:26,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:55:26,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499916636] [2024-10-13 13:55:26,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:26,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:55:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:55:26,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [752151385] [2024-10-13 13:55:26,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:26,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:55:26,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:55:26,119 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:55:26,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-13 13:55:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:26,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 13:55:26,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:55:26,357 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 13:55:26,357 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:55:26,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:55:26,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499916636] [2024-10-13 13:55:26,357 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:55:26,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752151385] [2024-10-13 13:55:26,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752151385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:55:26,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:55:26,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 13:55:26,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049811430] [2024-10-13 13:55:26,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:55:26,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 13:55:26,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:55:26,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 13:55:26,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 13:55:26,360 INFO L87 Difference]: Start difference. First operand 341 states and 366 transitions. Second operand has 6 states, 5 states have (on average 29.4) internal successors, (147), 6 states have internal predecessors, (147), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-13 13:55:26,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:55:26,734 INFO L93 Difference]: Finished difference Result 351 states and 378 transitions. [2024-10-13 13:55:26,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 13:55:26,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 29.4) internal successors, (147), 6 states have internal predecessors, (147), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 166 [2024-10-13 13:55:26,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:55:26,736 INFO L225 Difference]: With dead ends: 351 [2024-10-13 13:55:26,736 INFO L226 Difference]: Without dead ends: 338 [2024-10-13 13:55:26,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 13:55:26,737 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 155 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 13:55:26,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 136 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 13:55:26,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-10-13 13:55:26,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 325. [2024-10-13 13:55:26,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 298 states have (on average 1.0973154362416107) internal successors, (327), 314 states have internal predecessors, (327), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 13:55:26,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 343 transitions. [2024-10-13 13:55:26,752 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 343 transitions. Word has length 166 [2024-10-13 13:55:26,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:55:26,753 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 343 transitions. [2024-10-13 13:55:26,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 29.4) internal successors, (147), 6 states have internal predecessors, (147), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-13 13:55:26,753 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 343 transitions. [2024-10-13 13:55:26,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-13 13:55:26,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:55:26,754 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:55:26,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-13 13:55:26,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-13 13:55:26,957 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:55:26,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:55:26,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1668062458, now seen corresponding path program 1 times [2024-10-13 13:55:26,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:55:26,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190282726] [2024-10-13 13:55:26,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:26,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:55:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:55:27,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2111912698] [2024-10-13 13:55:27,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:27,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:55:27,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:55:27,020 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:55:27,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-13 13:55:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:27,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 13:55:27,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:55:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 13:55:27,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:55:27,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:55:27,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190282726] [2024-10-13 13:55:27,329 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:55:27,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111912698] [2024-10-13 13:55:27,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111912698] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:55:27,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:55:27,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2024-10-13 13:55:27,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174889796] [2024-10-13 13:55:27,329 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-13 13:55:27,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 13:55:27,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:55:27,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 13:55:27,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-13 13:55:27,331 INFO L87 Difference]: Start difference. First operand 325 states and 343 transitions. Second operand has 6 states, 5 states have (on average 29.6) internal successors, (148), 6 states have internal predecessors, (148), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-13 13:55:27,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:55:27,623 INFO L93 Difference]: Finished difference Result 381 states and 403 transitions. [2024-10-13 13:55:27,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 13:55:27,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 29.6) internal successors, (148), 6 states have internal predecessors, (148), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 167 [2024-10-13 13:55:27,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:55:27,625 INFO L225 Difference]: With dead ends: 381 [2024-10-13 13:55:27,625 INFO L226 Difference]: Without dead ends: 378 [2024-10-13 13:55:27,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-13 13:55:27,626 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 117 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 13:55:27,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 92 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 13:55:27,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-13 13:55:27,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 325. [2024-10-13 13:55:27,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 298 states have (on average 1.087248322147651) internal successors, (324), 314 states have internal predecessors, (324), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 13:55:27,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 340 transitions. [2024-10-13 13:55:27,640 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 340 transitions. Word has length 167 [2024-10-13 13:55:27,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:55:27,641 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 340 transitions. [2024-10-13 13:55:27,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 29.6) internal successors, (148), 6 states have internal predecessors, (148), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-13 13:55:27,641 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 340 transitions. [2024-10-13 13:55:27,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-13 13:55:27,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:55:27,643 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:55:27,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-13 13:55:27,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-13 13:55:27,847 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:55:27,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:55:27,847 INFO L85 PathProgramCache]: Analyzing trace with hash -985216376, now seen corresponding path program 1 times [2024-10-13 13:55:27,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:55:27,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034020167] [2024-10-13 13:55:27,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:27,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:55:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:55:27,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1588374324] [2024-10-13 13:55:27,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:27,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:55:27,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:55:27,886 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:55:27,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-13 13:55:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:27,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 13:55:27,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:55:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 13:55:28,102 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:55:28,425 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 13:55:28,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:55:28,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034020167] [2024-10-13 13:55:28,426 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:55:28,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588374324] [2024-10-13 13:55:28,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588374324] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:55:28,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 13:55:28,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-13 13:55:28,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594668155] [2024-10-13 13:55:28,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 13:55:28,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 13:55:28,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:55:28,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 13:55:28,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 13:55:28,429 INFO L87 Difference]: Start difference. First operand 325 states and 340 transitions. Second operand has 10 states, 9 states have (on average 32.55555555555556) internal successors, (293), 10 states have internal predecessors, (293), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-13 13:55:28,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:55:28,993 INFO L93 Difference]: Finished difference Result 399 states and 422 transitions. [2024-10-13 13:55:28,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 13:55:28,994 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 32.55555555555556) internal successors, (293), 10 states have internal predecessors, (293), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 169 [2024-10-13 13:55:28,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:55:28,995 INFO L225 Difference]: With dead ends: 399 [2024-10-13 13:55:28,995 INFO L226 Difference]: Without dead ends: 388 [2024-10-13 13:55:28,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:55:28,996 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 365 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 13:55:28,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 250 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 13:55:28,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-13 13:55:29,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 312. [2024-10-13 13:55:29,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 292 states have (on average 1.047945205479452) internal successors, (306), 301 states have internal predecessors, (306), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 13:55:29,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 322 transitions. [2024-10-13 13:55:29,010 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 322 transitions. Word has length 169 [2024-10-13 13:55:29,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:55:29,010 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 322 transitions. [2024-10-13 13:55:29,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 32.55555555555556) internal successors, (293), 10 states have internal predecessors, (293), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-13 13:55:29,011 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 322 transitions. [2024-10-13 13:55:29,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 13:55:29,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:55:29,012 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:55:29,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-13 13:55:29,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:55:29,213 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:55:29,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:55:29,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1900127734, now seen corresponding path program 1 times [2024-10-13 13:55:29,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:55:29,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489747260] [2024-10-13 13:55:29,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:29,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:55:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:55:29,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [480169573] [2024-10-13 13:55:29,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:29,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:55:29,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:55:29,241 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:55:29,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-13 13:55:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:55:29,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 13:55:29,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:55:29,692 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 13:55:29,692 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:55:30,083 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 13:55:30,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:55:30,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489747260] [2024-10-13 13:55:30,083 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:55:30,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480169573] [2024-10-13 13:55:30,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480169573] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:55:30,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 13:55:30,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-10-13 13:55:30,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34037524] [2024-10-13 13:55:30,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 13:55:30,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 13:55:30,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:55:30,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 13:55:30,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2024-10-13 13:55:30,085 INFO L87 Difference]: Start difference. First operand 312 states and 322 transitions. Second operand has 14 states, 13 states have (on average 22.846153846153847) internal successors, (297), 14 states have internal predecessors, (297), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-13 13:55:31,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:55:31,091 INFO L93 Difference]: Finished difference Result 553 states and 589 transitions. [2024-10-13 13:55:31,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 13:55:31,092 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 22.846153846153847) internal successors, (297), 14 states have internal predecessors, (297), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 171 [2024-10-13 13:55:31,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:55:31,095 INFO L225 Difference]: With dead ends: 553 [2024-10-13 13:55:31,095 INFO L226 Difference]: Without dead ends: 552 [2024-10-13 13:55:31,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=179, Unknown=0, NotChecked=0, Total=306 [2024-10-13 13:55:31,096 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 463 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 13:55:31,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 196 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1557 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 13:55:31,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-13 13:55:31,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 420. [2024-10-13 13:55:31,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 398 states have (on average 1.0628140703517588) internal successors, (423), 407 states have internal predecessors, (423), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 13:55:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 443 transitions. [2024-10-13 13:55:31,120 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 443 transitions. Word has length 171 [2024-10-13 13:55:31,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:55:31,121 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 443 transitions. [2024-10-13 13:55:31,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 22.846153846153847) internal successors, (297), 14 states have internal predecessors, (297), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-13 13:55:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 443 transitions. [2024-10-13 13:55:31,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-13 13:55:31,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:55:31,124 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:55:31,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-13 13:55:31,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:55:31,325 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:55:31,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:55:31,326 INFO L85 PathProgramCache]: Analyzing trace with hash 396242567, now seen corresponding path program 2 times [2024-10-13 13:55:31,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:55:31,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899028505] [2024-10-13 13:55:31,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:31,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:55:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:55:31,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2110037178] [2024-10-13 13:55:31,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 13:55:31,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:55:31,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:55:31,368 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:55:31,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-13 13:55:31,417 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 13:55:31,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:55:31,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 13:55:31,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:55:31,988 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-10-13 13:55:31,988 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:55:31,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:55:31,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899028505] [2024-10-13 13:55:31,988 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 13:55:31,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110037178] [2024-10-13 13:55:31,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110037178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:55:31,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:55:31,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 13:55:31,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633374579] [2024-10-13 13:55:31,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:55:31,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:55:31,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:55:31,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:55:31,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:55:31,990 INFO L87 Difference]: Start difference. First operand 420 states and 443 transitions. Second operand has 5 states, 4 states have (on average 28.0) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 13:55:32,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:55:32,124 INFO L93 Difference]: Finished difference Result 420 states and 443 transitions. [2024-10-13 13:55:32,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:55:32,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.0) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 199 [2024-10-13 13:55:32,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:55:32,132 INFO L225 Difference]: With dead ends: 420 [2024-10-13 13:55:32,132 INFO L226 Difference]: Without dead ends: 361 [2024-10-13 13:55:32,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:55:32,133 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 52 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:55:32,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 45 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:55:32,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-13 13:55:32,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2024-10-13 13:55:32,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 344 states have (on average 1.0494186046511629) internal successors, (361), 349 states have internal predecessors, (361), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 13:55:32,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 379 transitions. [2024-10-13 13:55:32,152 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 379 transitions. Word has length 199 [2024-10-13 13:55:32,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:55:32,153 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 379 transitions. [2024-10-13 13:55:32,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.0) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 13:55:32,153 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 379 transitions. [2024-10-13 13:55:32,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-13 13:55:32,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:55:32,154 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:55:32,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-13 13:55:32,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-13 13:55:32,355 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2024-10-13 13:55:32,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:55:32,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1769144768, now seen corresponding path program 2 times [2024-10-13 13:55:32,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:55:32,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923217458] [2024-10-13 13:55:32,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:55:32,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:55:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 13:55:32,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1916306870] [2024-10-13 13:55:32,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 13:55:32,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:55:32,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:55:32,381 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:55:32,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-13 13:55:32,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 13:55:32,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unknown [2024-10-13 13:55:32,473 WARN L124 FreeRefinementEngine]: Strategy CAMEL was unsuccessful and could not determine trace feasibility [2024-10-13 13:55:32,473 INFO L325 BasicCegarLoop]: Counterexample might be feasible [2024-10-13 13:55:32,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 84 remaining) [2024-10-13 13:55:32,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 84 remaining) [2024-10-13 13:55:32,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 84 remaining) [2024-10-13 13:55:32,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 84 remaining) [2024-10-13 13:55:32,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 84 remaining) [2024-10-13 13:55:32,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 84 remaining) [2024-10-13 13:55:32,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 84 remaining) [2024-10-13 13:55:32,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 84 remaining) [2024-10-13 13:55:32,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 84 remaining) [2024-10-13 13:55:32,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 84 remaining) [2024-10-13 13:55:32,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 84 remaining) [2024-10-13 13:55:32,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 84 remaining) [2024-10-13 13:55:32,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 84 remaining) [2024-10-13 13:55:32,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 84 remaining) [2024-10-13 13:55:32,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 84 remaining) [2024-10-13 13:55:32,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 84 remaining) [2024-10-13 13:55:32,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 84 remaining) [2024-10-13 13:55:32,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 84 remaining) [2024-10-13 13:55:32,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 84 remaining) [2024-10-13 13:55:32,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 84 remaining) [2024-10-13 13:55:32,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 84 remaining) [2024-10-13 13:55:32,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 84 remaining) [2024-10-13 13:55:32,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 84 remaining) [2024-10-13 13:55:32,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 84 remaining) [2024-10-13 13:55:32,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 84 remaining) [2024-10-13 13:55:32,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 84 remaining) [2024-10-13 13:55:32,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 84 remaining) [2024-10-13 13:55:32,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 84 remaining) [2024-10-13 13:55:32,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 84 remaining) [2024-10-13 13:55:32,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 84 remaining) [2024-10-13 13:55:32,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 84 remaining) [2024-10-13 13:55:32,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 84 remaining) [2024-10-13 13:55:32,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 84 remaining) [2024-10-13 13:55:32,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 84 remaining) [2024-10-13 13:55:32,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 84 remaining) [2024-10-13 13:55:32,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 84 remaining) [2024-10-13 13:55:32,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 84 remaining) [2024-10-13 13:55:32,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 84 remaining) [2024-10-13 13:55:32,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 84 remaining) [2024-10-13 13:55:32,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 84 remaining) [2024-10-13 13:55:32,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 84 remaining) [2024-10-13 13:55:32,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 84 remaining) [2024-10-13 13:55:32,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 84 remaining) [2024-10-13 13:55:32,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 84 remaining) [2024-10-13 13:55:32,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 84 remaining) [2024-10-13 13:55:32,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 84 remaining) [2024-10-13 13:55:32,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 84 remaining) [2024-10-13 13:55:32,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 84 remaining) [2024-10-13 13:55:32,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 84 remaining) [2024-10-13 13:55:32,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 84 remaining) [2024-10-13 13:55:32,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 84 remaining) [2024-10-13 13:55:32,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 84 remaining) [2024-10-13 13:55:32,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 84 remaining) [2024-10-13 13:55:32,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 84 remaining) [2024-10-13 13:55:32,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 84 remaining) [2024-10-13 13:55:32,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 84 remaining) [2024-10-13 13:55:32,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 84 remaining) [2024-10-13 13:55:32,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 84 remaining) [2024-10-13 13:55:32,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 84 remaining) [2024-10-13 13:55:32,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 84 remaining) [2024-10-13 13:55:32,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 84 remaining) [2024-10-13 13:55:32,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 84 remaining) [2024-10-13 13:55:32,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 84 remaining) [2024-10-13 13:55:32,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 84 remaining) [2024-10-13 13:55:32,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 84 remaining) [2024-10-13 13:55:32,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 84 remaining) [2024-10-13 13:55:32,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 84 remaining) [2024-10-13 13:55:32,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 84 remaining) [2024-10-13 13:55:32,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 84 remaining) [2024-10-13 13:55:32,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 84 remaining) [2024-10-13 13:55:32,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 84 remaining) [2024-10-13 13:55:32,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 84 remaining) [2024-10-13 13:55:32,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 84 remaining) [2024-10-13 13:55:32,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 84 remaining) [2024-10-13 13:55:32,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 84 remaining) [2024-10-13 13:55:32,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 84 remaining) [2024-10-13 13:55:32,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 84 remaining) [2024-10-13 13:55:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 84 remaining) [2024-10-13 13:55:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 84 remaining) [2024-10-13 13:55:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 84 remaining) [2024-10-13 13:55:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 84 remaining) [2024-10-13 13:55:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 84 remaining) [2024-10-13 13:55:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 84 remaining) [2024-10-13 13:55:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 84 remaining) [2024-10-13 13:55:32,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-10-13 13:55:32,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-13 13:55:32,702 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:55:32,733 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 13:55:32,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:55:32 BoogieIcfgContainer [2024-10-13 13:55:32,737 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 13:55:32,738 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 13:55:32,738 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 13:55:32,739 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 13:55:32,740 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:54:17" (3/4) ... [2024-10-13 13:55:32,742 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 13:55:32,743 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 13:55:32,744 INFO L158 Benchmark]: Toolchain (without parser) took 75832.62ms. Allocated memory was 182.5MB in the beginning and 245.4MB in the end (delta: 62.9MB). Free memory was 131.1MB in the beginning and 164.2MB in the end (delta: -33.1MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2024-10-13 13:55:32,744 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 182.5MB. Free memory is still 147.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:55:32,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.16ms. Allocated memory is still 182.5MB. Free memory was 131.1MB in the beginning and 118.2MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 13:55:32,745 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.97ms. Allocated memory is still 182.5MB. Free memory was 118.2MB in the beginning and 116.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:55:32,745 INFO L158 Benchmark]: Boogie Preprocessor took 40.22ms. Allocated memory is still 182.5MB. Free memory was 116.0MB in the beginning and 113.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:55:32,745 INFO L158 Benchmark]: RCFGBuilder took 662.79ms. Allocated memory is still 182.5MB. Free memory was 113.9MB in the beginning and 83.0MB in the end (delta: 31.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-13 13:55:32,745 INFO L158 Benchmark]: TraceAbstraction took 74791.86ms. Allocated memory was 182.5MB in the beginning and 245.4MB in the end (delta: 62.9MB). Free memory was 82.5MB in the beginning and 165.2MB in the end (delta: -82.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:55:32,745 INFO L158 Benchmark]: Witness Printer took 5.03ms. Allocated memory is still 245.4MB. Free memory was 165.2MB in the beginning and 164.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:55:32,746 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.91ms. Allocated memory is still 182.5MB. Free memory is still 147.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.16ms. Allocated memory is still 182.5MB. Free memory was 131.1MB in the beginning and 118.2MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.97ms. Allocated memory is still 182.5MB. Free memory was 118.2MB in the beginning and 116.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.22ms. Allocated memory is still 182.5MB. Free memory was 116.0MB in the beginning and 113.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 662.79ms. Allocated memory is still 182.5MB. Free memory was 113.9MB in the beginning and 83.0MB in the end (delta: 31.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 74791.86ms. Allocated memory was 182.5MB in the beginning and 245.4MB in the end (delta: 62.9MB). Free memory was 82.5MB in the beginning and 165.2MB in the end (delta: -82.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.03ms. Allocated memory is still 245.4MB. Free memory was 165.2MB in the beginning and 164.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L18] short k; [L19] long long y, x, c; [L20] k = __VERIFIER_nondet_short() [L21] CALL assume_abort_if_not(k>=0 && k<=5) [L7] COND FALSE !(!cond) [L21] RET assume_abort_if_not(k>=0 && k<=5) [L22] CALL assume_abort_if_not(k <= 256) [L7] COND FALSE !(!cond) [L22] RET assume_abort_if_not(k <= 256) [L24] y = 0 [L25] x = 0 [L26] c = 0 [L28] COND TRUE 1 [L29] EXPR 6*y [L29] EXPR 6*y*y [L29] EXPR 6*y*y*y [L29] EXPR 6*y*y*y*y [L29] EXPR 6*y*y*y*y*y [L29] EXPR 15*y [L29] EXPR 15*y*y [L29] EXPR 15*y*y*y [L29] EXPR 15*y*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y [L29] EXPR 10*y [L29] EXPR 10*y*y [L29] EXPR 10*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y [L29] EXPR 30*x [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y [L29] CALL __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L10] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L31] COND FALSE !(!(c < k)) [L34] EXPR c + 1 [L34] c = c + 1 [L35] EXPR y + 1 [L35] y = y + 1 [L36] EXPR y * y [L36] EXPR y * y * y [L36] EXPR y * y * y * y [L36] EXPR y * y * y * y + x [L36] x = y * y * y * y + x [L28] COND TRUE 1 [L29] EXPR 6*y [L29] EXPR 6*y*y [L29] EXPR 6*y*y*y [L29] EXPR 6*y*y*y*y [L29] EXPR 6*y*y*y*y*y [L29] EXPR 15*y [L29] EXPR 15*y*y [L29] EXPR 15*y*y*y [L29] EXPR 15*y*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y [L29] EXPR 10*y [L29] EXPR 10*y*y [L29] EXPR 10*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y [L29] EXPR 30*x [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y [L29] CALL __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L10] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L31] COND FALSE !(!(c < k)) [L34] EXPR c + 1 [L34] c = c + 1 [L35] EXPR y + 1 [L35] y = y + 1 [L36] EXPR y * y [L36] EXPR y * y * y [L36] EXPR y * y * y * y [L36] EXPR y * y * y * y + x [L36] x = y * y * y * y + x [L28] COND TRUE 1 [L29] EXPR 6*y [L29] EXPR 6*y*y [L29] EXPR 6*y*y*y [L29] EXPR 6*y*y*y*y [L29] EXPR 6*y*y*y*y*y [L29] EXPR 15*y [L29] EXPR 15*y*y [L29] EXPR 15*y*y*y [L29] EXPR 15*y*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y [L29] EXPR 10*y [L29] EXPR 10*y*y [L29] EXPR 10*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y [L29] EXPR 30*x [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y [L29] CALL __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L10] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L31] COND FALSE !(!(c < k)) [L34] EXPR c + 1 [L34] c = c + 1 [L35] EXPR y + 1 [L35] y = y + 1 [L36] EXPR y * y [L36] EXPR y * y * y [L36] EXPR y * y * y * y [L36] EXPR y * y * y * y + x [L36] x = y * y * y * y + x [L28] COND TRUE 1 [L29] EXPR 6*y [L29] EXPR 6*y*y [L29] EXPR 6*y*y*y [L29] EXPR 6*y*y*y*y [L29] EXPR 6*y*y*y*y*y [L29] EXPR 15*y [L29] EXPR 15*y*y [L29] EXPR 15*y*y*y [L29] EXPR 15*y*y*y*y [L29] EXPR 6*y*y*y*y*y + 15*y*y*y*y [L29] EXPR 10*y [L29] EXPR 10*y*y [L29] EXPR 10*y*y*y [L29] 6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y [L29] 30*x - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 187 locations, 84 error locations. Started 1 CEGAR loops. OverallTime: 74.7s, OverallIterations: 26, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 57.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 3032 SdHoareTripleChecker+Valid, 56.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2999 mSDsluCounter, 4886 SdHoareTripleChecker+Invalid, 55.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2789 mSDsCounter, 279 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8539 IncrementalHoareTripleChecker+Invalid, 8825 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 279 mSolverCounterUnsat, 2097 mSDtfsCounter, 8539 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3194 GetRequests, 3077 SyntacticMatches, 2 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=420occurred in iteration=24, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 421 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 5017 NumberOfCodeBlocks, 4866 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 3610 ConstructedInterpolants, 0 QuantifiedInterpolants, 27262 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2710 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 34 InterpolantComputations, 17 PerfectInterpolantSequences, 827/2021 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 13:55:32,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e14135f4afb726bf8552a88de51bf2d1eeb5945775070b599f71e8288a74bc87 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 13:55:34,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 13:55:34,997 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2024-10-13 13:55:35,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 13:55:35,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 13:55:35,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 13:55:35,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 13:55:35,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 13:55:35,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 13:55:35,045 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 13:55:35,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 13:55:35,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 13:55:35,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 13:55:35,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 13:55:35,049 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 13:55:35,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 13:55:35,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 13:55:35,051 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 13:55:35,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 13:55:35,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 13:55:35,055 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 13:55:35,055 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 13:55:35,056 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 13:55:35,056 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 13:55:35,056 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 13:55:35,056 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 13:55:35,057 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 13:55:35,057 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 13:55:35,057 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 13:55:35,057 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 13:55:35,057 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 13:55:35,058 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 13:55:35,058 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 13:55:35,058 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 13:55:35,058 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 13:55:35,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 13:55:35,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:55:35,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 13:55:35,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 13:55:35,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 13:55:35,061 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 13:55:35,062 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 13:55:35,062 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 13:55:35,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 13:55:35,063 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 13:55:35,063 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 13:55:35,063 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 13:55:35,063 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e14135f4afb726bf8552a88de51bf2d1eeb5945775070b599f71e8288a74bc87 [2024-10-13 13:55:35,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 13:55:35,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 13:55:35,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 13:55:35,429 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 13:55:35,430 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 13:55:35,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound5.c [2024-10-13 13:55:36,960 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 13:55:37,152 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 13:55:37,153 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound5.c [2024-10-13 13:55:37,163 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3c0d4d6f/84eac861066247bbbb01daac026ac9d4/FLAG36b88fc3e [2024-10-13 13:55:37,178 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3c0d4d6f/84eac861066247bbbb01daac026ac9d4 [2024-10-13 13:55:37,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 13:55:37,181 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 13:55:37,183 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 13:55:37,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 13:55:37,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 13:55:37,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:55:37" (1/1) ... [2024-10-13 13:55:37,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49434b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:37, skipping insertion in model container [2024-10-13 13:55:37,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:55:37" (1/1) ... [2024-10-13 13:55:37,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 13:55:37,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:55:37,447 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 13:55:37,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:55:37,495 INFO L204 MainTranslator]: Completed translation [2024-10-13 13:55:37,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:37 WrapperNode [2024-10-13 13:55:37,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 13:55:37,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 13:55:37,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 13:55:37,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 13:55:37,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:37" (1/1) ... [2024-10-13 13:55:37,514 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:37" (1/1) ... [2024-10-13 13:55:37,546 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 125 [2024-10-13 13:55:37,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 13:55:37,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 13:55:37,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 13:55:37,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 13:55:37,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:37" (1/1) ... [2024-10-13 13:55:37,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:37" (1/1) ... [2024-10-13 13:55:37,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:37" (1/1) ... [2024-10-13 13:55:37,586 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 13:55:37,586 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:37" (1/1) ... [2024-10-13 13:55:37,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:37" (1/1) ... [2024-10-13 13:55:37,597 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:37" (1/1) ... [2024-10-13 13:55:37,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:37" (1/1) ... [2024-10-13 13:55:37,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:37" (1/1) ... [2024-10-13 13:55:37,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:37" (1/1) ... [2024-10-13 13:55:37,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 13:55:37,615 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 13:55:37,615 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 13:55:37,615 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 13:55:37,616 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:55:37" (1/1) ... [2024-10-13 13:55:37,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:55:37,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:55:37,653 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 13:55:37,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 13:55:37,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 13:55:37,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 13:55:37,691 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 13:55:37,691 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 13:55:37,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 13:55:37,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 13:55:37,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 13:55:37,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 13:55:37,747 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 13:55:37,749 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation