./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_11_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_11_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 56b373903b2fb78e1361275930d44ce26bef4332952986c71b6f099bb3c414bc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 23:16:41,614 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 23:16:41,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-14 23:16:41,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 23:16:41,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 23:16:41,695 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 23:16:41,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 23:16:41,698 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 23:16:41,698 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 23:16:41,699 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 23:16:41,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 23:16:41,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 23:16:41,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 23:16:41,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 23:16:41,701 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 23:16:41,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 23:16:41,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 23:16:41,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 23:16:41,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 23:16:41,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 23:16:41,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 23:16:41,708 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 23:16:41,708 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 23:16:41,708 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 23:16:41,708 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 23:16:41,709 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 23:16:41,709 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 23:16:41,709 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 23:16:41,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 23:16:41,709 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 23:16:41,709 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 23:16:41,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 23:16:41,710 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 23:16:41,710 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 23:16:41,710 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 23:16:41,710 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 23:16:41,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 23:16:41,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 23:16:41,711 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 23:16:41,711 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 23:16:41,711 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 23:16:41,711 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 56b373903b2fb78e1361275930d44ce26bef4332952986c71b6f099bb3c414bc [2024-10-14 23:16:41,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 23:16:41,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 23:16:41,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 23:16:41,947 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 23:16:41,947 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 23:16:41,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_11_good.i [2024-10-14 23:16:43,228 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 23:16:43,475 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 23:16:43,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_11_good.i [2024-10-14 23:16:43,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/916d81f89/a5d8f1be99314b9b9056a201dc6418f2/FLAG4abcc4357 [2024-10-14 23:16:43,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/916d81f89/a5d8f1be99314b9b9056a201dc6418f2 [2024-10-14 23:16:43,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 23:16:43,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 23:16:43,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 23:16:43,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 23:16:43,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 23:16:43,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:16:43" (1/1) ... [2024-10-14 23:16:43,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18a549f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:43, skipping insertion in model container [2024-10-14 23:16:43,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:16:43" (1/1) ... [2024-10-14 23:16:43,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 23:16:44,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 23:16:44,163 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 23:16:44,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 23:16:44,426 INFO L204 MainTranslator]: Completed translation [2024-10-14 23:16:44,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:44 WrapperNode [2024-10-14 23:16:44,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 23:16:44,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 23:16:44,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 23:16:44,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 23:16:44,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:44" (1/1) ... [2024-10-14 23:16:44,450 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:44" (1/1) ... [2024-10-14 23:16:44,476 INFO L138 Inliner]: procedures = 501, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 249 [2024-10-14 23:16:44,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 23:16:44,477 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 23:16:44,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 23:16:44,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 23:16:44,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:44" (1/1) ... [2024-10-14 23:16:44,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:44" (1/1) ... [2024-10-14 23:16:44,489 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:44" (1/1) ... [2024-10-14 23:16:44,502 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-14 23:16:44,502 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:44" (1/1) ... [2024-10-14 23:16:44,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:44" (1/1) ... [2024-10-14 23:16:44,507 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:44" (1/1) ... [2024-10-14 23:16:44,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:44" (1/1) ... [2024-10-14 23:16:44,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:44" (1/1) ... [2024-10-14 23:16:44,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:44" (1/1) ... [2024-10-14 23:16:44,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 23:16:44,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 23:16:44,524 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 23:16:44,524 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 23:16:44,525 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:44" (1/1) ... [2024-10-14 23:16:44,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 23:16:44,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 23:16:44,551 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 23:16:44,554 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 23:16:44,596 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-14 23:16:44,596 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-14 23:16:44,596 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-14 23:16:44,596 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-14 23:16:44,596 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2024-10-14 23:16:44,597 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2024-10-14 23:16:44,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 23:16:44,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 23:16:44,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 23:16:44,597 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsFalse [2024-10-14 23:16:44,597 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsFalse [2024-10-14 23:16:44,725 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 23:16:44,727 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 23:16:45,052 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2024-10-14 23:16:45,052 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 23:16:45,087 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 23:16:45,087 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 23:16:45,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:16:45 BoogieIcfgContainer [2024-10-14 23:16:45,088 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 23:16:45,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 23:16:45,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 23:16:45,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 23:16:45,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:16:43" (1/3) ... [2024-10-14 23:16:45,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19677556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:16:45, skipping insertion in model container [2024-10-14 23:16:45,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:16:44" (2/3) ... [2024-10-14 23:16:45,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19677556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:16:45, skipping insertion in model container [2024-10-14 23:16:45,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:16:45" (3/3) ... [2024-10-14 23:16:45,095 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_postdec_11_good.i [2024-10-14 23:16:45,114 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 23:16:45,114 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-14 23:16:45,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 23:16:45,171 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;@2f675aab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 23:16:45,171 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-14 23:16:45,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 99 states have internal predecessors, (136), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 23:16:45,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 23:16:45,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:16:45,184 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:16:45,185 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 23:16:45,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:16:45,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1336767886, now seen corresponding path program 1 times [2024-10-14 23:16:45,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:16:45,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993758687] [2024-10-14 23:16:45,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:16:45,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:16:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:45,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:16:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:45,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 23:16:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:45,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 23:16:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:45,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:16:45,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:16:45,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993758687] [2024-10-14 23:16:45,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993758687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:16:45,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:16:45,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 23:16:45,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096687872] [2024-10-14 23:16:45,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:16:45,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 23:16:45,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:16:45,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 23:16:45,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 23:16:45,579 INFO L87 Difference]: Start difference. First operand has 122 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 99 states have internal predecessors, (136), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 23:16:45,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:16:45,649 INFO L93 Difference]: Finished difference Result 216 states and 300 transitions. [2024-10-14 23:16:45,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 23:16:45,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-10-14 23:16:45,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:16:45,658 INFO L225 Difference]: With dead ends: 216 [2024-10-14 23:16:45,658 INFO L226 Difference]: Without dead ends: 116 [2024-10-14 23:16:45,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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 23:16:45,664 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:16:45,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 486 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:16:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-14 23:16:45,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-14 23:16:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 95 states have internal predecessors, (130), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 23:16:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2024-10-14 23:16:45,712 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 162 transitions. Word has length 19 [2024-10-14 23:16:45,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:16:45,714 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 162 transitions. [2024-10-14 23:16:45,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 23:16:45,715 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2024-10-14 23:16:45,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 23:16:45,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:16:45,717 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:16:45,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 23:16:45,717 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 23:16:45,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:16:45,718 INFO L85 PathProgramCache]: Analyzing trace with hash 381343541, now seen corresponding path program 1 times [2024-10-14 23:16:45,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:16:45,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109853324] [2024-10-14 23:16:45,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:16:45,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:16:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:45,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:16:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:45,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 23:16:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:45,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 23:16:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:45,835 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 23:16:45,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:16:45,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109853324] [2024-10-14 23:16:45,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109853324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:16:45,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:16:45,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 23:16:45,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074192837] [2024-10-14 23:16:45,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:16:45,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 23:16:45,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:16:45,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 23:16:45,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 23:16:45,839 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 23:16:45,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:16:45,869 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2024-10-14 23:16:45,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 23:16:45,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-10-14 23:16:45,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:16:45,871 INFO L225 Difference]: With dead ends: 116 [2024-10-14 23:16:45,872 INFO L226 Difference]: Without dead ends: 115 [2024-10-14 23:16:45,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 23:16:45,873 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:16:45,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 305 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:16:45,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-14 23:16:45,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-14 23:16:45,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.4659090909090908) internal successors, (129), 94 states have internal predecessors, (129), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 23:16:45,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2024-10-14 23:16:45,885 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 25 [2024-10-14 23:16:45,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:16:45,886 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2024-10-14 23:16:45,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 23:16:45,886 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2024-10-14 23:16:45,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 23:16:45,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:16:45,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:16:45,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 23:16:45,888 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 23:16:45,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:16:45,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1063251968, now seen corresponding path program 1 times [2024-10-14 23:16:45,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:16:45,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502901105] [2024-10-14 23:16:45,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:16:45,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:16:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:16:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 23:16:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 23:16:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,020 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 23:16:46,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:16:46,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502901105] [2024-10-14 23:16:46,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502901105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:16:46,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:16:46,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 23:16:46,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537648051] [2024-10-14 23:16:46,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:16:46,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 23:16:46,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:16:46,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 23:16:46,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 23:16:46,024 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 23:16:46,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:16:46,077 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2024-10-14 23:16:46,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 23:16:46,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-10-14 23:16:46,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:16:46,079 INFO L225 Difference]: With dead ends: 116 [2024-10-14 23:16:46,079 INFO L226 Difference]: Without dead ends: 115 [2024-10-14 23:16:46,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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 23:16:46,080 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 38 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:16:46,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 409 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:16:46,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-14 23:16:46,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-10-14 23:16:46,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 93 states have internal predecessors, (128), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 23:16:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2024-10-14 23:16:46,090 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 26 [2024-10-14 23:16:46,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:16:46,091 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2024-10-14 23:16:46,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 23:16:46,091 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2024-10-14 23:16:46,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 23:16:46,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:16:46,092 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:16:46,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 23:16:46,092 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 23:16:46,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:16:46,093 INFO L85 PathProgramCache]: Analyzing trace with hash -643721588, now seen corresponding path program 1 times [2024-10-14 23:16:46,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:16:46,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345640] [2024-10-14 23:16:46,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:16:46,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:16:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:16:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 23:16:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 23:16:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 23:16:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 23:16:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 23:16:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 23:16:46,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:16:46,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345640] [2024-10-14 23:16:46,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:16:46,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:16:46,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 23:16:46,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238042107] [2024-10-14 23:16:46,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:16:46,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 23:16:46,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:16:46,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 23:16:46,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 23:16:46,190 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 23:16:46,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:16:46,226 INFO L93 Difference]: Finished difference Result 188 states and 259 transitions. [2024-10-14 23:16:46,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 23:16:46,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2024-10-14 23:16:46,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:16:46,228 INFO L225 Difference]: With dead ends: 188 [2024-10-14 23:16:46,228 INFO L226 Difference]: Without dead ends: 112 [2024-10-14 23:16:46,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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 23:16:46,229 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:16:46,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 447 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:16:46,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-14 23:16:46,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-14 23:16:46,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 92 states have internal predecessors, (126), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 23:16:46,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2024-10-14 23:16:46,243 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 42 [2024-10-14 23:16:46,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:16:46,244 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2024-10-14 23:16:46,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 23:16:46,244 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2024-10-14 23:16:46,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 23:16:46,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:16:46,245 INFO L215 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:16:46,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 23:16:46,245 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 23:16:46,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:16:46,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1268274132, now seen corresponding path program 1 times [2024-10-14 23:16:46,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:16:46,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199564927] [2024-10-14 23:16:46,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:16:46,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:16:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:16:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 23:16:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 23:16:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 23:16:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 23:16:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 23:16:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 23:16:46,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:16:46,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199564927] [2024-10-14 23:16:46,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199564927] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 23:16:46,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282552189] [2024-10-14 23:16:46,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:16:46,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 23:16:46,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 23:16:46,350 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 23:16:46,353 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 23:16:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 23:16:46,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 23:16:46,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 23:16:46,477 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 23:16:46,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282552189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:16:46,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 23:16:46,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-14 23:16:46,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858180485] [2024-10-14 23:16:46,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:16:46,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 23:16:46,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:16:46,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 23:16:46,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 23:16:46,478 INFO L87 Difference]: Start difference. First operand 112 states and 156 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 23:16:46,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:16:46,506 INFO L93 Difference]: Finished difference Result 160 states and 214 transitions. [2024-10-14 23:16:46,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 23:16:46,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2024-10-14 23:16:46,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:16:46,510 INFO L225 Difference]: With dead ends: 160 [2024-10-14 23:16:46,510 INFO L226 Difference]: Without dead ends: 112 [2024-10-14 23:16:46,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 23:16:46,512 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:16:46,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 444 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:16:46,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-14 23:16:46,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-14 23:16:46,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 92 states have internal predecessors, (125), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 23:16:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 155 transitions. [2024-10-14 23:16:46,528 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 155 transitions. Word has length 43 [2024-10-14 23:16:46,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:16:46,529 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 155 transitions. [2024-10-14 23:16:46,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 23:16:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 155 transitions. [2024-10-14 23:16:46,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 23:16:46,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:16:46,530 INFO L215 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:16:46,544 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 23:16:46,730 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 23:16:46,731 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 23:16:46,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:16:46,732 INFO L85 PathProgramCache]: Analyzing trace with hash 68894543, now seen corresponding path program 1 times [2024-10-14 23:16:46,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:16:46,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055965185] [2024-10-14 23:16:46,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:16:46,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:16:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:16:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 23:16:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 23:16:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 23:16:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 23:16:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 23:16:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 23:16:46,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:16:46,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055965185] [2024-10-14 23:16:46,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055965185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:16:46,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:16:46,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 23:16:46,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164179849] [2024-10-14 23:16:46,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:16:46,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 23:16:46,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:16:46,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 23:16:46,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 23:16:46,823 INFO L87 Difference]: Start difference. First operand 112 states and 155 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 23:16:46,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:16:46,838 INFO L93 Difference]: Finished difference Result 112 states and 155 transitions. [2024-10-14 23:16:46,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 23:16:46,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2024-10-14 23:16:46,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:16:46,839 INFO L225 Difference]: With dead ends: 112 [2024-10-14 23:16:46,839 INFO L226 Difference]: Without dead ends: 111 [2024-10-14 23:16:46,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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 23:16:46,840 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:16:46,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 291 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:16:46,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-14 23:16:46,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-14 23:16:46,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 91 states have internal predecessors, (124), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 23:16:46,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 154 transitions. [2024-10-14 23:16:46,845 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 154 transitions. Word has length 49 [2024-10-14 23:16:46,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:16:46,846 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 154 transitions. [2024-10-14 23:16:46,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 23:16:46,846 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 154 transitions. [2024-10-14 23:16:46,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 23:16:46,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:16:46,847 INFO L215 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:16:46,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 23:16:46,847 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 23:16:46,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:16:46,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2135731089, now seen corresponding path program 1 times [2024-10-14 23:16:46,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:16:46,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777878163] [2024-10-14 23:16:46,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:16:46,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:16:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:16:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 23:16:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 23:16:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 23:16:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 23:16:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 23:16:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:46,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 23:16:46,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:16:46,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777878163] [2024-10-14 23:16:46,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777878163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:16:46,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:16:46,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 23:16:46,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852320411] [2024-10-14 23:16:46,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:16:46,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 23:16:46,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:16:46,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 23:16:46,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 23:16:46,963 INFO L87 Difference]: Start difference. First operand 111 states and 154 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 23:16:46,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:16:46,993 INFO L93 Difference]: Finished difference Result 112 states and 155 transitions. [2024-10-14 23:16:46,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 23:16:46,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 50 [2024-10-14 23:16:46,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:16:46,995 INFO L225 Difference]: With dead ends: 112 [2024-10-14 23:16:46,995 INFO L226 Difference]: Without dead ends: 111 [2024-10-14 23:16:46,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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 23:16:46,996 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 37 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:16:46,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 389 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:16:46,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-14 23:16:47,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-10-14 23:16:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 90 states have internal predecessors, (123), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 23:16:47,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 153 transitions. [2024-10-14 23:16:47,001 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 153 transitions. Word has length 50 [2024-10-14 23:16:47,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:16:47,001 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 153 transitions. [2024-10-14 23:16:47,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 23:16:47,002 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 153 transitions. [2024-10-14 23:16:47,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 23:16:47,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:16:47,003 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:16:47,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 23:16:47,003 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 23:16:47,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:16:47,003 INFO L85 PathProgramCache]: Analyzing trace with hash -636143760, now seen corresponding path program 1 times [2024-10-14 23:16:47,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:16:47,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187643907] [2024-10-14 23:16:47,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:16:47,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:16:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:16:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 23:16:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 23:16:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 23:16:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 23:16:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 23:16:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 23:16:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 23:16:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,084 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 23:16:47,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:16:47,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187643907] [2024-10-14 23:16:47,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187643907] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 23:16:47,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183250951] [2024-10-14 23:16:47,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:16:47,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 23:16:47,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 23:16:47,086 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 23:16:47,088 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 23:16:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 23:16:47,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 23:16:47,198 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 23:16:47,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 23:16:47,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183250951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:16:47,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 23:16:47,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-14 23:16:47,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092447771] [2024-10-14 23:16:47,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:16:47,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 23:16:47,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:16:47,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 23:16:47,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 23:16:47,202 INFO L87 Difference]: Start difference. First operand 110 states and 153 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 23:16:47,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:16:47,220 INFO L93 Difference]: Finished difference Result 146 states and 194 transitions. [2024-10-14 23:16:47,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 23:16:47,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 59 [2024-10-14 23:16:47,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:16:47,222 INFO L225 Difference]: With dead ends: 146 [2024-10-14 23:16:47,222 INFO L226 Difference]: Without dead ends: 110 [2024-10-14 23:16:47,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 23:16:47,223 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:16:47,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 435 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:16:47,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-14 23:16:47,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-14 23:16:47,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 90 states have internal predecessors, (122), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 23:16:47,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 152 transitions. [2024-10-14 23:16:47,227 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 152 transitions. Word has length 59 [2024-10-14 23:16:47,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:16:47,227 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 152 transitions. [2024-10-14 23:16:47,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 23:16:47,228 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 152 transitions. [2024-10-14 23:16:47,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 23:16:47,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:16:47,229 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:16:47,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 23:16:47,429 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,SelfDestructingSolverStorable7 [2024-10-14 23:16:47,430 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 23:16:47,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:16:47,431 INFO L85 PathProgramCache]: Analyzing trace with hash -263786973, now seen corresponding path program 1 times [2024-10-14 23:16:47,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:16:47,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864242398] [2024-10-14 23:16:47,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:16:47,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:16:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:16:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 23:16:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 23:16:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 23:16:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 23:16:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 23:16:47,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 23:16:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 23:16:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 23:16:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,494 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-14 23:16:47,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:16:47,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864242398] [2024-10-14 23:16:47,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864242398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:16:47,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:16:47,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 23:16:47,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156166747] [2024-10-14 23:16:47,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:16:47,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 23:16:47,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:16:47,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 23:16:47,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 23:16:47,496 INFO L87 Difference]: Start difference. First operand 110 states and 152 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 23:16:47,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:16:47,515 INFO L93 Difference]: Finished difference Result 111 states and 153 transitions. [2024-10-14 23:16:47,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 23:16:47,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2024-10-14 23:16:47,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:16:47,516 INFO L225 Difference]: With dead ends: 111 [2024-10-14 23:16:47,517 INFO L226 Difference]: Without dead ends: 110 [2024-10-14 23:16:47,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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 23:16:47,517 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 5 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:16:47,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 416 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:16:47,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-14 23:16:47,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2024-10-14 23:16:47,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.3908045977011494) internal successors, (121), 89 states have internal predecessors, (121), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 23:16:47,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 151 transitions. [2024-10-14 23:16:47,522 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 151 transitions. Word has length 66 [2024-10-14 23:16:47,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:16:47,522 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 151 transitions. [2024-10-14 23:16:47,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 23:16:47,522 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 151 transitions. [2024-10-14 23:16:47,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 23:16:47,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:16:47,523 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:16:47,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 23:16:47,523 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 23:16:47,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:16:47,524 INFO L85 PathProgramCache]: Analyzing trace with hash 412538715, now seen corresponding path program 1 times [2024-10-14 23:16:47,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:16:47,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239744116] [2024-10-14 23:16:47,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:16:47,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:16:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:16:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 23:16:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 23:16:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 23:16:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 23:16:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 23:16:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 23:16:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 23:16:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 23:16:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,605 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-14 23:16:47,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:16:47,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239744116] [2024-10-14 23:16:47,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239744116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:16:47,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:16:47,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 23:16:47,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696298519] [2024-10-14 23:16:47,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:16:47,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 23:16:47,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:16:47,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 23:16:47,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 23:16:47,608 INFO L87 Difference]: Start difference. First operand 109 states and 151 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 23:16:47,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:16:47,630 INFO L93 Difference]: Finished difference Result 116 states and 160 transitions. [2024-10-14 23:16:47,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 23:16:47,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 67 [2024-10-14 23:16:47,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:16:47,631 INFO L225 Difference]: With dead ends: 116 [2024-10-14 23:16:47,631 INFO L226 Difference]: Without dead ends: 115 [2024-10-14 23:16:47,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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 23:16:47,632 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:16:47,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 426 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:16:47,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-14 23:16:47,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-10-14 23:16:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 93 states have internal predecessors, (126), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 23:16:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 158 transitions. [2024-10-14 23:16:47,637 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 158 transitions. Word has length 67 [2024-10-14 23:16:47,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:16:47,637 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 158 transitions. [2024-10-14 23:16:47,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 23:16:47,637 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 158 transitions. [2024-10-14 23:16:47,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-14 23:16:47,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:16:47,638 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:16:47,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 23:16:47,638 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 23:16:47,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:16:47,639 INFO L85 PathProgramCache]: Analyzing trace with hash -582634558, now seen corresponding path program 1 times [2024-10-14 23:16:47,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:16:47,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392896269] [2024-10-14 23:16:47,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:16:47,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:16:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:16:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 23:16:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 23:16:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 23:16:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 23:16:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 23:16:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 23:16:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 23:16:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 23:16:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 23:16:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,736 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-14 23:16:47,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:16:47,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392896269] [2024-10-14 23:16:47,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392896269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:16:47,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:16:47,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 23:16:47,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771714087] [2024-10-14 23:16:47,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:16:47,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 23:16:47,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:16:47,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 23:16:47,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 23:16:47,739 INFO L87 Difference]: Start difference. First operand 114 states and 158 transitions. Second operand has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 23:16:47,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:16:47,759 INFO L93 Difference]: Finished difference Result 135 states and 180 transitions. [2024-10-14 23:16:47,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 23:16:47,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 73 [2024-10-14 23:16:47,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:16:47,760 INFO L225 Difference]: With dead ends: 135 [2024-10-14 23:16:47,760 INFO L226 Difference]: Without dead ends: 106 [2024-10-14 23:16:47,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 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 23:16:47,761 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:16:47,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 417 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:16:47,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-14 23:16:47,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-14 23:16:47,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.372093023255814) internal successors, (118), 87 states have internal predecessors, (118), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 23:16:47,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 146 transitions. [2024-10-14 23:16:47,768 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 146 transitions. Word has length 73 [2024-10-14 23:16:47,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:16:47,768 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 146 transitions. [2024-10-14 23:16:47,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 23:16:47,769 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 146 transitions. [2024-10-14 23:16:47,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 23:16:47,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:16:47,769 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:16:47,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 23:16:47,770 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 23:16:47,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:16:47,771 INFO L85 PathProgramCache]: Analyzing trace with hash -666683188, now seen corresponding path program 1 times [2024-10-14 23:16:47,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:16:47,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960610637] [2024-10-14 23:16:47,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:16:47,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:16:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:16:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 23:16:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 23:16:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 23:16:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 23:16:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 23:16:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 23:16:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 23:16:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 23:16:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 23:16:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 23:16:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,864 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-14 23:16:47,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:16:47,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960610637] [2024-10-14 23:16:47,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960610637] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 23:16:47,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740466957] [2024-10-14 23:16:47,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:16:47,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 23:16:47,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 23:16:47,866 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 23:16:47,867 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 23:16:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:47,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 23:16:47,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 23:16:47,963 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 23:16:47,964 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 23:16:47,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740466957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:16:47,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 23:16:47,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-14 23:16:47,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271288132] [2024-10-14 23:16:47,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:16:47,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 23:16:47,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:16:47,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 23:16:47,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 23:16:47,965 INFO L87 Difference]: Start difference. First operand 106 states and 146 transitions. Second operand has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 23:16:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:16:47,981 INFO L93 Difference]: Finished difference Result 119 states and 160 transitions. [2024-10-14 23:16:47,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 23:16:47,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 77 [2024-10-14 23:16:47,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:16:47,982 INFO L225 Difference]: With dead ends: 119 [2024-10-14 23:16:47,982 INFO L226 Difference]: Without dead ends: 106 [2024-10-14 23:16:47,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 23:16:47,983 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:16:47,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 414 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:16:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-14 23:16:47,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-14 23:16:47,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 87 states have internal predecessors, (117), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 23:16:47,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2024-10-14 23:16:47,987 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 77 [2024-10-14 23:16:47,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:16:47,987 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2024-10-14 23:16:47,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 23:16:47,987 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2024-10-14 23:16:47,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 23:16:47,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:16:47,988 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:16:48,001 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 23:16:48,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 23:16:48,189 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 23:16:48,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:16:48,190 INFO L85 PathProgramCache]: Analyzing trace with hash 776424945, now seen corresponding path program 1 times [2024-10-14 23:16:48,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:16:48,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216656114] [2024-10-14 23:16:48,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:16:48,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:16:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:16:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 23:16:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 23:16:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 23:16:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 23:16:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 23:16:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 23:16:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 23:16:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 23:16:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 23:16:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 23:16:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 23:16:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-14 23:16:48,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:16:48,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216656114] [2024-10-14 23:16:48,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216656114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:16:48,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:16:48,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 23:16:48,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530705717] [2024-10-14 23:16:48,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:16:48,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 23:16:48,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:16:48,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 23:16:48,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 23:16:48,278 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 23:16:48,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:16:48,300 INFO L93 Difference]: Finished difference Result 106 states and 145 transitions. [2024-10-14 23:16:48,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 23:16:48,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2024-10-14 23:16:48,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:16:48,301 INFO L225 Difference]: With dead ends: 106 [2024-10-14 23:16:48,301 INFO L226 Difference]: Without dead ends: 105 [2024-10-14 23:16:48,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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 23:16:48,302 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 3 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:16:48,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 403 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:16:48,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-14 23:16:48,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-14 23:16:48,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 23:16:48,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 144 transitions. [2024-10-14 23:16:48,309 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 144 transitions. Word has length 83 [2024-10-14 23:16:48,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:16:48,310 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 144 transitions. [2024-10-14 23:16:48,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 23:16:48,310 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 144 transitions. [2024-10-14 23:16:48,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 23:16:48,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:16:48,311 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:16:48,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 23:16:48,312 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 23:16:48,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:16:48,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1700630172, now seen corresponding path program 1 times [2024-10-14 23:16:48,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:16:48,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663711191] [2024-10-14 23:16:48,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:16:48,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:16:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:16:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 23:16:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 23:16:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 23:16:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 23:16:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 23:16:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 23:16:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 23:16:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 23:16:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 23:16:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 23:16:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 23:16:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,405 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-14 23:16:48,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:16:48,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663711191] [2024-10-14 23:16:48,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663711191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:16:48,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:16:48,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 23:16:48,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151054875] [2024-10-14 23:16:48,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:16:48,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 23:16:48,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:16:48,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 23:16:48,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 23:16:48,409 INFO L87 Difference]: Start difference. First operand 105 states and 144 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 23:16:48,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:16:48,429 INFO L93 Difference]: Finished difference Result 111 states and 150 transitions. [2024-10-14 23:16:48,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 23:16:48,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 84 [2024-10-14 23:16:48,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:16:48,431 INFO L225 Difference]: With dead ends: 111 [2024-10-14 23:16:48,431 INFO L226 Difference]: Without dead ends: 105 [2024-10-14 23:16:48,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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 23:16:48,431 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:16:48,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 417 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:16:48,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-14 23:16:48,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-14 23:16:48,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 23:16:48,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 143 transitions. [2024-10-14 23:16:48,437 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 143 transitions. Word has length 84 [2024-10-14 23:16:48,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:16:48,437 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 143 transitions. [2024-10-14 23:16:48,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 23:16:48,438 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 143 transitions. [2024-10-14 23:16:48,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 23:16:48,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:16:48,439 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:16:48,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 23:16:48,439 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 23:16:48,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:16:48,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1784990498, now seen corresponding path program 1 times [2024-10-14 23:16:48,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:16:48,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302410901] [2024-10-14 23:16:48,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:16:48,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:16:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:16:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 23:16:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 23:16:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 23:16:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 23:16:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 23:16:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 23:16:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 23:16:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 23:16:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 23:16:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 23:16:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 23:16:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,533 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-14 23:16:48,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:16:48,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302410901] [2024-10-14 23:16:48,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302410901] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 23:16:48,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118247917] [2024-10-14 23:16:48,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:16:48,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 23:16:48,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 23:16:48,538 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 23:16:48,539 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 23:16:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:16:48,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 23:16:48,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 23:16:48,651 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 23:16:48,652 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 23:16:48,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118247917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:16:48,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 23:16:48,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-14 23:16:48,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062214566] [2024-10-14 23:16:48,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:16:48,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 23:16:48,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:16:48,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 23:16:48,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 23:16:48,654 INFO L87 Difference]: Start difference. First operand 105 states and 143 transitions. Second operand has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 23:16:48,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:16:48,671 INFO L93 Difference]: Finished difference Result 107 states and 144 transitions. [2024-10-14 23:16:48,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 23:16:48,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 84 [2024-10-14 23:16:48,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:16:48,672 INFO L225 Difference]: With dead ends: 107 [2024-10-14 23:16:48,672 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 23:16:48,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 23:16:48,674 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:16:48,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 391 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:16:48,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 23:16:48,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 23:16:48,675 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 23:16:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 23:16:48,675 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2024-10-14 23:16:48,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:16:48,675 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 23:16:48,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 23:16:48,675 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 23:16:48,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 23:16:48,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-14 23:16:48,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-14 23:16:48,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-14 23:16:48,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-14 23:16:48,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-14 23:16:48,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-14 23:16:48,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-14 23:16:48,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-14 23:16:48,695 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 23:16:48,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 23:16:48,884 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:16:48,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 23:16:48,921 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 23:16:48,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:16:48 BoogieIcfgContainer [2024-10-14 23:16:48,936 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 23:16:48,936 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 23:16:48,936 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 23:16:48,936 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 23:16:48,936 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:16:45" (3/4) ... [2024-10-14 23:16:48,938 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 23:16:48,941 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-14 23:16:48,942 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsFalse [2024-10-14 23:16:48,942 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-14 23:16:48,942 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsTrue [2024-10-14 23:16:48,949 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-10-14 23:16:48,953 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-14 23:16:48,954 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 23:16:48,954 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 23:16:49,041 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 23:16:49,041 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 23:16:49,041 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 23:16:49,042 INFO L158 Benchmark]: Toolchain (without parser) took 5520.12ms. Allocated memory was 148.9MB in the beginning and 216.0MB in the end (delta: 67.1MB). Free memory was 76.2MB in the beginning and 100.7MB in the end (delta: -24.5MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2024-10-14 23:16:49,042 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 148.9MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 23:16:49,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 904.12ms. Allocated memory is still 148.9MB. Free memory was 76.0MB in the beginning and 74.6MB in the end (delta: 1.4MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2024-10-14 23:16:49,042 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.44ms. Allocated memory is still 148.9MB. Free memory was 74.6MB in the beginning and 70.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 23:16:49,042 INFO L158 Benchmark]: Boogie Preprocessor took 45.71ms. Allocated memory is still 148.9MB. Free memory was 70.9MB in the beginning and 68.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 23:16:49,043 INFO L158 Benchmark]: RCFGBuilder took 564.27ms. Allocated memory was 148.9MB in the beginning and 216.0MB in the end (delta: 67.1MB). Free memory was 68.3MB in the beginning and 174.7MB in the end (delta: -106.4MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2024-10-14 23:16:49,043 INFO L158 Benchmark]: TraceAbstraction took 3845.97ms. Allocated memory is still 216.0MB. Free memory was 173.6MB in the beginning and 109.1MB in the end (delta: 64.5MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2024-10-14 23:16:49,043 INFO L158 Benchmark]: Witness Printer took 105.29ms. Allocated memory is still 216.0MB. Free memory was 109.1MB in the beginning and 100.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 23:16:49,044 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 148.9MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 904.12ms. Allocated memory is still 148.9MB. Free memory was 76.0MB in the beginning and 74.6MB in the end (delta: 1.4MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.44ms. Allocated memory is still 148.9MB. Free memory was 74.6MB in the beginning and 70.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.71ms. Allocated memory is still 148.9MB. Free memory was 70.9MB in the beginning and 68.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 564.27ms. Allocated memory was 148.9MB in the beginning and 216.0MB in the end (delta: 67.1MB). Free memory was 68.3MB in the beginning and 174.7MB in the end (delta: -106.4MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3845.97ms. Allocated memory is still 216.0MB. Free memory was 173.6MB in the beginning and 109.1MB in the end (delta: 64.5MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. * Witness Printer took 105.29ms. Allocated memory is still 216.0MB. Free memory was 109.1MB in the beginning and 100.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1628]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1628]: 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 5 procedures, 122 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 92 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 6090 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3907 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 303 IncrementalHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 2183 mSDtfsCounter, 303 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 535 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=0, InterpolantAutomatonStates: 58, 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, 15 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1110 NumberOfCodeBlocks, 1110 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1091 ConstructedInterpolants, 0 QuantifiedInterpolants, 1261 SizeOfPredicates, 0 NumberOfNonLiveVariables, 847 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 343/348 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - ProcedureContractResult [Line: 1514]: Procedure Contract for globalReturnsFalse Derived contract for procedure globalReturnsFalse. Ensures: (\result == 0) - ProcedureContractResult [Line: 1510]: Procedure Contract for globalReturnsTrue Derived contract for procedure globalReturnsTrue. Ensures: (\result == 1) RESULT: Ultimate proved your program to be correct! [2024-10-14 23:16:49,065 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