./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/list-simple/dll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/list-simple/dll2n_update_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:21:46,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:21:46,348 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 10:21:46,352 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:21:46,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:21:46,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:21:46,396 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:21:46,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:21:46,397 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:21:46,398 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:21:46,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:21:46,400 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:21:46,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:21:46,401 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:21:46,401 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:21:46,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:21:46,402 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:21:46,406 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 10:21:46,406 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:21:46,407 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 10:21:46,407 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:21:46,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:21:46,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:21:46,408 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:21:46,409 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:21:46,409 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:21:46,409 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:21:46,409 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 10:21:46,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:21:46,410 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:21:46,410 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:21:46,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:21:46,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:21:46,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:21:46,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:21:46,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:21:46,412 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:21:46,412 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:21:46,412 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:21:46,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:21:46,413 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:21:46,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:21:46,414 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:21:46,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:21:46,414 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 [2024-11-19 10:21:46,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:21:46,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:21:46,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:21:46,713 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:21:46,714 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:21:46,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_update_all.i [2024-11-19 10:21:48,240 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:21:48,470 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:21:48,470 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all.i [2024-11-19 10:21:48,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75bb8609d/1f30d85eb3404eb8b9b38f1b2ee6873c/FLAGa2d3c3983 [2024-11-19 10:21:48,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75bb8609d/1f30d85eb3404eb8b9b38f1b2ee6873c [2024-11-19 10:21:48,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:21:48,505 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:21:48,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:21:48,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:21:48,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:21:48,511 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:21:48" (1/1) ... [2024-11-19 10:21:48,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d225671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:48, skipping insertion in model container [2024-11-19 10:21:48,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:21:48" (1/1) ... [2024-11-19 10:21:48,556 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:21:48,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:21:48,922 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:21:48,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:21:48,999 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:21:49,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:49 WrapperNode [2024-11-19 10:21:49,000 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:21:49,001 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:21:49,001 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:21:49,001 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:21:49,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:49" (1/1) ... [2024-11-19 10:21:49,021 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:49" (1/1) ... [2024-11-19 10:21:49,051 INFO L138 Inliner]: procedures = 126, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 131 [2024-11-19 10:21:49,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:21:49,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:21:49,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:21:49,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:21:49,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:49" (1/1) ... [2024-11-19 10:21:49,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:49" (1/1) ... [2024-11-19 10:21:49,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:49" (1/1) ... [2024-11-19 10:21:49,108 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-19 10:21:49,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:49" (1/1) ... [2024-11-19 10:21:49,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:49" (1/1) ... [2024-11-19 10:21:49,114 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:49" (1/1) ... [2024-11-19 10:21:49,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:49" (1/1) ... [2024-11-19 10:21:49,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:49" (1/1) ... [2024-11-19 10:21:49,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:49" (1/1) ... [2024-11-19 10:21:49,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:21:49,128 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:21:49,128 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:21:49,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:21:49,129 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:49" (1/1) ... [2024-11-19 10:21:49,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:21:49,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:21:49,168 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-11-19 10:21:49,174 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-11-19 10:21:49,209 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-19 10:21:49,209 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-19 10:21:49,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 10:21:49,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 10:21:49,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 10:21:49,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 10:21:49,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 10:21:49,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 10:21:49,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 10:21:49,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 10:21:49,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 10:21:49,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 10:21:49,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 10:21:49,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 10:21:49,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 10:21:49,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:21:49,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:21:49,320 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:21:49,322 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:21:49,340 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-19 10:21:49,545 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2024-11-19 10:21:49,545 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:21:49,563 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:21:49,563 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-19 10:21:49,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:21:49 BoogieIcfgContainer [2024-11-19 10:21:49,564 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:21:49,565 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:21:49,566 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:21:49,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:21:49,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:21:48" (1/3) ... [2024-11-19 10:21:49,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e48b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:21:49, skipping insertion in model container [2024-11-19 10:21:49,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:49" (2/3) ... [2024-11-19 10:21:49,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e48b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:21:49, skipping insertion in model container [2024-11-19 10:21:49,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:21:49" (3/3) ... [2024-11-19 10:21:49,592 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2024-11-19 10:21:49,610 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:21:49,610 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-19 10:21:49,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:21:49,689 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;@211177d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:21:49,689 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-19 10:21:49,693 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 59 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:21:49,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 10:21:49,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:49,701 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:49,701 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:49,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:49,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2121138597, now seen corresponding path program 1 times [2024-11-19 10:21:49,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:49,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903024992] [2024-11-19 10:21:49,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:49,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:21:49,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:49,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903024992] [2024-11-19 10:21:49,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903024992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:21:49,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:21:49,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:21:49,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335897589] [2024-11-19 10:21:49,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:21:49,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 10:21:49,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:49,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 10:21:49,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 10:21:49,874 INFO L87 Difference]: Start difference. First operand has 61 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 59 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:21:49,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:49,889 INFO L93 Difference]: Finished difference Result 107 states and 133 transitions. [2024-11-19 10:21:49,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 10:21:49,891 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 10:21:49,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:49,898 INFO L225 Difference]: With dead ends: 107 [2024-11-19 10:21:49,898 INFO L226 Difference]: Without dead ends: 49 [2024-11-19 10:21:49,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 10:21:49,904 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:49,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:21:49,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-19 10:21:49,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-19 10:21:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.542857142857143) internal successors, (54), 48 states have internal predecessors, (54), 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-11-19 10:21:49,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2024-11-19 10:21:49,931 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 7 [2024-11-19 10:21:49,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:49,931 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2024-11-19 10:21:49,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-11-19 10:21:49,932 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2024-11-19 10:21:49,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 10:21:49,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:49,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:49,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:21:49,933 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:49,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:49,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2099897614, now seen corresponding path program 1 times [2024-11-19 10:21:49,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:49,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125086392] [2024-11-19 10:21:49,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:49,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:50,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:21:50,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:50,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125086392] [2024-11-19 10:21:50,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125086392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:21:50,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:21:50,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:21:50,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961678247] [2024-11-19 10:21:50,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:21:50,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:21:50,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:50,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:21:50,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:21:50,052 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:21:50,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:50,080 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2024-11-19 10:21:50,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:21:50,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 10:21:50,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:50,082 INFO L225 Difference]: With dead ends: 92 [2024-11-19 10:21:50,082 INFO L226 Difference]: Without dead ends: 54 [2024-11-19 10:21:50,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-19 10:21:50,084 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 5 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:50,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 100 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:21:50,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-19 10:21:50,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2024-11-19 10:21:50,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 49 states have internal predecessors, (55), 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-11-19 10:21:50,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2024-11-19 10:21:50,093 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 7 [2024-11-19 10:21:50,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:50,094 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2024-11-19 10:21:50,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:21:50,095 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2024-11-19 10:21:50,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 10:21:50,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:50,096 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:50,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:21:50,097 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:50,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:50,098 INFO L85 PathProgramCache]: Analyzing trace with hash 713346893, now seen corresponding path program 1 times [2024-11-19 10:21:50,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:50,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252567114] [2024-11-19 10:21:50,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:50,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:50,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:21:50,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:50,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252567114] [2024-11-19 10:21:50,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252567114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:21:50,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:21:50,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:21:50,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589377023] [2024-11-19 10:21:50,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:21:50,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:21:50,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:50,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:21:50,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:21:50,241 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-11-19 10:21:50,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:50,266 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2024-11-19 10:21:50,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:21:50,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 10:21:50,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:50,268 INFO L225 Difference]: With dead ends: 100 [2024-11-19 10:21:50,268 INFO L226 Difference]: Without dead ends: 53 [2024-11-19 10:21:50,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-19 10:21:50,270 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:50,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:21:50,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-19 10:21:50,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-19 10:21:50,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 52 states have internal predecessors, (58), 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-11-19 10:21:50,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2024-11-19 10:21:50,278 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 8 [2024-11-19 10:21:50,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:50,278 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2024-11-19 10:21:50,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-11-19 10:21:50,279 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2024-11-19 10:21:50,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 10:21:50,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:50,279 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:50,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:21:50,280 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:50,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:50,281 INFO L85 PathProgramCache]: Analyzing trace with hash 713348815, now seen corresponding path program 1 times [2024-11-19 10:21:50,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:50,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119112252] [2024-11-19 10:21:50,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:50,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:21:50,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:50,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119112252] [2024-11-19 10:21:50,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119112252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:21:50,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:21:50,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:21:50,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478431633] [2024-11-19 10:21:50,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:21:50,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:21:50,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:50,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:21:50,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:21:50,400 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-11-19 10:21:50,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:50,432 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2024-11-19 10:21:50,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:21:50,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 10:21:50,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:50,436 INFO L225 Difference]: With dead ends: 57 [2024-11-19 10:21:50,436 INFO L226 Difference]: Without dead ends: 56 [2024-11-19 10:21:50,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11-19 10:21:50,440 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:50,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 141 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:21:50,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-19 10:21:50,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-11-19 10:21:50,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 54 states have internal predecessors, (60), 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-11-19 10:21:50,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2024-11-19 10:21:50,446 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 8 [2024-11-19 10:21:50,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:50,446 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2024-11-19 10:21:50,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-11-19 10:21:50,447 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2024-11-19 10:21:50,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 10:21:50,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:50,447 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:50,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 10:21:50,448 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:50,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:50,448 INFO L85 PathProgramCache]: Analyzing trace with hash 638976850, now seen corresponding path program 1 times [2024-11-19 10:21:50,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:50,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971745390] [2024-11-19 10:21:50,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:50,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:50,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:21:50,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:50,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971745390] [2024-11-19 10:21:50,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971745390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:21:50,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:21:50,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:21:50,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653289600] [2024-11-19 10:21:50,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:21:50,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:21:50,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:50,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:21:50,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:21:50,566 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:21:50,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:50,604 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2024-11-19 10:21:50,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:21:50,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 10:21:50,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:50,606 INFO L225 Difference]: With dead ends: 57 [2024-11-19 10:21:50,608 INFO L226 Difference]: Without dead ends: 56 [2024-11-19 10:21:50,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11-19 10:21:50,609 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 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-11-19 10:21:50,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:21:50,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-19 10:21:50,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-19 10:21:50,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 55 states have internal predecessors, (61), 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-11-19 10:21:50,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2024-11-19 10:21:50,621 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 9 [2024-11-19 10:21:50,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:50,621 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2024-11-19 10:21:50,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:21:50,621 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2024-11-19 10:21:50,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 10:21:50,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:50,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:50,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 10:21:50,622 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:50,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:50,623 INFO L85 PathProgramCache]: Analyzing trace with hash -458376162, now seen corresponding path program 1 times [2024-11-19 10:21:50,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:50,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102903647] [2024-11-19 10:21:50,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:50,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:21:50,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:50,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102903647] [2024-11-19 10:21:50,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102903647] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:21:50,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556771964] [2024-11-19 10:21:50,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:50,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:21:50,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:21:50,742 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-11-19 10:21:50,744 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-11-19 10:21:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:50,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 10:21:50,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:21:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:21:50,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:21:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:21:50,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556771964] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:21:50,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:21:50,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-19 10:21:50,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485826848] [2024-11-19 10:21:50,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:21:50,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:21:50,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:50,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:21:50,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:21:50,990 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-11-19 10:21:51,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:51,029 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2024-11-19 10:21:51,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:21:51,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-19 10:21:51,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:51,038 INFO L225 Difference]: With dead ends: 95 [2024-11-19 10:21:51,039 INFO L226 Difference]: Without dead ends: 57 [2024-11-19 10:21:51,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:21:51,040 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 5 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:51,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 143 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:21:51,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-19 10:21:51,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-19 10:21:51,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.441860465116279) internal successors, (62), 56 states have internal predecessors, (62), 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-11-19 10:21:51,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2024-11-19 10:21:51,047 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 14 [2024-11-19 10:21:51,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:51,047 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2024-11-19 10:21:51,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-11-19 10:21:51,050 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2024-11-19 10:21:51,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 10:21:51,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:51,051 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:51,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 10:21:51,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-19 10:21:51,252 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:51,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:51,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1283728835, now seen corresponding path program 1 times [2024-11-19 10:21:51,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:51,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602325372] [2024-11-19 10:21:51,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:51,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:51,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:21:51,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:51,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602325372] [2024-11-19 10:21:51,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602325372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:21:51,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:21:51,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:21:51,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064727301] [2024-11-19 10:21:51,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:21:51,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:21:51,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:51,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:21:51,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:21:51,331 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-11-19 10:21:51,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:51,353 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2024-11-19 10:21:51,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:21:51,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 10:21:51,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:51,360 INFO L225 Difference]: With dead ends: 57 [2024-11-19 10:21:51,360 INFO L226 Difference]: Without dead ends: 56 [2024-11-19 10:21:51,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11-19 10:21:51,364 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:51,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:21:51,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-19 10:21:51,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-19 10:21:51,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 55 states have internal predecessors, (61), 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-11-19 10:21:51,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2024-11-19 10:21:51,373 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 15 [2024-11-19 10:21:51,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:51,374 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2024-11-19 10:21:51,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-11-19 10:21:51,374 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2024-11-19 10:21:51,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 10:21:51,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:51,374 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:51,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 10:21:51,375 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:51,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:51,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1140888156, now seen corresponding path program 1 times [2024-11-19 10:21:51,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:51,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958111714] [2024-11-19 10:21:51,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:51,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:51,488 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:21:51,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:51,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958111714] [2024-11-19 10:21:51,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958111714] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:21:51,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989072979] [2024-11-19 10:21:51,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:51,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:21:51,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:21:51,491 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-11-19 10:21:51,493 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-11-19 10:21:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:51,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 10:21:51,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:21:51,648 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:21:51,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:21:51,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989072979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:21:51,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:21:51,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-19 10:21:51,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149702780] [2024-11-19 10:21:51,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:21:51,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:21:51,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:51,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:21:51,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:21:51,651 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:21:51,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:51,684 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2024-11-19 10:21:51,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:21:51,685 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 10:21:51,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:51,685 INFO L225 Difference]: With dead ends: 56 [2024-11-19 10:21:51,685 INFO L226 Difference]: Without dead ends: 55 [2024-11-19 10:21:51,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:21:51,686 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:51,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 190 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:21:51,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-19 10:21:51,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-19 10:21:51,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 54 states have internal predecessors, (60), 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-11-19 10:21:51,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2024-11-19 10:21:51,694 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 16 [2024-11-19 10:21:51,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:51,694 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2024-11-19 10:21:51,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:21:51,695 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2024-11-19 10:21:51,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 10:21:51,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:51,698 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:51,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 10:21:51,902 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-11-19 10:21:51,903 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:51,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:51,903 INFO L85 PathProgramCache]: Analyzing trace with hash 100922636, now seen corresponding path program 1 times [2024-11-19 10:21:51,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:51,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562832403] [2024-11-19 10:21:51,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:51,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 10:21:51,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:51,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562832403] [2024-11-19 10:21:51,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562832403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:21:51,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:21:51,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:21:51,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407640046] [2024-11-19 10:21:51,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:21:51,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:21:51,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:51,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:21:51,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:21:51,977 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-11-19 10:21:52,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:52,019 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2024-11-19 10:21:52,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:21:52,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-19 10:21:52,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:52,020 INFO L225 Difference]: With dead ends: 99 [2024-11-19 10:21:52,020 INFO L226 Difference]: Without dead ends: 78 [2024-11-19 10:21:52,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:21:52,022 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 81 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:52,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 73 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:21:52,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-19 10:21:52,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 61. [2024-11-19 10:21:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.346938775510204) internal successors, (66), 60 states have internal predecessors, (66), 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-11-19 10:21:52,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2024-11-19 10:21:52,030 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 21 [2024-11-19 10:21:52,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:52,030 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2024-11-19 10:21:52,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-11-19 10:21:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-11-19 10:21:52,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 10:21:52,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:52,031 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:52,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 10:21:52,032 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:52,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:52,032 INFO L85 PathProgramCache]: Analyzing trace with hash 109224585, now seen corresponding path program 1 times [2024-11-19 10:21:52,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:52,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532185139] [2024-11-19 10:21:52,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:52,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 10:21:52,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:52,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532185139] [2024-11-19 10:21:52,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532185139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:21:52,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:21:52,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:21:52,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165582377] [2024-11-19 10:21:52,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:21:52,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:21:52,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:52,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:21:52,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:21:52,126 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-11-19 10:21:52,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:52,181 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2024-11-19 10:21:52,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:21:52,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-19 10:21:52,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:52,182 INFO L225 Difference]: With dead ends: 113 [2024-11-19 10:21:52,182 INFO L226 Difference]: Without dead ends: 74 [2024-11-19 10:21:52,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:21:52,184 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 16 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:52,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 117 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:21:52,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-19 10:21:52,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2024-11-19 10:21:52,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.34) internal successors, (67), 61 states have internal predecessors, (67), 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-11-19 10:21:52,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2024-11-19 10:21:52,192 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 24 [2024-11-19 10:21:52,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:52,192 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2024-11-19 10:21:52,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-11-19 10:21:52,193 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2024-11-19 10:21:52,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 10:21:52,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:52,198 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:52,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 10:21:52,198 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:52,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:52,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1677165577, now seen corresponding path program 1 times [2024-11-19 10:21:52,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:52,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534441399] [2024-11-19 10:21:52,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:52,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:52,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 10:21:52,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:52,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534441399] [2024-11-19 10:21:52,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534441399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:21:52,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:21:52,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:21:52,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706400579] [2024-11-19 10:21:52,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:21:52,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:21:52,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:52,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:21:52,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:21:52,294 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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-11-19 10:21:52,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:52,338 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2024-11-19 10:21:52,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:21:52,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-19 10:21:52,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:52,340 INFO L225 Difference]: With dead ends: 78 [2024-11-19 10:21:52,340 INFO L226 Difference]: Without dead ends: 76 [2024-11-19 10:21:52,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11-19 10:21:52,341 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:52,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 114 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:21:52,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-19 10:21:52,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2024-11-19 10:21:52,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.309090909090909) internal successors, (72), 66 states have internal predecessors, (72), 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-11-19 10:21:52,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2024-11-19 10:21:52,352 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 27 [2024-11-19 10:21:52,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:52,352 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2024-11-19 10:21:52,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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-11-19 10:21:52,353 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2024-11-19 10:21:52,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 10:21:52,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:52,353 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:52,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 10:21:52,354 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:52,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:52,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1085043721, now seen corresponding path program 1 times [2024-11-19 10:21:52,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:52,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976626216] [2024-11-19 10:21:52,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:52,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 10:21:52,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:52,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976626216] [2024-11-19 10:21:52,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976626216] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:21:52,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601393491] [2024-11-19 10:21:52,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:52,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:21:52,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:21:52,484 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-11-19 10:21:52,485 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-11-19 10:21:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:52,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:21:52,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:21:52,741 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 10:21:52,741 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:21:52,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601393491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:21:52,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:21:52,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-11-19 10:21:52,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554123278] [2024-11-19 10:21:52,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:21:52,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:21:52,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:52,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:21:52,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:21:52,743 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-11-19 10:21:52,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:52,799 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2024-11-19 10:21:52,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:21:52,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-19 10:21:52,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:52,800 INFO L225 Difference]: With dead ends: 76 [2024-11-19 10:21:52,800 INFO L226 Difference]: Without dead ends: 74 [2024-11-19 10:21:52,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:21:52,801 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 42 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:52,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 124 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:21:52,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-19 10:21:52,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2024-11-19 10:21:52,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 64 states have internal predecessors, (70), 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-11-19 10:21:52,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2024-11-19 10:21:52,805 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 30 [2024-11-19 10:21:52,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:52,806 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2024-11-19 10:21:52,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-11-19 10:21:52,806 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2024-11-19 10:21:52,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 10:21:52,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:52,806 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:52,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 10:21:53,007 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-11-19 10:21:53,007 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:53,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:53,008 INFO L85 PathProgramCache]: Analyzing trace with hash 723383100, now seen corresponding path program 1 times [2024-11-19 10:21:53,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:53,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754794966] [2024-11-19 10:21:53,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:53,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:53,160 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 10:21:53,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:53,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754794966] [2024-11-19 10:21:53,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754794966] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:21:53,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111307779] [2024-11-19 10:21:53,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:53,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:21:53,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:21:53,163 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-11-19 10:21:53,165 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-11-19 10:21:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:53,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:21:53,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:21:53,400 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 10:21:53,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:21:53,488 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 10:21:53,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111307779] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:21:53,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:21:53,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2024-11-19 10:21:53,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463554868] [2024-11-19 10:21:53,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:21:53,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 10:21:53,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:53,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 10:21:53,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-19 10:21:53,491 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 14 states, 13 states have (on average 5.230769230769231) internal successors, (68), 14 states have internal predecessors, (68), 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-11-19 10:21:53,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:53,594 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2024-11-19 10:21:53,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 10:21:53,594 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.230769230769231) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-19 10:21:53,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:53,595 INFO L225 Difference]: With dead ends: 75 [2024-11-19 10:21:53,595 INFO L226 Difference]: Without dead ends: 73 [2024-11-19 10:21:53,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-11-19 10:21:53,596 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 80 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:53,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 166 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:21:53,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-19 10:21:53,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 62. [2024-11-19 10:21:53,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 61 states have internal predecessors, (67), 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-11-19 10:21:53,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2024-11-19 10:21:53,607 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 31 [2024-11-19 10:21:53,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:53,608 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2024-11-19 10:21:53,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.230769230769231) internal successors, (68), 14 states have internal predecessors, (68), 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-11-19 10:21:53,608 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2024-11-19 10:21:53,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 10:21:53,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:53,609 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:53,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 10:21:53,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:21:53,809 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:53,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:53,810 INFO L85 PathProgramCache]: Analyzing trace with hash -613539906, now seen corresponding path program 1 times [2024-11-19 10:21:53,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:53,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336364297] [2024-11-19 10:21:53,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:53,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:53,865 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-19 10:21:53,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:53,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336364297] [2024-11-19 10:21:53,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336364297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:21:53,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:21:53,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:21:53,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134488761] [2024-11-19 10:21:53,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:21:53,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:21:53,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:53,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:21:53,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:21:53,867 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11-19 10:21:53,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:53,875 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2024-11-19 10:21:53,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:21:53,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-19 10:21:53,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:53,876 INFO L225 Difference]: With dead ends: 62 [2024-11-19 10:21:53,876 INFO L226 Difference]: Without dead ends: 61 [2024-11-19 10:21:53,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:21:53,877 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:53,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 85 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:21:53,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-19 10:21:53,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-19 10:21:53,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 60 states have internal predecessors, (66), 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-11-19 10:21:53,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2024-11-19 10:21:53,881 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 33 [2024-11-19 10:21:53,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:53,882 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2024-11-19 10:21:53,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11-19 10:21:53,882 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-11-19 10:21:53,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 10:21:53,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:53,883 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:53,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 10:21:53,883 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:53,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:53,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1839867806, now seen corresponding path program 1 times [2024-11-19 10:21:53,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:53,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382491307] [2024-11-19 10:21:53,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:53,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:54,012 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 10:21:54,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:54,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382491307] [2024-11-19 10:21:54,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382491307] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:21:54,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413056660] [2024-11-19 10:21:54,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:54,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:21:54,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:21:54,015 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:21:54,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 10:21:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:54,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 10:21:54,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:21:54,207 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 10:21:54,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:21:54,275 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 10:21:54,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413056660] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:21:54,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:21:54,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-19 10:21:54,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287560731] [2024-11-19 10:21:54,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:21:54,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 10:21:54,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:54,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 10:21:54,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-19 10:21:54,278 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 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-11-19 10:21:54,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:54,414 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2024-11-19 10:21:54,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 10:21:54,415 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-19 10:21:54,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:54,415 INFO L225 Difference]: With dead ends: 80 [2024-11-19 10:21:54,415 INFO L226 Difference]: Without dead ends: 79 [2024-11-19 10:21:54,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2024-11-19 10:21:54,416 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 76 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:54,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 198 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:21:54,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-19 10:21:54,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2024-11-19 10:21:54,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 59 states have internal predecessors, (65), 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-11-19 10:21:54,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2024-11-19 10:21:54,421 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 34 [2024-11-19 10:21:54,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:54,421 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2024-11-19 10:21:54,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 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-11-19 10:21:54,422 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2024-11-19 10:21:54,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 10:21:54,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:54,423 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:54,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 10:21:54,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 10:21:54,624 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:54,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:54,624 INFO L85 PathProgramCache]: Analyzing trace with hash -2053736700, now seen corresponding path program 1 times [2024-11-19 10:21:54,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:54,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329959604] [2024-11-19 10:21:54,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:54,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:54,690 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 10:21:54,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:54,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329959604] [2024-11-19 10:21:54,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329959604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:21:54,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:21:54,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:21:54,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362429410] [2024-11-19 10:21:54,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:21:54,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:21:54,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:54,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:21:54,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:21:54,693 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-11-19 10:21:54,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:54,729 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2024-11-19 10:21:54,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:21:54,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-19 10:21:54,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:54,730 INFO L225 Difference]: With dead ends: 83 [2024-11-19 10:21:54,730 INFO L226 Difference]: Without dead ends: 66 [2024-11-19 10:21:54,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:21:54,731 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:54,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 102 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:21:54,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-19 10:21:54,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2024-11-19 10:21:54,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 61 states have internal predecessors, (67), 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-11-19 10:21:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2024-11-19 10:21:54,735 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 35 [2024-11-19 10:21:54,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:54,735 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2024-11-19 10:21:54,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-11-19 10:21:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2024-11-19 10:21:54,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 10:21:54,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:54,737 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:54,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 10:21:54,737 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:54,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:54,737 INFO L85 PathProgramCache]: Analyzing trace with hash 819387914, now seen corresponding path program 1 times [2024-11-19 10:21:54,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:54,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106999263] [2024-11-19 10:21:54,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:54,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 10:21:54,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:54,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106999263] [2024-11-19 10:21:54,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106999263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:21:54,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:21:54,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:21:54,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845102090] [2024-11-19 10:21:54,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:21:54,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:21:54,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:54,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:21:54,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:21:54,832 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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-11-19 10:21:54,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:54,881 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2024-11-19 10:21:54,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:21:54,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-19 10:21:54,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:54,882 INFO L225 Difference]: With dead ends: 73 [2024-11-19 10:21:54,882 INFO L226 Difference]: Without dead ends: 72 [2024-11-19 10:21:54,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:21:54,882 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:54,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 121 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:21:54,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-19 10:21:54,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2024-11-19 10:21:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 62 states have internal predecessors, (69), 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-11-19 10:21:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2024-11-19 10:21:54,886 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 37 [2024-11-19 10:21:54,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:54,886 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2024-11-19 10:21:54,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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-11-19 10:21:54,887 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2024-11-19 10:21:54,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 10:21:54,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:54,887 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:54,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 10:21:54,887 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:54,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:54,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1424584755, now seen corresponding path program 1 times [2024-11-19 10:21:54,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:54,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929998960] [2024-11-19 10:21:54,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:54,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 10:21:54,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:54,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929998960] [2024-11-19 10:21:54,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929998960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:21:54,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:21:54,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:21:54,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353083851] [2024-11-19 10:21:54,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:21:54,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:21:54,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:54,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:21:54,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:21:54,961 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-11-19 10:21:54,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:54,995 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2024-11-19 10:21:54,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:21:54,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-19 10:21:54,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:54,995 INFO L225 Difference]: With dead ends: 74 [2024-11-19 10:21:54,996 INFO L226 Difference]: Without dead ends: 72 [2024-11-19 10:21:54,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11-19 10:21:54,996 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:54,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 99 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:21:54,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-19 10:21:55,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2024-11-19 10:21:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 68 states have internal predecessors, (75), 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-11-19 10:21:55,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2024-11-19 10:21:55,002 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 39 [2024-11-19 10:21:55,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:55,002 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2024-11-19 10:21:55,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-11-19 10:21:55,002 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2024-11-19 10:21:55,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 10:21:55,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:55,003 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:55,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 10:21:55,003 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:55,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:55,004 INFO L85 PathProgramCache]: Analyzing trace with hash -537145680, now seen corresponding path program 1 times [2024-11-19 10:21:55,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:55,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477698221] [2024-11-19 10:21:55,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:55,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 10:21:55,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:55,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477698221] [2024-11-19 10:21:55,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477698221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:21:55,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828827584] [2024-11-19 10:21:55,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:55,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:21:55,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:21:55,145 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:21:55,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 10:21:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:55,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:21:55,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:21:55,340 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 10:21:55,340 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:21:55,395 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 10:21:55,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828827584] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:21:55,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:21:55,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-11-19 10:21:55,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250695181] [2024-11-19 10:21:55,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:21:55,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 10:21:55,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:55,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 10:21:55,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-19 10:21:55,397 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 13 states have internal predecessors, (68), 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-11-19 10:21:55,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:55,503 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2024-11-19 10:21:55,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 10:21:55,504 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-19 10:21:55,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:55,506 INFO L225 Difference]: With dead ends: 126 [2024-11-19 10:21:55,506 INFO L226 Difference]: Without dead ends: 125 [2024-11-19 10:21:55,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-19 10:21:55,507 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:55,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 211 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:21:55,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-19 10:21:55,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 103. [2024-11-19 10:21:55,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 97 states have (on average 1.1958762886597938) internal successors, (116), 102 states have internal predecessors, (116), 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-11-19 10:21:55,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2024-11-19 10:21:55,514 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 40 [2024-11-19 10:21:55,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:55,514 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2024-11-19 10:21:55,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 13 states have internal predecessors, (68), 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-11-19 10:21:55,515 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2024-11-19 10:21:55,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 10:21:55,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:55,515 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:55,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 10:21:55,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:21:55,720 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:55,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:55,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1232736265, now seen corresponding path program 1 times [2024-11-19 10:21:55,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:55,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276396050] [2024-11-19 10:21:55,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:55,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:55,842 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 10:21:55,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:55,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276396050] [2024-11-19 10:21:55,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276396050] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:21:55,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236354481] [2024-11-19 10:21:55,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:55,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:21:55,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:21:55,844 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:21:55,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 10:21:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:55,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:21:55,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:21:56,078 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 10:21:56,078 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:21:56,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 10:21:56,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236354481] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:21:56,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:21:56,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-19 10:21:56,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629074302] [2024-11-19 10:21:56,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:21:56,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 10:21:56,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:56,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 10:21:56,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 10:21:56,149 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 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-11-19 10:21:56,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:56,203 INFO L93 Difference]: Finished difference Result 137 states and 152 transitions. [2024-11-19 10:21:56,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:21:56,204 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-19 10:21:56,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:56,205 INFO L225 Difference]: With dead ends: 137 [2024-11-19 10:21:56,205 INFO L226 Difference]: Without dead ends: 109 [2024-11-19 10:21:56,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 10:21:56,206 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 102 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:56,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 145 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:21:56,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-19 10:21:56,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-19 10:21:56,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 103 states have (on average 1.1844660194174756) internal successors, (122), 108 states have internal predecessors, (122), 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-11-19 10:21:56,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2024-11-19 10:21:56,212 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 42 [2024-11-19 10:21:56,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:56,212 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2024-11-19 10:21:56,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 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-11-19 10:21:56,213 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2024-11-19 10:21:56,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 10:21:56,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:56,213 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:56,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 10:21:56,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:21:56,414 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:56,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:56,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1616475650, now seen corresponding path program 2 times [2024-11-19 10:21:56,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:56,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929633261] [2024-11-19 10:21:56,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:21:56,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:56,438 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:21:56,438 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:21:56,541 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-19 10:21:56,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:56,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929633261] [2024-11-19 10:21:56,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929633261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:21:56,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79832127] [2024-11-19 10:21:56,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:21:56,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:21:56,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:21:56,544 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:21:56,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 10:21:56,714 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:21:56,714 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:21:56,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 10:21:56,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:21:56,771 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 10:21:56,772 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:21:56,808 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 10:21:56,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79832127] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:21:56,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:21:56,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2024-11-19 10:21:56,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160845088] [2024-11-19 10:21:56,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:21:56,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 10:21:56,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:56,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 10:21:56,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:21:56,811 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 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-11-19 10:21:56,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:56,909 INFO L93 Difference]: Finished difference Result 197 states and 224 transitions. [2024-11-19 10:21:56,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 10:21:56,909 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-19 10:21:56,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:56,910 INFO L225 Difference]: With dead ends: 197 [2024-11-19 10:21:56,910 INFO L226 Difference]: Without dead ends: 117 [2024-11-19 10:21:56,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-19 10:21:56,911 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 76 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:56,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 190 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:21:56,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-19 10:21:56,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 107. [2024-11-19 10:21:56,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 101 states have (on average 1.1584158415841583) internal successors, (117), 106 states have internal predecessors, (117), 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-11-19 10:21:56,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2024-11-19 10:21:56,918 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 51 [2024-11-19 10:21:56,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:56,918 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2024-11-19 10:21:56,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 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-11-19 10:21:56,919 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2024-11-19 10:21:56,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-19 10:21:56,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:56,919 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:56,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 10:21:57,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-19 10:21:57,124 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:57,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:57,125 INFO L85 PathProgramCache]: Analyzing trace with hash -314056838, now seen corresponding path program 1 times [2024-11-19 10:21:57,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:57,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720846061] [2024-11-19 10:21:57,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:57,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-19 10:21:57,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:57,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720846061] [2024-11-19 10:21:57,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720846061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:21:57,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:21:57,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:21:57,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959407778] [2024-11-19 10:21:57,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:21:57,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:21:57,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:57,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:21:57,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:21:57,187 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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-11-19 10:21:57,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:57,199 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2024-11-19 10:21:57,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:21:57,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-19 10:21:57,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:57,201 INFO L225 Difference]: With dead ends: 107 [2024-11-19 10:21:57,201 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 10:21:57,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:21:57,202 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:57,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 81 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:21:57,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 10:21:57,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-19 10:21:57,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.1485148514851484) internal successors, (116), 105 states have internal predecessors, (116), 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-11-19 10:21:57,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2024-11-19 10:21:57,225 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 57 [2024-11-19 10:21:57,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:57,226 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2024-11-19 10:21:57,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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-11-19 10:21:57,226 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2024-11-19 10:21:57,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-19 10:21:57,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:57,226 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:57,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 10:21:57,227 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:57,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:57,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1145827249, now seen corresponding path program 1 times [2024-11-19 10:21:57,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:57,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173103958] [2024-11-19 10:21:57,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:57,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:57,351 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 10:21:57,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:57,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173103958] [2024-11-19 10:21:57,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173103958] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:21:57,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058781102] [2024-11-19 10:21:57,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:57,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:21:57,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:21:57,354 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:21:57,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 10:21:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:57,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 10:21:57,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:21:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 10:21:57,578 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:21:57,642 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 10:21:57,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058781102] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:21:57,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:21:57,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-19 10:21:57,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268656060] [2024-11-19 10:21:57,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:21:57,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 10:21:57,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:57,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 10:21:57,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-19 10:21:57,644 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 14 states, 13 states have (on average 5.461538461538462) internal successors, (71), 14 states have internal predecessors, (71), 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-11-19 10:21:57,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:57,763 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2024-11-19 10:21:57,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 10:21:57,764 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.461538461538462) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-19 10:21:57,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:57,765 INFO L225 Difference]: With dead ends: 114 [2024-11-19 10:21:57,765 INFO L226 Difference]: Without dead ends: 113 [2024-11-19 10:21:57,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2024-11-19 10:21:57,766 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 50 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:57,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 170 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:21:57,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-19 10:21:57,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 105. [2024-11-19 10:21:57,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 101 states have (on average 1.1386138613861385) internal successors, (115), 104 states have internal predecessors, (115), 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-11-19 10:21:57,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2024-11-19 10:21:57,772 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 58 [2024-11-19 10:21:57,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:57,772 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2024-11-19 10:21:57,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.461538461538462) internal successors, (71), 14 states have internal predecessors, (71), 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-11-19 10:21:57,772 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2024-11-19 10:21:57,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-19 10:21:57,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:57,773 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:57,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-19 10:21:57,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:21:57,974 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:57,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:57,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1009102249, now seen corresponding path program 1 times [2024-11-19 10:21:57,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:57,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064293273] [2024-11-19 10:21:57,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:57,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:58,111 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 10:21:58,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:58,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064293273] [2024-11-19 10:21:58,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064293273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:21:58,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751599952] [2024-11-19 10:21:58,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:58,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:21:58,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:21:58,114 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:21:58,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 10:21:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:58,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 10:21:58,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:21:58,334 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 10:21:58,334 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:21:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 10:21:58,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751599952] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:21:58,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:21:58,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-19 10:21:58,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836180666] [2024-11-19 10:21:58,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:21:58,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 10:21:58,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:58,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 10:21:58,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:21:58,374 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 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-11-19 10:21:58,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:58,443 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2024-11-19 10:21:58,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 10:21:58,443 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-19 10:21:58,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:58,444 INFO L225 Difference]: With dead ends: 120 [2024-11-19 10:21:58,444 INFO L226 Difference]: Without dead ends: 105 [2024-11-19 10:21:58,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:21:58,445 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 18 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:58,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 171 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:21:58,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-19 10:21:58,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-19 10:21:58,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 102 states have (on average 1.1274509803921569) internal successors, (115), 104 states have internal predecessors, (115), 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-11-19 10:21:58,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2024-11-19 10:21:58,452 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 61 [2024-11-19 10:21:58,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:58,452 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2024-11-19 10:21:58,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 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-11-19 10:21:58,452 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2024-11-19 10:21:58,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 10:21:58,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:58,453 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:58,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-19 10:21:58,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-19 10:21:58,658 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:58,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:58,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1649993542, now seen corresponding path program 1 times [2024-11-19 10:21:58,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:58,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154385207] [2024-11-19 10:21:58,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:58,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:58,859 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 10:21:58,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:58,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154385207] [2024-11-19 10:21:58,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154385207] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:21:58,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67591492] [2024-11-19 10:21:58,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:58,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:21:58,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:21:58,862 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:21:58,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 10:21:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:59,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:21:59,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:21:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 10:21:59,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:21:59,164 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 10:21:59,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67591492] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:21:59,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:21:59,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-11-19 10:21:59,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799673902] [2024-11-19 10:21:59,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:21:59,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 10:21:59,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:21:59,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 10:21:59,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-19 10:21:59,167 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand has 13 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 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-11-19 10:21:59,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:21:59,262 INFO L93 Difference]: Finished difference Result 143 states and 160 transitions. [2024-11-19 10:21:59,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 10:21:59,262 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-19 10:21:59,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:21:59,263 INFO L225 Difference]: With dead ends: 143 [2024-11-19 10:21:59,264 INFO L226 Difference]: Without dead ends: 142 [2024-11-19 10:21:59,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-19 10:21:59,264 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 15 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:21:59,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 213 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:21:59,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-19 10:21:59,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-19 10:21:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 139 states have (on average 1.129496402877698) internal successors, (157), 141 states have internal predecessors, (157), 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-11-19 10:21:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 157 transitions. [2024-11-19 10:21:59,275 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 157 transitions. Word has length 65 [2024-11-19 10:21:59,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:21:59,275 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 157 transitions. [2024-11-19 10:21:59,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 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-11-19 10:21:59,279 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2024-11-19 10:21:59,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 10:21:59,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:21:59,280 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:21:59,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-19 10:21:59,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-19 10:21:59,481 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:21:59,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:21:59,483 INFO L85 PathProgramCache]: Analyzing trace with hash -800857796, now seen corresponding path program 1 times [2024-11-19 10:21:59,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:21:59,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154122035] [2024-11-19 10:21:59,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:59,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:21:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:59,656 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-19 10:21:59,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:21:59,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154122035] [2024-11-19 10:21:59,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154122035] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:21:59,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843861400] [2024-11-19 10:21:59,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:21:59,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:21:59,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:21:59,659 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:21:59,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-19 10:21:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:21:59,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 10:21:59,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:22:00,052 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 10:22:00,052 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:22:00,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843861400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:22:00,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:22:00,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 14 [2024-11-19 10:22:00,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10287848] [2024-11-19 10:22:00,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:22:00,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 10:22:00,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:22:00,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 10:22:00,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-19 10:22:00,054 INFO L87 Difference]: Start difference. First operand 142 states and 157 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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-11-19 10:22:00,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:22:00,099 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2024-11-19 10:22:00,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 10:22:00,099 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-19 10:22:00,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:22:00,103 INFO L225 Difference]: With dead ends: 142 [2024-11-19 10:22:00,104 INFO L226 Difference]: Without dead ends: 77 [2024-11-19 10:22:00,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-19 10:22:00,105 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:22:00,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 108 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:22:00,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-19 10:22:00,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-19 10:22:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 76 states have internal predecessors, (83), 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-11-19 10:22:00,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2024-11-19 10:22:00,109 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 67 [2024-11-19 10:22:00,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:22:00,110 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2024-11-19 10:22:00,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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-11-19 10:22:00,110 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2024-11-19 10:22:00,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-19 10:22:00,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:22:00,110 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:22:00,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-19 10:22:00,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-19 10:22:00,312 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-19 10:22:00,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:22:00,312 INFO L85 PathProgramCache]: Analyzing trace with hash 120458689, now seen corresponding path program 2 times [2024-11-19 10:22:00,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:22:00,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304120775] [2024-11-19 10:22:00,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:22:00,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:22:00,331 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 10:22:00,331 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:22:00,360 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-19 10:22:00,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:22:00,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304120775] [2024-11-19 10:22:00,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304120775] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:22:00,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230404383] [2024-11-19 10:22:00,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:22:00,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:22:00,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:22:00,364 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:22:00,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-19 10:22:00,544 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 10:22:00,545 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:22:00,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 10:22:00,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:22:00,626 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-19 10:22:00,626 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:22:00,723 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-19 10:22:00,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230404383] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:22:00,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:22:00,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-19 10:22:00,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11802437] [2024-11-19 10:22:00,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:22:00,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 10:22:00,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:22:00,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 10:22:00,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:22:00,725 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 states have internal predecessors, (73), 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-11-19 10:22:00,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:22:00,753 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2024-11-19 10:22:00,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:22:00,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-19 10:22:00,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:22:00,754 INFO L225 Difference]: With dead ends: 77 [2024-11-19 10:22:00,754 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 10:22:00,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-19 10:22:00,755 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:22:00,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:22:00,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 10:22:00,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 10:22:00,756 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-11-19 10:22:00,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 10:22:00,756 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2024-11-19 10:22:00,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:22:00,756 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 10:22:00,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 states have internal predecessors, (73), 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-11-19 10:22:00,757 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 10:22:00,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 10:22:00,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2024-11-19 10:22:00,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2024-11-19 10:22:00,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2024-11-19 10:22:00,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2024-11-19 10:22:00,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2024-11-19 10:22:00,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2024-11-19 10:22:00,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2024-11-19 10:22:00,761 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2024-11-19 10:22:00,761 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2024-11-19 10:22:00,761 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2024-11-19 10:22:00,761 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2024-11-19 10:22:00,761 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2024-11-19 10:22:00,761 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2024-11-19 10:22:00,762 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2024-11-19 10:22:00,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-19 10:22:00,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-19 10:22:00,966 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:22:00,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 10:22:01,114 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:22:01,128 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-11-19 10:22:01,129 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-11-19 10:22:01,129 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-11-19 10:22:01,129 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-11-19 10:22:01,130 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-19 10:22:01,130 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-19 10:22:01,131 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-11-19 10:22:01,132 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-11-19 10:22:01,132 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-11-19 10:22:01,132 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-11-19 10:22:01,137 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-19 10:22:01,137 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-19 10:22:01,138 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-19 10:22:01,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:22:01 BoogieIcfgContainer [2024-11-19 10:22:01,139 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:22:01,139 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:22:01,139 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:22:01,140 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:22:01,140 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:21:49" (3/4) ... [2024-11-19 10:22:01,144 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 10:22:01,149 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2024-11-19 10:22:01,156 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-19 10:22:01,156 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-19 10:22:01,156 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 10:22:01,157 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 10:22:01,273 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:22:01,276 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 10:22:01,276 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:22:01,276 INFO L158 Benchmark]: Toolchain (without parser) took 12771.99ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 105.0MB in the beginning and 64.7MB in the end (delta: 40.3MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. [2024-11-19 10:22:01,277 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 121.6MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:22:01,277 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.84ms. Allocated memory is still 176.2MB. Free memory was 105.0MB in the beginning and 84.8MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-19 10:22:01,277 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.43ms. Allocated memory is still 176.2MB. Free memory was 84.8MB in the beginning and 82.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:22:01,277 INFO L158 Benchmark]: Boogie Preprocessor took 75.38ms. Allocated memory is still 176.2MB. Free memory was 82.6MB in the beginning and 80.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:22:01,277 INFO L158 Benchmark]: RCFGBuilder took 435.51ms. Allocated memory is still 176.2MB. Free memory was 79.9MB in the beginning and 61.2MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 10:22:01,278 INFO L158 Benchmark]: TraceAbstraction took 11573.27ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 60.7MB in the beginning and 71.0MB in the end (delta: -10.3MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2024-11-19 10:22:01,278 INFO L158 Benchmark]: Witness Printer took 136.66ms. Allocated memory is still 211.8MB. Free memory was 70.0MB in the beginning and 64.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 10:22:01,281 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.99ms. Allocated memory is still 121.6MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 494.84ms. Allocated memory is still 176.2MB. Free memory was 105.0MB in the beginning and 84.8MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.43ms. Allocated memory is still 176.2MB. Free memory was 84.8MB in the beginning and 82.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.38ms. Allocated memory is still 176.2MB. Free memory was 82.6MB in the beginning and 80.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 435.51ms. Allocated memory is still 176.2MB. Free memory was 79.9MB in the beginning and 61.2MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11573.27ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 60.7MB in the beginning and 71.0MB in the end (delta: -10.3MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * Witness Printer took 136.66ms. Allocated memory is still 211.8MB. Free memory was 70.0MB in the beginning and 64.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID * 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: 599]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 599]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 630]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 630]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 620]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 620]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 613]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 613]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 11.3s, OverallIterations: 27, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 637 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 637 mSDsluCounter, 3556 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2474 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1445 IncrementalHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 1082 mSDtfsCounter, 1445 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1171 GetRequests, 994 SyntacticMatches, 12 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=25, InterpolantAutomatonStates: 163, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 138 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1497 NumberOfCodeBlocks, 1373 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1919 ConstructedInterpolants, 0 QuantifiedInterpolants, 4553 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3132 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 50 InterpolantComputations, 17 PerfectInterpolantSequences, 855/1146 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 14 specifications checked. All of them hold - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: (((i == 0) && (len == 2)) || (((1 <= i) && (i <= 2147483645)) && (len == 2))) - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: ((index == 0) || (index <= 2147483648)) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: (((len == 2) && (len <= 1)) || ((2 == len) && (len == 2))) - InvariantResult [Line: 633]: Loop Invariant Derived loop invariant: ((((i == 0) && (len == 2)) || (((i <= 2147483645) && (2 <= i)) && (len == 2))) || ((i == 1) && (len == 2))) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: ((index == 0) || (index <= 2147483648)) RESULT: Ultimate proved your program to be correct! [2024-11-19 10:22:01,313 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