./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_trans.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 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/loop-invgen/id_trans.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6aaead44d7f76ddac498383f5d9663622bc4506781697c14d3a4988231066e32 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:24:45,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:24:45,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 20:24:45,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:24:45,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:24:46,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:24:46,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:24:46,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:24:46,014 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:24:46,015 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:24:46,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:24:46,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:24:46,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:24:46,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:24:46,027 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:24:46,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:24:46,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:24:46,027 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 20:24:46,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:24:46,028 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 20:24:46,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:24:46,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:24:46,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:24:46,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:24:46,031 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:24:46,031 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:24:46,031 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:24:46,031 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 20:24:46,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:24:46,032 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:24:46,032 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:24:46,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:24:46,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:24:46,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:24:46,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:24:46,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:24:46,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:24:46,033 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:24:46,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:24:46,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:24:46,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:24:46,034 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:24:46,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:24:46,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:24:46,034 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 -> 6aaead44d7f76ddac498383f5d9663622bc4506781697c14d3a4988231066e32 [2024-10-14 20:24:46,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:24:46,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:24:46,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:24:46,247 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:24:46,247 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:24:46,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_trans.i [2024-10-14 20:24:47,421 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:24:47,545 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:24:47,546 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_trans.i [2024-10-14 20:24:47,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff9ee4deb/e75b62b3e31f428ca3de38f3e7316ae7/FLAG3a9a880b8 [2024-10-14 20:24:47,562 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff9ee4deb/e75b62b3e31f428ca3de38f3e7316ae7 [2024-10-14 20:24:47,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:24:47,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:24:47,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:24:47,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:24:47,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:24:47,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:24:47" (1/1) ... [2024-10-14 20:24:47,576 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@722bd219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:47, skipping insertion in model container [2024-10-14 20:24:47,576 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:24:47" (1/1) ... [2024-10-14 20:24:47,591 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:24:47,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:24:47,747 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:24:47,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:24:47,785 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:24:47,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:47 WrapperNode [2024-10-14 20:24:47,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:24:47,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:24:47,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:24:47,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:24:47,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:47" (1/1) ... [2024-10-14 20:24:47,808 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:47" (1/1) ... [2024-10-14 20:24:47,828 INFO L138 Inliner]: procedures = 16, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2024-10-14 20:24:47,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:24:47,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:24:47,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:24:47,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:24:47,837 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:47" (1/1) ... [2024-10-14 20:24:47,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:47" (1/1) ... [2024-10-14 20:24:47,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:47" (1/1) ... [2024-10-14 20:24:47,849 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-14 20:24:47,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:47" (1/1) ... [2024-10-14 20:24:47,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:47" (1/1) ... [2024-10-14 20:24:47,852 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:47" (1/1) ... [2024-10-14 20:24:47,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:47" (1/1) ... [2024-10-14 20:24:47,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:47" (1/1) ... [2024-10-14 20:24:47,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:47" (1/1) ... [2024-10-14 20:24:47,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:24:47,857 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:24:47,858 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:24:47,858 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:24:47,858 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:47" (1/1) ... [2024-10-14 20:24:47,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:24:47,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:24:47,890 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-14 20:24:47,892 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-14 20:24:47,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 20:24:47,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 20:24:47,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:24:47,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:24:47,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 20:24:47,927 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 20:24:47,977 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:24:47,979 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:24:48,144 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-14 20:24:48,144 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:24:48,169 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:24:48,172 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 20:24:48,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:24:48 BoogieIcfgContainer [2024-10-14 20:24:48,172 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:24:48,174 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:24:48,175 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:24:48,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:24:48,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:24:47" (1/3) ... [2024-10-14 20:24:48,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e169b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:24:48, skipping insertion in model container [2024-10-14 20:24:48,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:47" (2/3) ... [2024-10-14 20:24:48,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e169b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:24:48, skipping insertion in model container [2024-10-14 20:24:48,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:24:48" (3/3) ... [2024-10-14 20:24:48,181 INFO L112 eAbstractionObserver]: Analyzing ICFG id_trans.i [2024-10-14 20:24:48,193 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:24:48,194 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-10-14 20:24:48,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:24:48,241 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;@2d151df4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:24:48,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-14 20:24:48,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 31 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:24:48,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 20:24:48,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:24:48,252 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 20:24:48,253 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-14 20:24:48,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:24:48,257 INFO L85 PathProgramCache]: Analyzing trace with hash 3258, now seen corresponding path program 1 times [2024-10-14 20:24:48,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:24:48,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658131379] [2024-10-14 20:24:48,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:48,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:24:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:48,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:24:48,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:24:48,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658131379] [2024-10-14 20:24:48,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658131379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:24:48,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:24:48,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 20:24:48,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335804671] [2024-10-14 20:24:48,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:24:48,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:24:48,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:24:48,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:24:48,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:24:48,449 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 31 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:24:48,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:24:48,498 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2024-10-14 20:24:48,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:24:48,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-14 20:24:48,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:24:48,505 INFO L225 Difference]: With dead ends: 66 [2024-10-14 20:24:48,505 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 20:24:48,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-14 20:24:48,509 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:24:48,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:24:48,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 20:24:48,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-14 20:24:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 24 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:24:48,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-10-14 20:24:48,540 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 2 [2024-10-14 20:24:48,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:24:48,541 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-10-14 20:24:48,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:24:48,541 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-10-14 20:24:48,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 20:24:48,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:24:48,542 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 20:24:48,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:24:48,542 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-14 20:24:48,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:24:48,543 INFO L85 PathProgramCache]: Analyzing trace with hash 101034, now seen corresponding path program 1 times [2024-10-14 20:24:48,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:24:48,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651320553] [2024-10-14 20:24:48,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:48,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:24:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:48,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:24:48,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:24:48,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651320553] [2024-10-14 20:24:48,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651320553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:24:48,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:24:48,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:24:48,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211767316] [2024-10-14 20:24:48,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:24:48,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:24:48,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:24:48,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:24:48,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:24:48,646 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:24:48,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:24:48,669 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-10-14 20:24:48,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:24:48,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-14 20:24:48,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:24:48,670 INFO L225 Difference]: With dead ends: 30 [2024-10-14 20:24:48,670 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 20:24:48,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-14 20:24:48,671 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:24:48,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 38 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:24:48,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 20:24:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-14 20:24:48,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:24:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-10-14 20:24:48,680 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 3 [2024-10-14 20:24:48,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:24:48,680 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-10-14 20:24:48,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:24:48,680 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-10-14 20:24:48,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 20:24:48,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:24:48,681 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:24:48,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 20:24:48,681 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-14 20:24:48,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:24:48,682 INFO L85 PathProgramCache]: Analyzing trace with hash -310213727, now seen corresponding path program 1 times [2024-10-14 20:24:48,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:24:48,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446912183] [2024-10-14 20:24:48,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:48,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:24:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:48,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:24:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:48,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 20:24:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:48,834 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-14 20:24:48,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:24:48,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446912183] [2024-10-14 20:24:48,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446912183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:24:48,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:24:48,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:24:48,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405689207] [2024-10-14 20:24:48,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:24:48,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:24:48,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:24:48,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:24:48,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:24:48,839 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-14 20:24:48,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:24:48,877 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-10-14 20:24:48,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:24:48,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 18 [2024-10-14 20:24:48,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:24:48,882 INFO L225 Difference]: With dead ends: 44 [2024-10-14 20:24:48,882 INFO L226 Difference]: Without dead ends: 40 [2024-10-14 20:24:48,883 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-14 20:24:48,884 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:24:48,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 42 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:24:48,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-14 20:24:48,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-10-14 20:24:48,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 29 states have internal predecessors, (30), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 20:24:48,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-10-14 20:24:48,898 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 18 [2024-10-14 20:24:48,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:24:48,900 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-10-14 20:24:48,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-14 20:24:48,900 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-10-14 20:24:48,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 20:24:48,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:24:48,902 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:24:48,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 20:24:48,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-14 20:24:48,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:24:48,903 INFO L85 PathProgramCache]: Analyzing trace with hash 406570142, now seen corresponding path program 1 times [2024-10-14 20:24:48,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:24:48,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015006891] [2024-10-14 20:24:48,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:48,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:24:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:49,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:24:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:49,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 20:24:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:49,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 20:24:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:49,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 20:24:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:49,096 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 20:24:49,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:24:49,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015006891] [2024-10-14 20:24:49,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015006891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:24:49,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:24:49,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:24:49,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964104695] [2024-10-14 20:24:49,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:24:49,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:24:49,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:24:49,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:24:49,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:24:49,100 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 20:24:49,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:24:49,149 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-10-14 20:24:49,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:24:49,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2024-10-14 20:24:49,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:24:49,150 INFO L225 Difference]: With dead ends: 44 [2024-10-14 20:24:49,150 INFO L226 Difference]: Without dead ends: 42 [2024-10-14 20:24:49,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-14 20:24:49,151 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:24:49,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 59 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:24:49,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-14 20:24:49,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-14 20:24:49,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 32 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 20:24:49,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2024-10-14 20:24:49,158 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 33 [2024-10-14 20:24:49,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:24:49,158 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2024-10-14 20:24:49,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 20:24:49,158 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2024-10-14 20:24:49,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-14 20:24:49,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:24:49,161 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:24:49,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 20:24:49,161 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-14 20:24:49,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:24:49,162 INFO L85 PathProgramCache]: Analyzing trace with hash 455939787, now seen corresponding path program 1 times [2024-10-14 20:24:49,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:24:49,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694220707] [2024-10-14 20:24:49,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:49,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:24:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:49,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:24:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:49,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 20:24:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:49,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 20:24:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:49,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 20:24:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:49,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 20:24:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:49,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 20:24:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:49,329 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 20:24:49,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:24:49,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694220707] [2024-10-14 20:24:49,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694220707] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:24:49,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657074547] [2024-10-14 20:24:49,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:49,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:24:49,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:24:49,334 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-14 20:24:49,335 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-14 20:24:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:49,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:24:49,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:24:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 20:24:49,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:24:49,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657074547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:24:49,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:24:49,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-14 20:24:49,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886134247] [2024-10-14 20:24:49,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:24:49,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:24:49,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:24:49,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:24:49,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:24:49,471 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 20:24:49,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:24:49,545 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-10-14 20:24:49,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:24:49,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2024-10-14 20:24:49,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:24:49,547 INFO L225 Difference]: With dead ends: 42 [2024-10-14 20:24:49,547 INFO L226 Difference]: Without dead ends: 39 [2024-10-14 20:24:49,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:24:49,548 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:24:49,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 80 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:24:49,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-14 20:24:49,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-14 20:24:49,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 29 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 20:24:49,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-10-14 20:24:49,560 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 48 [2024-10-14 20:24:49,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:24:49,562 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-10-14 20:24:49,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 20:24:49,562 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2024-10-14 20:24:49,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 20:24:49,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:24:49,563 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:24:49,583 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-14 20:24:49,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:24:49,764 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-14 20:24:49,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:24:49,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1249231568, now seen corresponding path program 1 times [2024-10-14 20:24:49,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:24:49,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160610742] [2024-10-14 20:24:49,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:49,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:24:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:49,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:24:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:49,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 20:24:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:49,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 20:24:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:49,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 20:24:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:49,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 20:24:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:49,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 20:24:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 20:24:49,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:24:49,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160610742] [2024-10-14 20:24:49,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160610742] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:24:49,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998319988] [2024-10-14 20:24:49,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:49,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:24:49,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:24:49,914 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-14 20:24:49,917 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-14 20:24:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:49,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 20:24:49,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:24:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 20:24:50,005 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:24:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 20:24:50,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998319988] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:24:50,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:24:50,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2024-10-14 20:24:50,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043047893] [2024-10-14 20:24:50,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:24:50,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 20:24:50,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:24:50,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 20:24:50,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-14 20:24:50,202 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-10-14 20:24:50,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:24:50,297 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2024-10-14 20:24:50,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 20:24:50,298 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 49 [2024-10-14 20:24:50,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:24:50,300 INFO L225 Difference]: With dead ends: 51 [2024-10-14 20:24:50,300 INFO L226 Difference]: Without dead ends: 49 [2024-10-14 20:24:50,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-14 20:24:50,301 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:24:50,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 125 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:24:50,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-14 20:24:50,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2024-10-14 20:24:50,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 20:24:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2024-10-14 20:24:50,307 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 49 [2024-10-14 20:24:50,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:24:50,307 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2024-10-14 20:24:50,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-10-14 20:24:50,307 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2024-10-14 20:24:50,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 20:24:50,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:24:50,309 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-14 20:24:50,320 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-14 20:24:50,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 20:24:50,510 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-14 20:24:50,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:24:50,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1329581715, now seen corresponding path program 1 times [2024-10-14 20:24:50,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:24:50,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908464366] [2024-10-14 20:24:50,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:50,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:24:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:50,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:24:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:50,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 20:24:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:50,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 20:24:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:50,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 20:24:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:50,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 20:24:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:50,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 20:24:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:50,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 20:24:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:50,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 20:24:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 20:24:50,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:24:50,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908464366] [2024-10-14 20:24:50,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908464366] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:24:50,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570879940] [2024-10-14 20:24:50,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:50,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:24:50,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:24:50,654 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-14 20:24:50,655 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-14 20:24:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:50,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 20:24:50,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:24:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 20:24:50,747 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:24:50,845 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 20:24:50,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570879940] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:24:50,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:24:50,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-14 20:24:50,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462065868] [2024-10-14 20:24:50,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:24:50,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 20:24:50,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:24:50,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 20:24:50,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-14 20:24:50,848 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2024-10-14 20:24:50,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:24:50,937 INFO L93 Difference]: Finished difference Result 80 states and 101 transitions. [2024-10-14 20:24:50,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 20:24:50,938 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 64 [2024-10-14 20:24:50,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:24:50,939 INFO L225 Difference]: With dead ends: 80 [2024-10-14 20:24:50,939 INFO L226 Difference]: Without dead ends: 79 [2024-10-14 20:24:50,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-14 20:24:50,940 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:24:50,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:24:50,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-14 20:24:50,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-14 20:24:50,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 20:24:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2024-10-14 20:24:50,953 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 64 [2024-10-14 20:24:50,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:24:50,953 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2024-10-14 20:24:50,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2024-10-14 20:24:50,954 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2024-10-14 20:24:50,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-14 20:24:50,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:24:50,959 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2024-10-14 20:24:50,971 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-14 20:24:51,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:24:51,160 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-14 20:24:51,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:24:51,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1129245457, now seen corresponding path program 2 times [2024-10-14 20:24:51,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:24:51,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77636138] [2024-10-14 20:24:51,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:51,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:24:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:51,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:24:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:51,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 20:24:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:51,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 20:24:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:51,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 20:24:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:51,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 20:24:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:51,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 20:24:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:51,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 20:24:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:51,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 20:24:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:51,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 20:24:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:51,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 20:24:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:51,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 20:24:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:51,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 20:24:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:51,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 20:24:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:51,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 20:24:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:51,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 20:24:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:51,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 20:24:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:51,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 20:24:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:51,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 20:24:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:51,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 20:24:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:51,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 20:24:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:51,489 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 20:24:51,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:24:51,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77636138] [2024-10-14 20:24:51,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77636138] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:24:51,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316450145] [2024-10-14 20:24:51,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 20:24:51,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:24:51,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:24:51,491 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-14 20:24:51,492 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-14 20:24:51,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 20:24:51,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:24:51,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:24:51,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:24:51,655 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 856 trivial. 0 not checked. [2024-10-14 20:24:51,655 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:24:51,791 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 856 trivial. 0 not checked. [2024-10-14 20:24:51,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316450145] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:24:51,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:24:51,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2024-10-14 20:24:51,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174763191] [2024-10-14 20:24:51,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:24:51,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 20:24:51,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:24:51,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 20:24:51,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-10-14 20:24:51,793 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand has 15 states, 14 states have (on average 5.642857142857143) internal successors, (79), 15 states have internal predecessors, (79), 7 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) [2024-10-14 20:24:51,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:24:51,990 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2024-10-14 20:24:51,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 20:24:51,990 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.642857142857143) internal successors, (79), 15 states have internal predecessors, (79), 7 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) Word has length 154 [2024-10-14 20:24:51,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:24:51,991 INFO L225 Difference]: With dead ends: 96 [2024-10-14 20:24:51,991 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 20:24:51,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 342 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2024-10-14 20:24:51,993 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:24:51,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 108 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:24:51,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 20:24:51,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 20:24:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:24:51,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 20:24:51,994 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 154 [2024-10-14 20:24:51,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:24:51,994 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 20:24:51,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.642857142857143) internal successors, (79), 15 states have internal predecessors, (79), 7 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) [2024-10-14 20:24:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 20:24:51,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 20:24:51,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2024-10-14 20:24:51,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2024-10-14 20:24:51,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2024-10-14 20:24:51,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2024-10-14 20:24:51,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2024-10-14 20:24:51,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2024-10-14 20:24:51,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2024-10-14 20:24:51,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2024-10-14 20:24:51,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2024-10-14 20:24:51,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2024-10-14 20:24:52,009 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-14 20:24:52,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:24:52,201 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-10-14 20:24:52,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 20:24:52,571 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 20:24:52,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:24:52 BoogieIcfgContainer [2024-10-14 20:24:52,583 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 20:24:52,584 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 20:24:52,584 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 20:24:52,584 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 20:24:52,584 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:24:48" (3/4) ... [2024-10-14 20:24:52,585 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 20:24:52,588 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-14 20:24:52,590 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-14 20:24:52,590 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-14 20:24:52,590 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 20:24:52,591 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 20:24:52,663 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 20:24:52,664 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 20:24:52,664 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 20:24:52,664 INFO L158 Benchmark]: Toolchain (without parser) took 5099.23ms. Allocated memory was 142.6MB in the beginning and 232.8MB in the end (delta: 90.2MB). Free memory was 72.1MB in the beginning and 185.8MB in the end (delta: -113.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:24:52,664 INFO L158 Benchmark]: CDTParser took 1.21ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 109.3MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:24:52,665 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.59ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 71.9MB in the beginning and 161.9MB in the end (delta: -90.0MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-10-14 20:24:52,668 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.89ms. Allocated memory is still 192.9MB. Free memory was 161.8MB in the beginning and 163.5MB in the end (delta: -1.7MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-10-14 20:24:52,668 INFO L158 Benchmark]: Boogie Preprocessor took 27.66ms. Allocated memory is still 192.9MB. Free memory was 163.5MB in the beginning and 161.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:24:52,668 INFO L158 Benchmark]: RCFGBuilder took 314.89ms. Allocated memory is still 192.9MB. Free memory was 161.4MB in the beginning and 146.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 20:24:52,669 INFO L158 Benchmark]: TraceAbstraction took 4409.27ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 146.8MB in the beginning and 190.0MB in the end (delta: -43.3MB). Peak memory consumption was 120.0MB. Max. memory is 16.1GB. [2024-10-14 20:24:52,669 INFO L158 Benchmark]: Witness Printer took 80.27ms. Allocated memory is still 232.8MB. Free memory was 190.0MB in the beginning and 185.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 20:24:52,670 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.21ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 109.3MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.59ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 71.9MB in the beginning and 161.9MB in the end (delta: -90.0MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.89ms. Allocated memory is still 192.9MB. Free memory was 161.8MB in the beginning and 163.5MB in the end (delta: -1.7MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.66ms. Allocated memory is still 192.9MB. Free memory was 163.5MB in the beginning and 161.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 314.89ms. Allocated memory is still 192.9MB. Free memory was 161.4MB in the beginning and 146.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4409.27ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 146.8MB in the beginning and 190.0MB in the end (delta: -43.3MB). Peak memory consumption was 120.0MB. Max. memory is 16.1GB. * Witness Printer took 80.27ms. Allocated memory is still 232.8MB. Free memory was 190.0MB in the beginning and 185.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 8, TraceHistogramMax: 20, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 556 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 376 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 407 IncrementalHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 180 mSDtfsCounter, 407 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 712 GetRequests, 656 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=7, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 686 NumberOfCodeBlocks, 547 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 938 ConstructedInterpolants, 0 QuantifiedInterpolants, 2024 SizeOfPredicates, 2 NumberOfNonLiveVariables, 378 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 3142/3439 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((0 <= (idBitLength + 2147483648)) && (material_length <= 2147483647)) && (idBitLength <= 2147483647)) && (j == 0)) || (((((((((long long) j + 1) / 4) == 2147483647) || ((((long long) j + 1) / 4) < 2147483647)) && (1 <= j)) && (0 <= (idBitLength + 2147483648))) && (material_length <= 2147483647)) && (idBitLength <= 2147483647))) RESULT: Ultimate proved your program to be correct! [2024-10-14 20:24:52,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE